Publication:4301239

Publication date: 18 July 1994

bibliography; finite fields; finite geometry; cryptology; shift register sequence; algebraic coding theory; bibliographical notes; historical notes

Mathematics Subject Classification ID

11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

94A60: Cryptography

05B25: Combinatorial aspects of finite geometries

94B15: Cyclic codes

11-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory

11Txx: Finite fields and commutative rings (number-theoretic aspects)

Related Items

Partition Algorithm For Parallel Processing Of Array Multiplication In Gf(2m) Fields, Counting irreducible Goppa codes, A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377, Construction algorithms for polynomial lattice rules for multivariate integration, Algebraic curves and cryptography, On Gekeler's conjecture for function fields, Breaking RSA Generically Is Equivalent to Factoring, Isomorphism classes of Picard curves over finite fields, A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point, Polynomial basis multiplication over \(\text{GF}(2^m)\), Scalable and systolic architecture for computing double exponentiation over \(\text{GF}(2^m)\), Isomorphism classes of hyperelliptic curves of genus 2 over finite fields with characteristic 2, Applying quick exponentiation for block upper triangular matrices, Computation of the weight distribution of CRC codes, Sets with even partition functions and 2-adic integers, Generating random vectors in \((\mathbb Z/ p \mathbb Z)^d\) via an affine random process, 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, 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, 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 \(\mathbb Z_2\), 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, Relative \((p^a, p^b, p^a, p^{a-b})\)-difference sets: A unified exponent bound and a local ring construction, 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, 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, Periodic binary harmonic functions on lattices, The field descent method, Enumeration of inequivalent irreducible Goppa codes, Isomorphism classes of hyperelliptic curves of genus 3 over finite fields, A nonlinear elliptic curve cryptosystem based on matrices, 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, Results on multiples of primitive polynomials and their products over GF(2), An efficient binary sequence generator with cryptographic applications, On the optimal Halton sequence, The enumerability of P collapses P to NC, New algorithms for generating Conway polynomials over finite fields, Unnamed Item, Using the theory of cyclotomy to factor cyclotomic polynomials over finite fields, Analysis of Rabin's irreducibility test for polynomials over finite fields, Solution to the Mean King's Problem in Prime Power Dimensions Using Discrete Tomography, Large families of pseudorandom sequences of k symbols and their complexity, Part II, Large families of pseudorandom sequences of k symbols and their complexity, Part I, Towers of Global Function Fields with Asymptotically Many Rational Places and an Improvement on the Gilbert - Varshamov Bound