Abstract
We generalize the birthday attack presented by Coppersmith at Crypto’85 which defrauded a Davies-Price message authentication scheme. We first study the birthday paradox and a variant for which some convergence results and related bounds are provided. Secondly, we generalize the Davies-Price scheme and show how the Coppersmith attack can be extended to this case. As a consequence, the case p=4 with DES (important when RSA with a 512-bit modulus is used for signature) appears not to be secure enough.
Cite
CITATION STYLE
Girault, M., Cohen, R., & Campana, M. (1988). A generalized birthday attack. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 330 LNCS, pp. 129–156). Springer Verlag. https://doi.org/10.1007/3-540-45961-8_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
