zbMath0662.94014MaRDI QIDQ3813755
Robert J. McEliece
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
On linear complexity of sequences over \(\text{GF}(2^n)\),
Involutions, trace maps, and pseudorandom numbers,
Algebraic construction of near-bent function with application to cryptography,
Mutually unbiased bases, generalized spin matrices and separability,
AOP arithmetic architectures over GF(2\(^m\)),
Unnamed Item,
On the linear complexity of product sequences of linear recurring sequences,
Two-tuple balance of non-binary sequences with ideal two-level autocorrelation,
Linear recurring sequences over modules,
The divisibility modulo 24 of Kloosterman sums on \(\text{GF}(2^m)\), \(m\) odd,
Approximate unitary 3-designs from transvection Markov chains,
Linear recurring sequences over rings and modules,
A search for good pseudo-random number generators: survey and empirical studies,
On the size of Kakeya sets in finite vector spaces,
Diagonal cellular factor pair Latin squares,
When does \(G(x)+\gamma \, \text{Tr}(H(x))\) permute \(\mathbb F_{p^n}\)?,
CARPenter: A Cellular Automata Based Resilient Pentavalent Stream Cipher,
On decompositions of permutation polynomials into quadratic and cubic power permutations,
On equivalence between known families of quadratic APN functions,
New characterizations for the multi-output correlation-immune Boolean functions,
Using transforming matrices to generate DNA clone grids,
On the algebraic degree of iterated power functions,
The Fourier spectral characterization for the correlation-immune functions over \(\mathbb{F}_p \),
On the number of the rational zeros of linearized polynomials and the second-order nonlinearity of cubic Boolean functions,
On inversion in \(\mathbb Z_{{2^n}-1}\),
Efficient Finite Fields in the Maxima Computer Algebra System,
On the subfield subcodes of Hermitian codes,
Generalized wavelet transforms over finite fields,
On splitting sets in block designs and finding roots of polynomials,
On the inverses of Kasami and Bracken-Leander exponents,
On the construction of \(20 \times 20\) and \(2 4 \times 24\) binary matrices with good implementation properties for lightweight block ciphers and hash functions,
Efficient detection of discrepancies in multiple file copies,
Computational problems in the theory of finite fields,
Polynomial description of binary linear codes and related properties,
\(\sigma\)-Automata and Chebyshev-polynomials,
Attacks Against Filter Generators Exploiting Monomial Mappings,
On the security of the Lucas function,
On Niho type cross-correlation functions of \(m\)-sequences,
A new class of monomial bent functions,
Optimal algorithms for total exchange without buffering on the hypercube,
Periodic binary harmonic functions on lattices,
A novel approach for bit-serial \(AB^{2}\) multiplication in finite fields \(\mathrm{GF}(2^m)\),
Cross-correlations of linearly and quadratically related geometric sequences and GMW sequences,
The generalized Goertzel algorithm and its parallel hardware implementation,
Linear cellular automata and recurring sequences in finite fields,
Remarks on the Schoof-Elkies-Atkin algorithm,
Affine equivalence in the AES round function,
Parallel Generation of ℓ-Sequences,
Computing isogenies between elliptic curves over $F_{p^n}$ using Couveignes's algorithm,
Optimum PN Sequences for CDMA Systems,
Linear cellular automata and recurring sequences in finite fields,
New quadratic bent functions in polynomial forms with coefficients in extension fields,
Classification of finite fields with applications,
Unnamed Item,
Randomized algorithms over finite fields for the exact parity base problem.,
Cross-correlations of geometric sequences in characteristic two,
On the algebraic construction of cryptographically good \(32 \times 32\) binary linear transformations,
State complexity of GF(2)-operations on unary languages,
A simple method to estimate the maximum nontrivial correlation of some sets of sequences,
On the peak-to-average power ratio of \(M\)-sequences,
The vulnerability of geometric sequences based on fields of odd characteristic