A Mathematical Problem for Security Analysis of Hash Functions and Pseudorandom Generators
From MaRDI portal
Publication:3098001
DOI10.1007/978-3-642-25141-2_10zbMath1344.94067arXiv1206.0069OpenAlexW2100811350WikidataQ114978634 ScholiaQ114978634MaRDI QIDQ3098001
Koji Nuida, Shizuo Kaji, Yasuhide Numata, Toshiaki Maeno, Takuro Abe
Publication date: 10 November 2011
Published in: International Journal of Foundations of Computer Science, Advances in Information and Computer Security (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1206.0069
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Random number generation in numerical analysis (65C10)
Cites Work
- Unnamed Item
- Formalizing Human Ignorance
- On the randomness complexity of efficient sampling
- On the Security of Pseudorandomized Information-Theoretically Secure Schemes
- A Simple Unpredictable Pseudo-Random Number Generator
- A method for obtaining digital signatures and public-key cryptosystems
- On the Security of Pseudorandomized Information-Theoretically Secure Schemes
- Finding Collisions in the Full SHA-1
- Efficient Pseudorandom Generators Based on the DDH Assumption
This page was built for publication: A Mathematical Problem for Security Analysis of Hash Functions and Pseudorandom Generators
