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)
- 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
- 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
- An Experimental Exploration of Marsaglia's xorshift Generators, Scrambled
- Algorithms for computing parameters of graph-based extensions of BCH codes
- On the distribution of points in orbits of \(\text{PGL}(2,q)\) acting on \(\text{GF}(q^{n})\).
- Applying quick exponentiation for block upper triangular matrices
- Generalized reduction formula for discrete Wigner functions of multiqubit systems
- Spread decoding in extension fields
- Troika: a ternary cryptographic hash function
- Mutually orthogonal Latin squares based on cellular automata
- Difference sets over the Galois ring \(\text{GR}(2^n,2)\)
- Extractors for binary elliptic curves
- Lightweight Multiplication in $$GF(2^n)$$ with Applications to MDS Matrices
- Symmetry properties of multiple recursive random number generators in full period and spectral test
- On the parity of generalized partition functions. III
- On the distribution of the density of maximal order elements in general linear groups
- Maximum distance separable poset codes
- On the elements of sets with even partition function
- Exponents of skew polynomials.
- Sets with even partition functions and 2-adic integers
- Reversible group rings.
- Symmetric powers and modular invariants of elementary abelian \(p\)-groups
- New algorithms for generating Conway polynomials over finite fields
- Linear recurrence sequences without zeros
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)
