Expanding weak PRF with small key size

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3935 LNCS, Issue , 2006, Pages 284-298

  Minematsu, Kazuhiko ^a   Tsunoo, Yukiyasu ^a  

^a NEC CORPORATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATION THEORY; FUNCTIONS; MATHEMATICAL MODELS; SECURITY SYSTEMS;

BLOCK CIPHERS; PSEUDORANDOM TREE (PRT) MODE;

TREES (MATHEMATICS);

EID: 33745864772     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11734727_24     Document Type: Conference Paper

References (18)

1. W. Aiello, S. Rajagopalan, and R. Venkatesan. "High-speed Pseudorandom Number Generation with Small Memory." Fast Software Encryption, FSE'99, LNCS 1636, pp. 290-304, 1999.
2. M. Bellare, A. Desai, E. Jokipii, and P. Rogaway. "A Concrete Security Treatment of Symmetric Encryption." Proceedings of the 38th Annual Symposium on Foundations of Computer Science, FOCS '97, pp. 394-403, 1997.
3. M. Bellare, J. Kilian and P. Rogaway. "The Security of Cipher Block Chaining." Advances in Cryptology - CRYPTO'94, LNCS 839, 1994.
4. I. Damgård and J. Nielsen. "Expanding Pseudorandom Functions; or: From Known-Plaintext Security to Chosen-Plaintext Security." Advances in Cryptology-CRYPTO'02, LNCS 2442, pp. 449-464, 2002.
5. H. Gilbert. "The Security of "One-Block-to-Many" Modes of Operation." Fast Software Encryption, FSE'03, LNCS 2887, pp. 377-395, 2003.
6. O. Goldreich, S. Goldwasser, and S. Micali. "How to Construct Random Functions." Journal of the ACM, vol.33, no.4, pp. 792-807, 1986.
7. A. Klemm, C. Lindemann, and M. Lohmann. "Traffic Modeling of IP Networks Using the Batch Markovian Arrival Process." Computer Performance Evaluation / TOOLS 2002, pp. 92-110, 2002.
8. M. Luby and C. Rackoff. "How to Construct Pseudo-random Permutations from Pseudo-random functions." SIAM J. Computing, vol.17, no.2, pp. 373-386, 1988.
9. U. Maurer and J. L. Massey. "Cascade Ciphers: The Importance of Being First." J. Cryptology vol.6, no.1, pp. 55-61, 1993.
10. U. Maurer. "Indistinguishability of Random Systems." Advances in Cryptology-EUROCRYPT'02, LNCS 2332, pp. 110-132, 2002.
11. U. Maurer and K. Pietrzak. "Composition of Random Systems: When Two Weak Make One Strong." Theory of Cryptography - TCC'04, LNCS 2951, pp. 410-427, 2004.
12. M. Naor, O. Reingold. "Number-theoretic Constructions of Efficient Pseudorandom Functions." 38 th Annual Symposium on Foundations of Computer Science, FOCS'97, pp. 458-467, 1997.
13. M. Naor and O. Reingold. "From Unpredictability to Indistinguishability: A Simple Construction of Pseudo-Random Functions from MACs (Extended Abstract)." Advances in Cryptology - CRYPTO'98, LNCS 1462, pp. 267-282, 1998.
14. M. Naor and O. Reingold. "On the Construction of Pseudorandom Permutations: Luby-Rackoff Revisited." Journal of Cryptology, vol. 12(1), pp. 29-66, 1999.
15. M. Naor and O. Reingold. "Synthesizers and their application to the parallel construction of pseudo-random functions." J. of Computer and Systems Sciences, Vol. 58(2), pp. 336-375, 1999.
16. 3rd Generation Partnership Project. http://www.3gpp.org
17. S. Vaudenay. "Feistel Ciphers with L 2-Decorrelation." Selected Areas in Cryptography - SAC'98, LNCS 1556, pp. 1-14, 1998.
18. http://www.nlanr.net/NA/Learn/packetsizes.html