Cryptography and Coding

DOI10.1007/b93924zbMath1123.94330OpenAlexW2478032277MaRDI QIDQ5428168

Domingo Gómez-Pérez, Simon R. Blackburn, Jaime Gutierrez, Igor E. Shparlinski

Publication date: 28 November 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b93924

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (15)

Pseudorandom numbers and hash functions from iterations of multivariate polynomials ⋮ Solving a class of modular polynomial equations and its relation to modular inversion hidden number problem and inversive congruential generator ⋮ Predicting truncated multiple recursive generators with unknown parameters ⋮ Fixed points of the subset sum pseudorandom number generators ⋮ On the modular inversion hidden number problem ⋮ Inferring sequences produced by the quadratic generator ⋮ Predicting masked linear pseudorandom number generators over finite fields ⋮ The Carlitz rank of permutations of finite fields: a survey ⋮ On the Carlitz rank of permutations of \(\mathbb F_q\) and pseudorandom sequences ⋮ Finite binary sequences constructed by explicit inversive methods ⋮ On the Bit Security of Elliptic Curve Diffie–Hellman ⋮ On the degree growth in some polynomial dynamical systems and nonlinear pseudorandom number generators ⋮ Predicting nonlinear pseudorandom number generators ⋮ On pseudorandom numbers from multivariate polynomial systems ⋮ Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits

This page was built for publication: Cryptography and Coding