How to stretch random functions: the security of protected counter sums

Journal of Cryptology

Volumn 12, Issue 3, 1999, Pages 185-192

  Bernstein, Daniel J ^a  

^a University of Illinois   (United States)

Author keywords

Exact security analysis; Unpredictable random functions; Variable length inputs

Indexed keywords

EID: 33645601628     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001459900051     Document Type: Article

References (27)

1. Proceedings of the 37th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, New York, 1996.
2. Mihir Bellare, Ran Canetti, Hugo Krawczyk, Pseudorandom functions revisited: the cascade construction and its concrete security, in [1], pp. 514-523.
3. Mihir Bellare, Ran Canetti, Hugo Krawczyk, Pseudorandom functions revisited: the cascade construction and its concrete security, draft available as [2], newer draft available as http:// www-cse.ucsd.edu/~mihir/papers/cascade.ps.gz.
4. Mihir Bellare, Roch Guérin, Phillip Rogaway, XOR MACs: new methods for message authentication using finite pseudorandom functions, in [12], pp. 15-28.
5. Mihir Bellare, Roch Guérin, Phillip Rogaway, XOR MACs: new methods for message authentication using finite pseudorandom functions, draft available as [4], newer draft available as http:// www-cse.ucsd.edu/-mihir/papers/xormacs.ps.gz.
6. Mihir Bellare, Joe Kilian, Phillip Rogaway, The security of cipher block chaining, in [13], pp. 341-358.
7. Mihir Bellare, Joe Kilian, Phillip Rogaway, The security of the cipher block chaining message authentication code, draft available as [6], newer draft available as http:// www-cse.ucsd.edu/-mihir/papers/cbc.ps.gz.
8. Daniel J. Bernstein, SEOC: Strategic Exportable Online Cipher, draft, censored.
9. Daniel J. Bernstein, SURF: Simple Unpredictable Random Function, draft available from http://pobox.com/-djb/papers/surf.dvi.
10. Joan Boyar, Inferring sequences produced by a linear congruential generator missing low-order bits, Journal of Cryptology 1 (1989), 177-184.
11. J. Lawrence Carter, Mark N. Wegman, Universal classes of hash functions, Journal of Computer and System Sciences 18 (1979), 143-154.
12. Don Coppersmith (editor), Advances in Cryptology-CRYPTO '95, Lecture Notes in Computer Science 963, Springer-Verlag, Berlin, 1995. [13] Yvo Desmedt (editor), Advances in Cryptology-CRYPTO '94, Lecture Notes in Computer Science 839, Springer-Verlag, Berlin, 1994.
13. Shimon Even, Oded Kariv (editors), Automata, Langauges and Programming, Lecture Notes in Computer Science'115, Springer-Verlag, Berlin, 1981.
14. Oded Goldreich, Shafi Goldwasser, Silvio Micali, How to construct random functions, Journal of the ACM 33 (1986), 210-217.
15. Irving J. Good, R. F. Churchhouse, The Riemann hypothesis and pseudorandom features of the Möbius sequence, Mathematics of Computation 22 (1968), 857-861.
16. Donald E. Knuth, The Art of Computer Programming, volume 2,2nd edition, Addison-Wesley, Reading, Massachusetts, 1981.
17. Neal Koblitz (editor), Advances in Cryptology-CRYPTO '96, Lecture Notes in Computer Science 1109, Springer-Verlag, Berlin, 1996.
18. Michael Luby, Charles Rackoff, How to construct pseudorandom permutations from pseudorandom functions, SIAM Journal of Computing 17 (1988), 373-386.
19. Alfred J. Menezes, Paul C. van Oorschot, Scott A. Vanstone, Handbook of Applied Cryptography, CRC Press, Boca Raton, Florida, 1996.
20. Frederick C. Mish (editor), Webster's Ninth New Collegiate Dictionary, Merriam-Webster, Springfield, Massachusetts, 1987.
21. Harald Niederreiter, The serial test for congruential pseudorandom numbers generated by inversions, Mathematics of Computation 52 (1989), 135-144.
22. Phillip Rogaway, Bucket hashing and its application to fast message authentication, in [12], pp. 29-42.
23. Phillip Rogaway, Bucket hashing and its application to fast message authentication, draft available as [23], newer draft available as http : //wwwcsif. cs .ucdavis .edu/-rogaway/papers/bucket .ps.
24. Halsey L. Royden, Real Analysis, 3rd edition, Macmillan, New York, 1988.
25. Adi Shamir, On the generation of cryptographically strong pseudorandom sequences, in [14], pp. 544-550.
26. Victor Shoup, On fast and provably secure message authentication based on universal hashing, in [18], ' pp. 313-328.
27. Victor Shoup, On fast and provably secure message authentication based on universal hashing, draft available as [27], newer draft available as http: //www. cs .wise .edu/-shoup/papers/macs .ps. Z. [29] Alan M. Turing, Computing machinery and intelligence, MIND 59 (1950), 433-60.