[2767] in cryptography@c2.net mail archive

home help back first fref pref prev next nref lref last post

Re: using deadbeef to reduce RSA key size

daemon@ATHENA.MIT.EDU (Greg Rose)
Thu May 28 08:51:52 1998

To: Adam Back <aba@dcs.ex.ac.uk>
cc: cryptography@c2.net
In-reply-to: Your message of Wed, 27 May 1998 23:44:22 +0100.
             <199805272244.XAA00178@server.eternity.org> 
Date: Thu, 28 May 1998 10:58:15 +1000
From: Greg Rose <ggr@qualcomm.com>

Adam Back writes:
>(The deadbeef attack[1] ...
>
>[1] I think first proposed by Greg Rose.  Example method of choosing
>trailing bits is to have target bits x, and set the least significant
>bits of p to x, and q to "...000001".  (Clearly x has to be odd).

I think Paul Leyland had the idea first, but I independently thought of 
it and created a PGP Key with ID 0xDEADBEEF to prove it, hence the name. 
I don't want history to credit the wrong person for the idea, but I will 
claim the name.

Greg.

Greg Rose                                     INTERNET: ggr@qualcomm.com
QUALCOMM Australia        VOICE:  +61-2-9181 4851   FAX: +61-2-9181 5470
Suite 410, Birkenhead Point              http://people.qualcomm.com/ggr/ 
Drummoyne NSW 2047      B5 DF 66 95 89 68 1F C8  EF 29 FA 27 F2 2A 94 8F



home help back first fref pref prev next nref lref last post