Cryptographic pseudorandom generators can make cryptosystems problematic

DOI10.1007/978-3-030-75248-4_16MaRDI QIDQ2061967zbMATH OpenOpenAlexFDO

Authors Koji Nuida

Publication date 21 December 2021

Full work available at URL https://doi.org/10.1007/978-3-030-75248-4_16

zbMATH Keywords

pseudorandom generatorspublic key encryptionmultiparty computation

Mathematics Subject Classification ID

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

Recommendations

• Cryptanalytic attacks on pseudorandom number generators
• scientific article; zbMATH DE number 861531
• Some consequences of the existnce of pseudorandom generators
• scientific article; zbMATH DE number 17389
• scientific article; zbMATH DE number 5901698
• Pseudorandom Generators and Typically-Correct Derandomization
• scientific article; zbMATH DE number 4201454
• Cryptographic properties of nonlinear pseudorandom number generators

Cites work

• scientific article; zbMATH DE number 1951621 (Why is no real title available?)
• A formal treatment of backdoored pseudorandom generators
• A note on perfect correctness by derandomization
• A uniform-complexity treatment of encryption and zero-knowledge
• Advances in Cryptology - CRYPTO 2003
• Advances in Cryptology - EUROCRYPT 2004
• Amplification of Chosen-Ciphertext Security
• Backdoors in pseudorandom number generators: possibility and impossibility results
• Foundations of Cryptography
• Foundations of Cryptography
• Hardness vs randomness
• How to use pseudorandom generators in unconditional security settings
• Leftover Hash Lemma, Revisited
• More efficient oblivious transfer extensions
• Non-uniform attacks against pseudoentropy
• Non-uniform cracks in the concrete: the power of free precomputation
• On the communication complexity of secure function evaluation with long output
• One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption
• Privacy with Imperfect Randomness
• Probability Inequalities for Sums of Bounded Random Variables
• The feasibility of outsourced database search in the plain model
• The random oracle methodology, revisited.
• Time space tradeoffs for attacks against one-way functions and PRGs

Cited in

(2)

• How to use pseudorandom generators in unconditional security settings
• Computational Irrelevancy: Bridging the Gap Between Pseudo- and Real Randomness in MPC Protocols

This page was built for publication: Cryptographic pseudorandom generators can make cryptosystems problematic

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