Cryptography and Coding

DOI10.1007/B93924MaRDI QIDQ5428168zbMATH OpenOpenAlexFDO

Authors Simon R. Blackburn, Domingo Gómez-Pérez, 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

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

Recommendations

• Predicting nonlinear pseudorandom number generators
• Cryptanalysis of the Quadratic Generator
• Attacking the Pollard Generator
• scientific article; zbMATH DE number 426123
• Inversive Congruential Pseudorandom Numbers Avoid the Planes

Cited in

(19)

• Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
• Solving a class of modular polynomial equations and its relation to modular inversion hidden number problem and inversive congruential generator
• Predicting masked linear pseudorandom number generators over finite fields
• New results on Modular Inversion Hidden Number problem and inversive congruential generator
• Predicting truncated multiple recursive generators with unknown parameters
• Pseudorandom numbers and hash functions from iterations of multivariate polynomials
• The Carlitz rank of permutations of finite fields: a survey
• On the Carlitz rank of permutations of \(\mathbb F_q\) and pseudorandom sequences
• Attacking the Pollard Generator
• On the degree growth in some polynomial dynamical systems and nonlinear pseudorandom number generators
• On the modular inversion hidden number problem
• scientific article; zbMATH DE number 2009965 (Why is no real title available?)
• Predicting nonlinear pseudorandom number generators
• Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
• On the bit security of elliptic curve Diffie-Hellman
• Fixed points of the subset sum pseudorandom number generators
• Inferring sequences produced by the quadratic generator
• On pseudorandom numbers from multivariate polynomial systems
• Finite binary sequences constructed by explicit inversive methods

This page was built for publication: Cryptography and Coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5428168)