The black-box model for cryptographic primitives

Journal of Cryptology

Volumn 11, Issue 2, 1998, Pages 125-140

  Schnorr, Claus Peter ^a  

^a GOETHE UNIVERSITY   (Germany)

Author keywords

Cryptographic primitives; Generic attacks

Indexed keywords

EID: 27944443972     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001459900039     Document Type: Article

References (20)

1. N. Alon. Eigenvalues and Expanders. Combinatorica, vol. 6, pp. 83-96, 1986.
2. N. Alon, V. D. Milman. X|, Isoperimetric Inequalities for Graphs, and Superconcentralors. Journal of Combinatorical Theory, Series B, vol. 38, pp. 73-88, 1985.
3. L. Babai, M. Szegedy. Local Expansion of Symmetrical Graphs. Combinatorics, Probability ami Compuling, vol. 1, pp. 1-11, 1992.
4. T. Baritaud, H. Gilbert, M. Girault. FFT Hashing Is Not Collision-Free. In Advances in CryplologyEUROCRYPT '92, Balatonfured, Lecture Notes in Computer Science 658, pp. 34-14, Springer-Verlag, Berlin, 1993.
5. M. Bellare, P. Rogaway. Random Oracles Are Practical: a Paradigma for Designing Efficient Protocols. In Proceedings of the \stACAl Conference on Computer Communication Security, pp. 62-73, 1993.
6. E. Biham, A. Shamir. Differential Cryptanalysis of the Data Encryption Standard, Springer-Verlag, New York, 1993.
7. H. Dobbertin. Cryptanalysis of MD4. In Fast Software Encryption-Proceedings of the Cambridge Security Workshop, Cambridge, Lecture Notes in Computer Science 1039, pp. 53-69, Springer-Verlag, Berlin, 1996.
8. J. L. Massey. SAFER K-64: a Byte-Oriented Block-Ciphering Algorithm. In Fast Software EncryptionProceedings of the Cambridge Security Workshop, Cambridge, December 1993, Lecture Notes in Computer Science 809, pp. 1-17, Springer-Verlag, Berlin, 1994.
9. M. Matsui. The First Experimental Cryptanalysis of the Data Encryption Standard. In Advances in Crypiology-CRYPTO '94, Santa Barbara, California, Lecture Notes in Computer Science 839, pp. 1-11, Springer-Verlag, Berlin, 1994.
10. V. I. Nechaev. Complexity of a Determinate Algorithm for the Discrete Logarithm. Mathematical Notes, vol. 55, no. 2, pp. 165-172, 1994.
11. R. L. Rivest. The MD4 Message-Digest Algorithm. In Advances in Cryplology-CRYPTO '90, Santa Barbara, California, Lecture Notes in Computer Science 537, pp. 303-311. Springer-Verlag, Berlin, 1991.
12. C. P. Schnorr. FFT-Hashing: an Efficient Cryptographic Hash Function. Presented at the CRYPTO '91 Conference. Unpublished.
13. C. P. Schnorr. FFT-Hash II, Efficient Cryptographic Hashing. In Advances in Cryptology-EUROCRYPT '92, Balatonfured, Lecture Notes in Computer Science 658, pp. 45-54, Springer-Verlag, Berlin, 1993.
14. C. P. Schnorr, S. Vaudenay. Parallel FFT-Hashing. In Fast Sofnvare Encryption-Proceedings of the Cambridge Security Workshop, Cambridge, December 1993, Lecture Notes in Computer Science 809, pp. 149-156, Springer-Verlag, Berlin, 1994.
15. C. P. Schnorr, S. Vaudenay. Black Box Cryptanalysis of Hash Networks Based on Multipermutations. In Advances in Cryplology-EUROCRYPT '94, Perugia, Lecture Notes in Computer Science 950, pp. 47-57, Springer-Verlag, Berlin, 1995.
16. V. Shoup. Lower Bounds for Discrete Logarithms and Related Problems. In Advances in CryptologyEUROCRYPT '91, Konstanz, Lecture Notes in Computer Science 1233, pp. 256-266, Springer-Verlag, Berlin, 1997.
17. R. M. Tanner. Explicit Concentrators from Generalized W-Gons. SIAM Journal of Algebraic Discrete Methods, vol. 5, pp. 287-293, 1984.
18. S. Vaudenay. FFT-Hash II Is Not Yet Collision-Free. In Advances in Cryptology-CRYPTO '92, Santa Barbara, California, Lecture Notes in Computer Science 740, pp. 587-593, Springer-Verlag, Berlin, 1993.
19. S. Vaudenay. On the Need for Multipermutations: Cryptanalysis of MD4 and SAFER. In Fast Sofnvare Encryption, Leuven, Lecture Notes in Computer Science 1008, pp. 286-297, Springer-Verlag, Berlin, 1995.
20. S. Vaudenay. La Sécurité des Primitives Cryptographiques, Thèse de Doctorat de l'Université de Paris 7, Technical Report LIENS-95-10 of the Laboratoire d'Informatique de l'Ecole Normale Supérieure, 1995.