On sufficient randomness for secure public-key cryptosystems

DOI10.1007/3-540-45664-3_3MaRDI QIDQ3043925zbMATH OpenFDO

Authors Takeshi Koshiba

Publication date 9 August 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2274/22740034.htm

zbMATH Keywords

computational cryptographyElGamal encryptionlinear congruential generatorprobabilistic public-key encryptionrandomnesssecurity

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• A new aspect for security notions: Secure randomness in public key encryption schemes
• scientific article; zbMATH DE number 708821
• scientific article; zbMATH DE number 5009203
• Related randomness attacks for public key encryption
• scientific article; zbMATH DE number 5005844

Cited in

(11)

• A new aspect for security notions: Secure randomness in public key encryption schemes
• On the security of a public-key cryptosystem
• Public-key encryption with lazy parties
• scientific article; zbMATH DE number 5713310 (Why is no real title available?)
• On the security of random sources
• On the Impossibility of Private Key Cryptography with Weakly Random Keys
• scientific article; zbMATH DE number 708821 (Why is no real title available?)
• On the randomness of a \([d,k]\) self-decimation stream key generator
• On the Security of Pseudorandomized Information-Theoretically Secure Schemes
• Random Sources for Cryptographic Systems
• On the Provable Security of an Efficient RSA-Based Pseudorandom Generator

This page was built for publication: On sufficient randomness for secure public-key cryptosystems

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