We study software performance of authenticated-encryption modes CCM, GCM, and OCB.
Across a variety of platforms, we find OCB to be substantially faster than either alternative …

We introduce a new kind of word-oriented linear feedback shift register called $\sigma-$
LFSR which is constructed with the instructions of the modern processor and have fast …

Linear finite state machines (LFSMs) are particular primitives widely used in information
theory, coding theory and cryptography. Among those linear automata, a particular case of …

We discuss a conjecture concerning the enumeration of nonsingular matrices over a finite
field that are block companion and whose order is the maximum possible in the …

Given a primitive polynomial p(x), of degree n, we deal with the problem of finding the
number of possible linear feedback shift register realizations, with m-input m-output delay …

In this paper, we introduce a new type of feedback shift register based on words, called σ-
linear feedback shift register (σ-LFSR) which can make full use of the instructions of modern …

OCB (v1.1) Page 1 OCB (v1.1) Submitted and designed by Ted Krovetz and Phillip Rogaway
ted@krovetz.net 15 September 2016 Here OCB means the algorithm of RFC 7253 [1]. Rather …

The multiple-recursive matrix method for generating pseudorandom vectors was introduced
by Niederreiter (1993). We propose an algorithm for finding an efficient primitive multiple …

We discuss the problem of counting the number of primitive transformation shift registers and
its equivalent formulation in terms of Singer cycles in a corresponding general linear group …

A major problem in using iterative number generators of the form xi= f (xi− 1) is that they can
enter unexpectedly short cycles. This is hard to analyze when the generator is designed …