Publication:3765876
From MaRDI portal
zbMath0629.12016MaRDI QIDQ3765876
Harald Niederreiter, Rudolf Lidl
Publication date: 1986
94A60: Cryptography
94B40: Arithmetic codes
12-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to field theory
11Txx: Finite fields and commutative rings (number-theoretic aspects)
Related Items
On random polynomials over finite fields, A fast algorithm to compute irreducible and primitive polynomials in finite fields, On the Use of Reducible Polynomials as Random Number Generators, Infinite products of finite simple groups II, Zeta Functions of Formal Languages, Bell numbers and sum of factorials, Point sets and sequences with small discrepancy, A wide family of nonlinear filter functions with a large linear span, Synthesis of cryptographic interleaved sequences by means of linear cellular automata, An enumeration formula for certain irreducible polynomials with an application to the construction of irreducible polynomials over the binary field, A short proof for explicit formulas for discrete logarithms in finite fields, A note on adjacency preservers on Hermitian matrices over finite fields, On the use of cellular automata in symmetric cryptography, On the design of cryptographic primitives, On puncturing of codes from norm-trace curves, The limitations of nice mutually unbiased bases, Programmable cellular automata based Montgomery hardware architecture, Ideal orbits of toral automorphisms, Feasibility of numerical modelling: Information aspect, Global solution for a one-dimensional model problem in thermally radiative magnetohydrodynamics, Equiangular tight frames from Paley tournaments, Discrete phase-space structure of \(n\)-qubit mutually unbiased bases, Error correcting sequence and projective de Bruijn graph, Cryptanalysis of an E0-like combiner with memory, New criteria for linear maps in AES-like ciphers, Patterns and periodicity in a family of resultants, Remarks on nonlinear congruential pseudorandom numbers, Univariate polynomial factorization over finite fields, Multidimensional \(\sigma\)-automata, \(\pi\)-polynomials and generalised S-matrices, Recent trends in random number and random vector generation, Computational problems in the theory of finite fields, The smallest matrix of given period and primitive roots of unity, On a convolution of linear recurring sequences over finite fields, A note on discrete logarithms in finite fields, Random sets which invariably generate the symmetric group, Binary periodic synchronizing sequences, On primitive and free roots in a finite field, The soluble subgroups and the Tits alternative in linear groups over rings of fractions of polycyclic group rings. I, A remark on the minimal polynomial of the product of linear recurring sequences, Shifts on the hyperfinite \(II_1\) factor, An explicit similarity transform between cellular automata and LFSR matrices, Finite extensions of free pro-\(p\) groups of rank at most two, Depth-efficient simulation of Boolean semi-unbounded circuits by arithmetic ones, \(\text{BP}_{\text{H}}\text{SPACE}(S) \subseteq \text{DSPACE}(S^{3/2})\), Self-dual bases in \(\mathbb{F}_{q^ n}\), Trace-orthogonal normal bases, Linear recurring sequences for computing the resultant of multivariate polynomials, The complexity of sparse polynomial interpolation over finite fields, Multiplicative and additive recurrent sequences, Perfect factors in the de Bruijn graph, The combinatorics of discrete self-similarity, Additive cellular automata and global injectivity, On codes from norm-trace curves, Uniform distribution of linear recurring sequences modulo prime powers., Counting functions and expected values for the \(k\)-error linear complexity, Multi-sequences with \(d\)-perfect property, A serial version of the Pohlig-Hellman algorithm for computing discrete logarithms, Uniform random number generation, Optimal characteristic polynomials for digital multistep pseudorandom numbers, A note on orthogonal circulant matrices over finite fields, Faster fractal pictures by finite fields and far rings, Riffle shuffles, cycles, and descents, Generalized Fermat, double Fermat and Newton sequences., How many vectors generate maximal cyclic subspaces?, Severely denting the Gabidulin version of the McEliece public key cryptosystem, Complexity of a determinate algorithm for the discrete logarithm, Study of the discrete logarithm problem in \(\mathbb{F}_{p^ 3}\), New classes of perfect maps. I, The combinatorial power of the companion matrix, Linear recurring sequences over modules, Linear recurring sequences over rings and modules, Strategic attack on the shrinking generator, Mathematical theory of compressible, viscous, and heat conducting fluids, A simple computational model for acceptance/rejection of binary sequence generators, A novel approach for bit-serial \(AB^{2}\) multiplication in finite fields \(\mathrm{GF}(2^m)\), A concrete matrix field description of some Galois fields., On self-dual normal bases, Norm-graphs and bipartite Turán numbers, Counting functions and expected values for the lattice profile at \(n\), Fast, prime factor, discrete Fourier transform algorithms over \(\text{GF}(2^m)\) for \(8 \leqslant m \leqslant 10\), High velocity impact of metal sphere on thin metallic plates: a comparative smooth particle hydrodynamics study, Supersymmetry and combinatorics, Embedding dynamics for round-off errors near a periodic orbit, Unnamed Item, The Distribution of Reciprocal Pairs Modulo Polynomials over a Finite Field, Montgomery Residue Representation Fault-Tolerant Computation in GF(2 k ), Cryptanalytic Attack on Cryptographic Sequence Generators: The Class of Clock-Controlled Shrinking Generators, Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fields, Mixer–a new stream cipher, Using Normal Bases for Compact Hardware Implementations of the AES S-Box, Cellular Automata-Based Structures to Compute the Solutions of Linear Difference Equations, Factoring Multivariate Polynomials over Large Finite Fields, DISCRETE COHERENT STATES FOR n QUBITS, Lower Bounds for the Discrepancy of Inversive Congruential Pseudorandom Numbers, EXPLICITLY SIMPLIFYING EVOLVED GENETIC PROGRAMS DURING EVOLUTION, Hypergeometric Functions Over Finite Fields, The Serial Test for Congruential Pseudorandom Numbers Generated by Inversions, Zeros of Diagonal Equations over Finite Fields, Tighter time bounds on fault-tolerant broadcasting and gossiping, Limit Theorems for Combinatorial Structures via Discrete Process Approximations, Strong tractability of multivariate integration using quasi–Monte Carlo algorithms, COVERING NUMBERS FOR NON-PERFECT FINITE GROUPS, Computing Zeta Functions of Artin–schreier Curves over Finite Fields, The value set of polynomials over ℤ m and the combinatorics of sequences, New primitive $t$-nomials $(t = 3,5)$ over $GF(2)$ whose degree is a Mersenne exponent, PARAMETERS OF INTEGRAL CIRCULANT GRAPHS AND PERIODIC QUANTUM DYNAMICS, Fault-Tolerant Finite Field Computation in the Public Key Cryptosystems, Correlated algebraic-geometric codes: Improved list decoding over bounded alphabets, MULTIPARTITE QUANTUM SYSTEMS: PHASES DO MATTER AFTER ALL, Generalized ElGamal Public Key Cryptosystem Based on a New Diffie-Hellman Problem, Trace representations of S-boxes and their application, Linear Finite Dynamical Systems, An efficient algorithm to generate binary sequences for cryptographic purposes
