Manipulations and errors, detection and localization
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Adequacy of checksum algorithms for computer virus detection
SIGSMALL '90 Proceedings of the 1990 ACM SIGSMALL/PC symposium on Small systems
A chosen text attack on the modified cryptographic checksum algorithm of Cohen and Huang
CRYPTO '89 Proceedings on Advances in cryptology
Adequacy of checksum algorithms for computer virus detection
ACM SIGSMALL/PC Notes
An Integrity Check Value Algorithm for Stream Ciphers
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
Does Encryption with Redundancy Provide Authenticity?
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Cryptographic Primitives for Information Authentication - State of the Art
State of the Art in Applied Cryptography, Course on Computer Security and Industrial Cryptography - Revised Lectures
| Hi-index | 0.01 |
Manipulation Detection Codes (MDC) are defined as a class of checksum algorithms which can detect both accidental and malicious modifications of an electronic message or document. Although the MDC result must be protected by encryption to prevent an attacker from succeeding in substituting his own Manipulation Detection Code (MDC) along with the modified text, MDC algorithms do not require the use of secret information such as a cryptographic key. Such techniques are therefore highly useful in allowing encryption and message authentication to be implemented in different protocol layers in a communication system without key management difficulties, as well as in implementing digital signature schemes. It is shown that cryptographic checksums that are intended to detect fraudulant messages should be on the order of 128 bits in length, and the ANSI X9.9-1986 Message Authentication Standard is criticized on that basis. A revised 128-bit MDC algorithm is presented which overcomes the so-called Triple Birthday Attck introduced by Coppersmith. A fast, efficient implementation is discussed which makes use of the Intel 8087/80287 Numeric Data Processor coprocessor chip for the IBM PC/XT/AT and similar microcomputers.