scientific article; zbMATH DE number 4083539
Berlekamp algorithmbit serial multiplication algorithmcoding theorycyclotomic polynomialsdual basesEuclidean domainsfatorization of polynomialsfinite fieldslinear feedback shift register sequenceslinear recurrencesmulti-user communication systemsmultiplication algorithmsnormquadratic equationstrace
Polynomials over finite fields (11T06) Finite fields and commutative rings (number-theoretic aspects) (11T99) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to field theory (12-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Linear codes (general theory) (94B05)
- Computational problems in the theory of finite fields
- Polynomial description of binary linear codes and related properties
- Optimal algorithms for total exchange without buffering on the hypercube
- Cross-correlations of geometric sequences in characteristic two
- A simple method to estimate the maximum nontrivial correlation of some sets of sequences
- The vulnerability of geometric sequences based on fields of odd characteristic
- Using transforming matrices to generate DNA clone grids
- Randomized algorithms over finite fields for the exact parity base problem.
- 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
- Mutually unbiased bases, generalized spin matrices and separability
- AOP arithmetic architectures over GF(2\(^m\))
- Linear recurring sequences over modules
- Linear recurring sequences over rings and modules
- \(\sigma\)-Automata and Chebyshev-polynomials
- State complexity of GF(2)-operations on unary languages
- Approximate unitary 3-designs from transvection Markov chains
- A search for good pseudo-random number generators: survey and empirical studies
- On equivalence between known families of quadratic APN functions
- New characterizations for the multi-output correlation-immune Boolean 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 the inverses of Kasami and Bracken-Leander exponents
- New quadratic bent functions in polynomial forms with coefficients in extension fields
- Classification of finite fields with applications
- On the algebraic construction of cryptographically good 32 32 binary linear transformations
- On inversion in \(\mathbb Z_{{2^n}-1}\)
- On the subfield subcodes of Hermitian codes
- A new class of monomial bent functions
- Periodic binary harmonic functions on lattices
- A novel approach for bit-serial \(AB^{2}\) multiplication in finite fields \(\mathrm{GF}(2^m)\)
- The generalized Goertzel algorithm and its parallel hardware implementation
- Affine equivalence in the AES round function
- On the algebraic degree of iterated power functions
- scientific article; zbMATH DE number 429512 (Why is no real title available?)
- scientific article; zbMATH DE number 7228861 (Why is no real title available?)
- Efficient Finite Fields in the Maxima Computer Algebra System
- Parallel Generation of ℓ-Sequences
- On the size of Kakeya sets in finite vector spaces
- scientific article; zbMATH DE number 503199 (Why is no real title available?)
- Remarks on the Schoof-Elkies-Atkin algorithm
- On the linear complexity of product sequences of linear recurring sequences
- Classical wavelet transforms over finite fields
- Attacks against filter generators exploiting monomial mappings
- Computing isogenies between elliptic curves over $F_{p^n}$ using Couveignes's algorithm
- scientific article; zbMATH DE number 6308159 (Why is no real title available?)
- Involutions, trace maps, and pseudorandom numbers
- Algebraic construction of near-bent function with application to cryptography
- Generalized wavelet transforms over finite fields
- Efficient detection of discrepancies in multiple file copies
- Optimum PN sequences for CDMA systems
- Linear cellular automata and recurring sequences in finite fields
- Linear cellular automata and recurring sequences in finite fields
- Diagonal cellular factor pair Latin squares
- CARPenter: A Cellular Automata Based Resilient Pentavalent Stream Cipher
- On decompositions of permutation polynomials into quadratic and cubic power permutations
- When does \(G(x)+\gamma \, \text{Tr}(H(x))\) permute \(\mathbb F_{p^n}\)?
- Satisfiability modulo finite fields
- A reliable chaos-based cryptography using Galois field
- The \(p\)-rank of curves of Fermat type
- Complex matrix inversion via real matrix inversions
- On the security of the Lucas function
- Further existence results of decompositions of permutation polynomials
- Cross-correlations of linearly and quadratically related geometric sequences and GMW sequences
- On CCZ-equivalence of two new APN functions in trivariate form
- On the peak-to-average power ratio of M-sequences
- On linear complexity of sequences over \(\text{GF}(2^n)\)
- Two-tuple balance of non-binary sequences with ideal two-level autocorrelation
- The divisibility modulo 24 of Kloosterman sums on \(\text{GF}(2^m)\), \(m\) odd
- On splitting sets in block designs and finding roots of polynomials
- On Niho type cross-correlation functions of m-sequences
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3813755)