Re: [PrimeNumbers] RSA in polynomial time.
- --- overlord_77520 <healyd@...> wrote:
> I have found a way to reduce RSA to polynomial time. Anyone Interested?You've made a mistake; so no.
Unless you're talking about encrypting or decrypting with knowledge of the
appropriate key, in which case it's always been polynomial time; so no.
() ASCII ribbon campaign () Hopeless ribbon campaign
/\ against HTML mail /\ against gratuitous bloodshed
[stolen with permission from Daniel B. Cristofani]
Do You Yahoo!?
Tired of spam? Yahoo! Mail has the best spam protection around
- Yes, I am interested.
I also have a method.
You can see my messages to this list.
However, I am sure that the "moderators"
will not allow your messages.
You may send me off-line.
Milton L. Brown
miltbrown [at] earthlink.net
>From: overlord_77520 <healyd@...>
>Sent: Oct 17, 2006 4:45 PM
>Subject: [PrimeNumbers] RSA in polynomial time.
>I have found a way to reduce RSA to polynomial time. Anyone Interested?
>Unsubscribe by an email to: email@example.com
>The Prime Pages : http://www.primepages.org/
>Yahoo! Groups Links