Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
How to decrypt or even substitute DES-Encrypted messages in 228 steps
Information Processing Letters
The State of Cryptographic Hash Functions
Lectures on Data Security, Modern Cryptology in Theory and Practice, Summer School, Aarhus, Denmark, July 1998
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
Disappearing Cryptography: Information Hiding: Steganography & Watermarking
Disappearing Cryptography: Information Hiding: Steganography & Watermarking
Generic attacks on unbalanced Feistel schemes with expanding functions
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Partial key recovery attacks on XCBC, TMAC and OMAC
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
Forensic investigation of peer-to-peer file sharing networks
Digital Investigation: The International Journal of Digital Forensics & Incident Response
| Hi-index | 0.00 |
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.