Maths holy grail could bring disaster for internet
Sarad AV
jtrjtrjtr2001 at yahoo.com
Wed Sep 8 02:41:18 PDT 2004
hello,
The security of elliptic curve cryptosystems depend on
the difficulty in solving the elliptic curve discrete
log problem(ECDLP). If any body gets to prove that
P=NP, then all the public key cryptosystemts which
rely on 'hard' problems will be useless for crypto.
Sarath.
--- Sunder <sunder at sunder.net> wrote:
> Forgive my ignorance, but would other PK schemes
> that don't rely on prime
> numbers such as Elliptic Curve be affected?
>
>
----------------------Kaos-Keraunos-Kybernetos---------------------------
> + ^ + :"Our enemies are innovative and resourceful,
> and so are we. /|\
> \|/ :They never stop thinking about new ways to
> harm our country /\|/\
> <--*-->:and our people, and neither do we." -G. W.
> Bush, 2004.08.05 \/|\/
> /|\ :
> \|/
> + v + : War is Peace, freedom is slavery, Bush
> is President.
>
-------------------------------------------------------------------------
>
> On Tue, 7 Sep 2004, Matt Crawford wrote:
>
> > On Sep 6, 2004, at 21:52, R. A. Hettinga wrote:
> >
> > This would be a good thing. Because to rebuild
> the infrastructure
> > based on symmetric crypto would bring the trusted
> third party
> > (currently the CA) out of the shadows and into the
> light.
>
>
__________________________________
Do you Yahoo!?
New and Improved Yahoo! Mail - Send 10MB messages!
http://promotions.yahoo.com/new_mail
More information about the cypherpunks-legacy
mailing list