scientific article; zbMATH DE number 607286
From MaRDI portal
Publication:4301239
zbMATH Open0820.11072MaRDI QIDQ4301239FDOQ4301239
Rudolf Lidl, Harald Niederreiter
Publication date: 18 July 1994
Title of this publication is not available (Why is that?)
Recommendations
finite fieldsfinite geometrybibliographycryptologyshift register sequencealgebraic coding theorybibliographical noteshistorical notes
Cryptography (94A60) Combinatorial aspects of finite geometries (05B25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cyclic codes (94B15) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory (11-01) Finite fields and commutative rings (number-theoretic aspects) (11Txx)
Cited In (only showing first 100 items - show all)
- Bounds for the quality parameter of digital shift nets over \(\mathbb Z_2\)
- On planes through points off the twisted cubic in \(\mathrm{PG}(3,q)\) and multiple covering codes
- On enumeration of irreducible polynomials and related objects over a finite field with respect to their trace and norm
- Twisted cubic and plane-line incidence matrix in \(\mathrm{PG}(3,q)\)
- Low complexity bit-parallel multiplier for \(\mathbb{F}_{2^n}\) defined by repeated polynomials
- Fast hashing to \(\mathbb{G}_2\) on pairing-friendly curves with the lack of twists
- Computing shifts in 90/150 cellular automata sequences
- Units in finite loop algebras of \(RA2\) loops.
- Twisted cubic and point-line incidence matrix in \(\operatorname{PG}(3,q)\)
- Construction of mutually unbiased maximally entangled bases through permutations of Hadamard matrices
- Wavelength routing in optical networks of diameter two
- Title not available (Why is that?)
- Numerical range over finite fields: restriction to subspaces
- Optimal ordered binary decision diagrams for read-once formulas
- Partially APN Boolean functions and classes of functions that are not APN infinitely often
- Large-order multiple recursive generators with modulus \(2^{31}-1\)
- Explicit characterization of two classes of regular bent functions
- On skew-symmetric Toeplitz matrices over finite fields with periodicity conditions
- An efficient algorithm for software generation of binary linear recurrences
- High-performance generic-point parallel scalar multiplication
- Systematic encoders for generalized Gabidulin codes and the \(q\)-analogue of Cauchy matrices
- An orbital construction of optimum distance flag codes
- Modeling and analyzing finite state automata in the finite field \(F_{2}\)
- Partition Algorithm For Parallel Processing Of Array Multiplication In Gf(2m) Fields
- On a bounded remainder set for a digital Kronecker sequence
- The Artin-Mazur zeta function of a dynamically affine rational map in positive characteristic
- The construction of regular Hadamard matrices by cyclotomic classes
- Security of the Poseidon hash function against non-binary differential and linear attacks
- Regular \(p\)-ary bent functions with five terms and Kloosterman sums
- Irreducible compositions of polynomials over finite fields of even characteristic
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the co-complex-type \(k\)-Fibonacci numbers
- Bagua: a NFSR-based stream cipher constructed following confusion and diffusion principles
- Algebraic quantum synchronizable codes
- Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial
- Some classes of the MDS matrices over a finite field
- Proof techniques in quasi-Monte Carlo theory
- Unit group of semisimple group algebras of some non-metabelian groups of order 120
- Speedup of bit-parallel Karatsuba multiplier in \(\mathrm{GF}(m^2)\) generated by trinomials
- Formalization of ring theory in PVS. Isomorphism theorems, principal, prime and maximal ideals, Chinese remainder theorem
- A digital pseudo-random number generator based on sawtooth chaotic map with a guaranteed enhanced period
- Graph reconstruction in the congested clique
- Primitive idempotent tables of cyclic and constacyclic codes
- Message encoding and retrieval for spread and cyclic orbit codes
- Message authentication based on cryptographically secure CRC without polynomial irreducibility test
- Traces of Hecke operators and refined weight enumerators of Reed-Solomon codes
- On the asymptotic order of circuit codes
- The complexity of the equivalence and equation solvability problems over meta-abelian groups
- Digital inversive vectors can achieve polynomial tractability for the weighted star discrepancy and for multivariate integration
- Large families of pseudorandom sequences of k symbols and their complexity, Part II
- On the numerical range of matrices defined over a finite field
- Flag codes of maximum distance and constructions using Singer groups
- Enumeration of inequivalent irreducible Goppa codes
- Construction algorithms for polynomial lattice rules for multivariate integration
- Analysis and improvement of a novel image fusion encryption algorithm based on DNA sequence operation and hyper-chaotic system
- Recovering erasures by using MDS codes over extension alphabets
- On the existence for some special primitive elements in finite fields
- Control of intracellular molecular networks using algebraic methods
- On the classification of exceptional planar functions over \(\mathbb F_p\)
- Contrast-optimal k out of n secret sharing schemes in visual cryptography
- Divisibility of polynomials over finite fields and combinatorial applications
- A nonlinear elliptic curve cryptosystem based on matrices
- An alternative class of irreducible polynomials for optimal extension fields
- The independence of two randomness properties of sequences over finite fields
- The Gaussian normal basis and its trace basis over finite fields
- Repeated-root constacyclic codes of length \(\ell^{t}p^{s}\) and their dual codes
- Dynamics of finite linear cellular automata over \(\mathbb Z_N\)
- Security analysis of the public key algorithm based on Chebyshev polynomials over the integer ring \(Z_{N}\)
- Breaking RSA Generically Is Equivalent to Factoring
- On the parity of the number of irreducible factors of self-reciprocal polynomials over finite fields
- On Gekeler's conjecture for function fields
- Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform
- Isomorphism classes of Picard curves over finite fields
- On modes of operations of a block cipher for authentication and authenticated encryption
- The complex-typek-Fibonacci sequences and their applications
- On the existence of abelian Hadamard difference sets and a new family of difference sets
- The trace of an optimal normal element and low complexity normal bases
- All two-weight irreducible cyclic codes?
- Improved lower bounds for permutation arrays using permutation rational functions
- Mixed orthogonal arrays, \((u,m,\mathbf{e},s)\)-nets, and \((u,\mathbf{e},s)\)-sequences
- Learning nested differences in the presence of malicious noise
- Efficient computer search of large-order multiple recursive pseudo-random number generators
- Period distribution analysis of some linear maps
- Higher-order nonlinearity of Kasami functions
- Using the theory of cyclotomy to factor cyclotomic polynomials over finite fields
- Counting isomorphism classes of pointed hyperelliptic curves of genus 4 over finite fields with even characteristic
- Some noteworthy alternating trilinear forms
- Title not available (Why is that?)
- Elementary criteria for irreducibility of \(f(X^r)\)
- A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point
- Isomorphism classes of hyperelliptic curves of genus 2 over finite fields with characteristic 2
- On self-dual MRD codes
- Low complexity bit parallel multiplier for \(GF(2^m)\) generated by equally-spaced trinomials
- Isomorphism classes of hyperelliptic curves of genus 3 over finite fields
- A distance-labelling problem for hypercubes
- Linearized polynomial maps over finite fields
- Improving random number generators in the Monte Carlo simulations via twisting and combining
- Counting irreducible polynomials of degree \(r\) over \(\mathbb F_{q^n}\) and generating Goppa codes using the lattice of subfields of \(\mathbb F_{q^{nr}}\)
- Division of trinomials by pentanomials and orthogonal arrays
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 Q4301239)
