[18856] in cryptography@c2.net mail archive
Re: On Digital Cash-like Payment Systems
daemon@ATHENA.MIT.EDU (Steven M. Bellovin)
Mon Nov 7 12:02:43 2005
X-Original-To: cryptography@metzdowd.com
X-Original-To: cryptography@metzdowd.com
From: "Steven M. Bellovin" <smb@cs.columbia.edu>
To: "Travis H." <solinym@gmail.com>
Cc: John Kelsey <kelsey.j@ix.netcom.com>,
cyphrpunk <cyphrpunk@gmail.com>,
"James A. Donald" <jamesd@echeque.com>, cryptography@metzdowd.com,
cypherpunks@jfet.org
In-Reply-To: Your message of "Fri, 04 Nov 2005 19:09:07 CST."
<d4f1333a0511041709j48703e7aqe2d694b0366ccccc@mail.gmail.com>
Date: Mon, 07 Nov 2005 11:16:13 -0500
In message <d4f1333a0511041709j48703e7aqe2d694b0366ccccc@mail.gmail.com>, "Trav
is H." writes:
>By my calculations, it looks like you could take a keypair n,e,d and
>some integer x and let e'=e^x and d'=d^x, and RSA would still work,
>albeit slowly. Reminds me of blinding, to some extent, except we're
>working with key material and not plaintext/ciphertext.
>
Don't ever encrypt the same message twice that way, or you're likely to
fall to a common modulus attack, I believe.
--Steven M. Bellovin, http://www.cs.columbia.edu/~smb
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
