scientific article; zbMATH DE number 607286
From MaRDI portal
Publication:4301239
algebraic coding theorybibliographical notesbibliographycryptologyfinite fieldsfinite geometryhistorical notesshift register sequence
Combinatorial aspects of finite geometries (05B25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory (11-01) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Finite fields and commutative rings (number-theoretic aspects) (11Txx) Cryptography (94A60) Cyclic codes (94B15)
Recommendations
Cited in
(only showing first 100 items - show all)- Elementary criteria for irreducibility of \(f(X^r)\)
- A distance-labelling problem for hypercubes
- Maximum distance separable poset codes
- Extractors for binary elliptic curves
- The trace of an optimal normal element and low complexity normal bases
- Low-complexity multiplexer-based normal basis multiplier over GF(2ᵐ)
- Two-periodic dynamics in finite extensions of the p-adic number field
- On the existence of abelian Hadamard difference sets and a new family of difference sets
- Calculation of the quality parameter of digital nets and application to their construction
- Difference sets over the Galois ring \(\text{GR}(2^n,2)\)
- Learning nested differences in the presence of malicious noise
- Symmetry properties of multiple recursive random number generators in full period and spectral test
- Approximation of boolean functions by combinatorial rectangles
- On the distribution of points in orbits of \(\text{PGL}(2,q)\) acting on \(\text{GF}(q^{n})\).
- Partitions functions with periodic parity
- On group automata over finite fields.
- Optimal ordered binary decision diagrams for read-once formulas
- Contrast-optimal k out of n secret sharing schemes in visual cryptography
- Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform
- All two-weight irreducible cyclic codes?
- Wavelength routing in optical networks of diameter two
- Self-duality of generalized twisted Gabidulin codes
- Explicit characterization of two classes of regular bent functions
- High-performance generic-point parallel scalar multiplication
- Algebraic quantum synchronizable codes
- Asymptotic stability in probability for stochastic Boolean networks
- Some classes of the MDS matrices over a finite field
- A digital pseudo-random number generator based on sawtooth chaotic map with a guaranteed enhanced period
- On the genericity of maximum rank distance and Gabidulin codes
- Message encoding and retrieval for spread and cyclic orbit codes
- Message authentication based on cryptographically secure CRC without polynomial irreducibility test
- On units in loop algebra \(F[M(\mathrm{Dih}(C_p^2),2)]\)
- An efficient algorithm for software generation of binary linear recurrences
- Modeling and analyzing finite state automata in the finite field \(F_{2}\)
- Bounds for the quality parameter of digital shift nets over Z₂
- A characterization of primitive polynomials over finite fields.
- Computing shifts in 90/150 cellular automata sequences
- A class of binary matrices preserving rank under matrix addition and its application
- Reversible group rings.
- Explicit N-polynomials of 2-power degree over finite fields. I
- Irreducible compositions of polynomials over finite fields of even characteristic
- Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial
- Speedup of bit-parallel Karatsuba multiplier in \(\mathrm{GF}(m^2)\) generated by trinomials
- Relative \((p^a, p^b, p^a, p^{a-b})\)-difference sets: A unified exponent bound and a local ring construction
- On planes through points off the twisted cubic in \(\mathrm{PG}(3,q)\) and multiple covering codes
- On the numerical range of matrices defined over a finite field
- On enumeration of irreducible polynomials and related objects over a finite field with respect to their trace and norm
- An orbital construction of optimum distance flag codes
- On the asymptotic order of circuit codes
- The construction of regular Hadamard matrices by cyclotomic classes
- Security of the Poseidon hash function against non-binary differential and linear attacks
- Bagua: a NFSR-based stream cipher constructed following confusion and diffusion principles
- Formalization of ring theory in PVS. Isomorphism theorems, principal, prime and maximal ideals, Chinese remainder theorem
- Standard model EFTs via on-shell methods
- Flag codes of maximum distance and constructions using Singer groups
- On skew-symmetric Toeplitz matrices over finite fields with periodicity conditions
- Twisted cubic and plane-line incidence matrix in \(\mathrm{PG}(3,q)\)
- On a bounded remainder set for a digital Kronecker sequence
- On the co-complex-type k-Fibonacci numbers
- On a class of linear functional equations without range condition
- Graph reconstruction in the congested clique
- Linearized decomposition codes and finite integer set coverings
- Partially APN Boolean functions and classes of functions that are not APN infinitely often
- Recursive MDS matrices over finite commutative rings
- Twisted cubic and point-line incidence matrix in \(\operatorname{PG}(3,q)\)
- Recursion polynomials of unfolded sequences
- Improved lower bounds for permutation arrays using permutation rational functions
- Lossless dimension expanders via linearized polynomials and subspace designs
- On the restricted isometry property of the Paley matrix
- The field \(\mathbb F_{8}\) as a Boolean manifold
- Troika: a ternary cryptographic hash function
- Mutually orthogonal Latin squares based on cellular automata
- Control of intracellular molecular networks using algebraic methods
- Isomorphism check for \(2^n\) factorial designs with randomization restrictions
- MDS and I-perfect poset block codes
- Systematic encoders for generalized Gabidulin codes and the \(q\)-analogue of Cauchy matrices
- Regular \(p\)-ary bent functions with five terms and Kloosterman sums
- Infinite families of irregular primes in cyclotomic function fields
- A matrix PRNG with s-box output filtering
- The complexity of the equivalence and equation solvability problems over meta-abelian groups
- Fooling-sets and rank
- Proof techniques in quasi-Monte Carlo theory
- Analysis and improvement of a novel image fusion encryption algorithm based on DNA sequence operation and hyper-chaotic system
- A simple method for obtaining relations among factor basis elements for special hyperelliptic curves
- Projective aspects of the AES inversion
- Division of trinomials by pentanomials and orthogonal arrays
- Reverse multiple recursive random number generators
- On affine (non)equivalence of Boolean functions
- Computing the linear complexity for sequences with characteristic polynomial f^v
- New criteria for MRD and Gabidulin codes and some rank-metric code constructions
- Symmetric powers and modular invariants of elementary abelian p-groups
- Construction of mutually unbiased maximally entangled bases through permutations of Hadamard matrices
- Low complexity bit-parallel multiplier for \(\mathbb{F}_{2^n}\) defined by repeated polynomials
- The cardinality of orthogonal exponentials of planar self-affine measures with three-element digit sets
- Primitive idempotent tables of cyclic and constacyclic codes
- Numerical range over finite fields: restriction to subspaces
- Spread decoding in extension fields
- Theoretical formulation of finite-dimensional discrete phase spaces. II. On the uncertainty principle for Schwinger unitary operators
- Algorithms for computing parameters of graph-based extensions of BCH codes
- On the parity of the number of irreducible factors of self-reciprocal 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)