A chosen text attack on the modified cryptographic checksum algorithm (1990)
by
Bart Preneel
,
Antoon Bosselaers
,
René Govaerts
,
Joos V
,
Esat Laboratories
| Venue: | of Cohen and Huang, Advances in Cryptology – Proceedings of CRYPTO 1989, LNCS 435 |
| Citations: | 2 - 1 self |
BibTeX
@INPROCEEDINGS{Preneel90achosen,
author = {Bart Preneel and Antoon Bosselaers and René Govaerts and Joos V and Esat Laboratories},
title = {A chosen text attack on the modified cryptographic checksum algorithm},
booktitle = {of Cohen and Huang, Advances in Cryptology – Proceedings of CRYPTO 1989, LNCS 435},
year = {1990},
pages = {154--163},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. A critical analysis of the modified cryptographic checksum algorithm of Cohen and Huang points out some weaknesses in the scheme. We show how to exploit these weaknesses with a chosen text attack to derive the first bits of the key. This information suffices to manipulate blocks with a negligible chance of detection. 1.
Citations
| 2506 | A method for obtaining digital signatures and public-key cryptosystems - Rivest, Shamir, et al. |
| 231 | A design principle for hash functions - Damgård - 1989 |
| 65 | An Introduction To The Theory of Numbers (5th Edition - Hardy, Wright - 1938 |
| 41 | One way hash functions and - Merkle - 1990 |
| 8 | On the Security of Compressed Encodings - Akl - 1984 |
| 6 | A Cryptographic Checksum for Integrity Protection - Cohen - 1987 |
| 4 | Fast RSA-hardware: dream or reality - Hoornaert, Decroos, et al. - 1988 |
| 3 | Survey of Hardware - Brickell |
| 3 | Hash-functions using modulo-N operations - Girault - 1988 |
| 3 | A High Speed Manipulation Detection Code - Jueneman - 1987 |
| 2 | Cryptographically Secure Hash Functions: an Overview - Preneel, Govaerts, et al. - 1989 |
| 1 | Some Weak Points of One Fast Cryptographic Checksum Algorithm and its Improvement - Huang, Cohen - 1988 |
| 1 | A Hash Of Some One–Way Hash functions and Birthdays - Mjølsnes |
