How to use pseudorandom generators in unconditional security settings

DOI10.1007/978-3-319-12475-9_20MaRDI QIDQ2948157zbMATH OpenOpenAlexFDO

Authors Koji Nuida

Publication date 29 September 2015

Published in Provable Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-12475-9_20

zbMATH Keywords

information-theoretic securitypseudorandom generators

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Cryptography (94A60)

Recommendations

• Cryptographic pseudorandom generators can make cryptosystems problematic
• Robust pseudorandom generators
• On the Security of Pseudorandomized Information-Theoretically Secure Schemes
• scientific article; zbMATH DE number 861531
• Publication:5751835

Cited in

(2)

• Cryptographic pseudorandom generators can make cryptosystems problematic
• An improvement of pseudorandomization against unbounded attack algorithms -- the case of fingerprint codes

This page was built for publication: How to use pseudorandom generators in unconditional security settings

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