Performance improvement for the GGM-construction of pseudorandom functions

DOI10.1016/j.amc.2006.05.112zbMath1124.65005OpenAlexW1966674297MaRDI QIDQ864800

Gwoboa Horng, Yu-Sheng Chen, Chao-Liang Liu

Publication date: 13 February 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.05.112

zbMATH Keywords

cryptographypseudo-randomnesspseudo-random bit generatorpseudo-random functionGoldreich-Goldwasser-Micali constructionprobabilistic polynomial-time algorithm

Mathematics Subject Classification ID

Cryptography (94A60) Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)

Cites Work

• Unnamed Item
• Unnamed Item
• Checking the correctness of memories
• On the construction of pseudorandom permutations: Luby-Rackoff revisited
• Synthesizers and their application to the parallel construction of pseudo-random functions
• On the Cryptographic Applications of Random Functions (Extended Abstract)
• Pseudorandom Functions and Factoring
• Number-theoretic constructions of efficient pseudo-random functions
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• A Simple Unpredictable Pseudo-Random Number Generator
• Software protection and simulation on oblivious RAMs

This page was built for publication: Performance improvement for the GGM-construction of pseudorandom functions