Re: RSA

From: Michael Amling (nospam_at_nospam.com)
Date: 07/06/03

Next message: Michael Amling: "Re: RSA algorithm"
Previous message: Mok-Kong Shen: "Re: More performance tests of different AES implementations"
In reply to: lakis: "RSA"
Next in thread: lakis: "Re: RSA"
Reply: lakis: "Re: RSA"
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]

Date: Sun, 06 Jul 2003 14:34:36 GMT

lakis wrote:
> Suppose that we overhear the ciphertexts of the following original
> messages m,m+1,m+2 knowing e=3. How can we find m in polynomial time?
> Thank you

If you can't do your own homework in polynomial time then you're in
the wrong field.

--Mike Amling

Next message: Michael Amling: "Re: RSA algorithm"
Previous message: Mok-Kong Shen: "Re: More performance tests of different AES implementations"
In reply to: lakis: "RSA"
Next in thread: lakis: "Re: RSA"
Reply: lakis: "Re: RSA"
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]

Relevant Pages

RSA
... Suppose that we overhear the ciphertexts of the following original ... messages m,m+1,m+2 knowing e=3. ... How can we find m in polynomial time? ...
(sci.crypt)
Re: RSA
... >> Suppose that we overhear the ciphertexts of the following original ... It's not a homework just curiosity because i'm working on these...I ... hope for an answer or help in polynomial time:) ...
(sci.crypt)
Re: RSA
... lakis wrote: ... > It's not a homework just curiosity because i'm working on these...I ... > hope for an answer or help in polynomial time:) ...
(sci.crypt)
Re: RSA
... In article, lakis wrote: ... > Suppose that we overhear the ciphertexts of the following original ... It is a set of linear equations for the unknowns, x,y,z ...
(sci.crypt)