2n-bit hash-functions using n-bit symmetric block cipher algorithms

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

Volumn 434 LNCS, Issue , 1990, Pages 102-109

  Quisquater, Jean Jacques ^a   Girault, Marc ^b  

^a PHILIPS RESEARCH LABORATORIES   (Netherlands)

^b Service d’Etudes communes des Postes et Télécommunications ^*  (France)

Author keywords

[No Author keywords available]

Indexed keywords

HASH FUNCTIONS; SECURITY OF DATA;

SYMMETRIC BLOCK CIPHER ALGORITHM;

CRYPTOGRAPHY;

EID: 84985801328     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46885-4_13     Document Type: Conference Paper

References (8)

1. D. Coppersmith, "Another birthday attack", Advances in Cryptology, Proc. of Crypto‘85, LNCS, Vol. 218, Springer-Verlag, 1986, pp. 14-17.
2. D. Coppersmith, private communication.
3. D. W. Davies and W. L. Price, "Security for computer networks", ed. J. Wiley & Sons, 1984.
4. R. R. Jueneman, "A high speed Manipulation Detection Code", Advances in Cryptology, Proc. of Crypto ‘86, LNCS, Vol. 263, Springer-Verlag, 1987, pp. 327-346.
5. C. H. Meyer and M. Schilling, "Secure program load with Manipulation Detection Code", Securicom 88, pp. 111-130.
6. J. J. Quisquater and J. P. Delescaille, "How easy is collision search? Application to DES", these proceedings.
7. J. J. Quisquater and J. P. Delescaille, "How easy is collision search? New results and applications to DES", Proc. of Crypto‘89, to appear.
8. G. Yuval, "How to swindle Rabin", Cryptologia, Vol. 3, Jul. 1979, pp. 187-189.