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
On Sep 6, 2004, at 21:52, R. A. Hettinga wrote:
But the proof should give us more understanding of how the
primes work, and therefore the proof might be translated into something
that might produce this prime spectrometer. If it does, it will bring
the
whole of e-commerce to its knees, overnight.
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
RAH pastes:
Tim Radford, science editor
Tuesday September 7, 2004
The Guardian
Mathematicians could be on the verge of solving two separate million dollar
problems. If they are right - still a big if - and somebody really has
cracked the so-called Riemann hypothesis, financial disaster
http://www.guardian.co.uk/print/0,3858,5009766-103690,00.html
The Guardian
Maths holy grail could bring disaster for internet
Two of the seven million dollar challenges that have baffled for more than
a century may be close to being solved
Tim Radford, science editor
Tuesday September 7, 2004
