Abstract
We show that a meet-in-the-middle attack can successfully defraud the Davies-Price message authentication scheme. Their scheme used message blocks in an iterated encipherment of an initial block, and it went through the message blocks twice, in order to prevent just such a “birthday” attack.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
D.E. Denning, Protecting public keys and signature keys, IEEE Computer, 1983, 16(2):27.
D.W. Davies and W.L. Price, “The Application of Digital Signatures based on Public Key Cryptosystems,” NPL Report DNACS 39/80, National Physical Laboratory, Teddington, Middlesex, England, Dec. 1980.
M. Rabin, Digital Signatures, in “Foundations of Secure Computation,” Academic Press, New York, 1978.
R.L. Rivest, A. Shamir, and L. Adleman, “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems,” Comm. ACM, vol. 21, no. 2, Feb. 1978, pp. 120–126.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Coppersmith, D. (1986). Another Birthday Attack. In: Williams, H.C. (eds) Advances in Cryptology — CRYPTO ’85 Proceedings. CRYPTO 1985. Lecture Notes in Computer Science, vol 218. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39799-X_2
Download citation
DOI: https://doi.org/10.1007/3-540-39799-X_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16463-0
Online ISBN: 978-3-540-39799-1
eBook Packages: Springer Book Archive