Cryptography and Coding

DOI10.1007/11586821MaRDI QIDQ5897532zbMATH OpenOpenAlexFDO

Authors Andrey Sidorenko, Berry Schoenmakers

Publication date 1 November 2006

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

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

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 3928174
• scientific article; zbMATH DE number 1952891
• scientific article; zbMATH DE number 176069
• Pseudorandom Functions and Factoring
• On the security of modular exponentiation with application to the construction of pseudorandom generators

Cited in

(4)

• Secure simultaneous bit extraction from Koblitz curves
• Another look at tightness
• More efficient DDH pseudorandom generators
• On the concrete security of Goldreich's pseudorandom generator

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 Q5897532)