> > Don't ever encrypt the same message twice that way, or you're likely to
> > fall to a common modulus attack, I believe.
>
> Looks like it (common modulus attack involves same n,
> different (e,d) pairs).
>
> However, you're likely to be picking a random symmetric key as the
> "message", and
> Don't ever encrypt the same message twice that way, or you're likely to
> fall to a common modulus attack, I believe.
Looks like it (common modulus attack involves same n, different (e,d) pairs).
However, you're likely to be picking a random symmetric key as the
"message", and Schneier even sug
On 11/4/05, Travis H. <[EMAIL PROTECTED]> wrote:
> 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 pl
In message <[EMAIL PROTECTED]>, "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 pl
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.
Since I'm on the topic, does doing e
>From: cyphrpunk <[EMAIL PROTECTED]>
>Sent: Oct 27, 2005 9:15 PM
>To: "James A. Donald" <[EMAIL PROTECTED]>
>Cc: cryptography@metzdowd.com, [EMAIL PROTECTED]
>Subject: Re: On Digital Cash-like Payment Systems
>On 10/26/05, James A. Donald <[EMAIL PROTE
On 10/26/05, James A. Donald <[EMAIL PROTECTED]> wrote:
> How does one inflate a key?
Just make it bigger by adding redundancy and padding, before you
encrypt it and store it on your disk. That way the attacker who wants
to steal your keyring sees a 4 GB encrypted file which actually holds
about a
