scientific article; zbMATH DE number 607286
From MaRDI portal
Publication:4301239
zbMATH Open0820.11072MaRDI QIDQ4301239FDOQ4301239
Authors: 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)
- 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
- Trivectors yielding spreads in PG\((5,2)\)
- On the numerical range of matrices over a finite field
- Low complexity of a class of normal bases over finite fields
- On the optimality of extended maximal length linear feedback shift register sequences
- Results on multiples of primitive polynomials and their products over GF(2)
- Periodic binary harmonic functions on lattices
- Tabulation of cubic function fields via polynomial binary cubic forms
- The field descent method
- Explicit N-polynomials of \(2\)-power degree over finite fields. I
- Partitions functions with periodic parity
- Derangements in subspace actions of finite classical groups
- The dynamical zeta function for commuting automorphisms of zero-dimensional groups
- Theoretical formulation of finite-dimensional discrete phase spaces. II. On the uncertainty principle for Schwinger unitary operators
- Period distribution of generalized discrete Arnold cat map
- On the arrowhead-Fibonacci numbers
- Espresso: a stream cipher for 5G wireless communication systems
- A new multi-linear universal hash family
- Fooling-sets and rank
- Commutative Polynomial Rings which are Principal Ideal Rings
- A characterization of primitive polynomials over finite fields.
- Division of tetranomials by type II pentanomials and orthogonal arrays
- Calculation of the quality parameter of digital nets and application to their construction
- On the counting function of the sets of parts \(\mathcal A\) such that the partition function \(p(\mathcal {A},n)\) takes even values for \(n\) large enough
- Generating random vectors in \((\mathbb Z/ p \mathbb Z)^d\) via an affine random process
- The Software Performance of Authenticated-Encryption Modes
- New criteria for MRD and Gabidulin codes and some rank-metric code constructions
- Non-spectral problem for the planar self-affine measures
- Polynomial basis multiplication over \(\text{GF}(2^m)\)
- On the optimal Halton sequence
- Optimum distance flag codes from spreads via perfect matchings in graphs
- A simple method for obtaining relations among factor basis elements for special hyperelliptic curves
- On a class of linear functional equations without range condition
- Computing the periods of preimages in surjective cellular automata
- On affine (non)equivalence of Boolean functions
- Infinite families of irregular primes in cyclotomic function fields
- Towers of Global Function Fields with Asymptotically Many Rational Places and an Improvement on the Gilbert - Varshamov Bound
- A class of binary matrices preserving rank under matrix addition and its application
- Relative \((p^a, p^b, p^a, p^{a-b})\)-difference sets: A unified exponent bound and a local ring construction
- Non-standard sequence subgroups in finite fields
- On the number of equivalence classes of attracting dynamical systems
- A general mixing strategy for the ECB-Mix-ECB mode of operation
- Asymptotic stability in probability for stochastic Boolean networks
- Maps admitting trialities but not dualities
- Some special cyclic codes of length 2n
- Skew cellularity of the Hecke algebras of type 𝐺(ℓ,𝑝,𝑛)
- Approximation of boolean functions by combinatorial rectangles
- 64-bit and 128-bit DX random number generators
- On group automata over finite fields.
- Algebraic curves and cryptography
- Scalable and systolic architecture for computing double exponentiation over \(\text{GF}(2^m)\)
- On units in loop algebra \(F[M(\mathrm{Dih}(C_p^2),2)]\)
- Self-duality of generalized twisted Gabidulin codes
- Analysis of Rabin's irreducibility test for polynomials over finite fields
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)
