ECDLP Can Be Solved in 24-th Root Time

Re:ECDLP Can Be Solved in 24-th Root Time by branzo on Friday April 01, 2016 @05:32AM (#11403698)

is this true?

[ Parent | on HN ]

Re:ECDLP Can Be Solved in 24-th Root Time by ctz on Friday April 01, 2016 @05:38AM (#11403716)

Yes. Even worse, because their are elliptic curve methods for factorising products of primes (Lenstra's ECM), there will be a knock-on effect on RSA. RSA keys will now need to be 131,072-bits to maintain their current level of security. This is effectively the Cryptopocalypse: https://www.schneier.com/blog/archives/2013/08/the_cryptopoc...

[commitment: a31500d27e35b23c63287161cb405e20]

[ Parent | on HN ]

Re:ECDLP Can Be Solved in 24-th Root Time by diziet on Friday April 01, 2016 @05:44AM (#11403744)

And to think that we knew about Leech lattice and E8 (Gosset Lattice) for so many decades already! :)

[ Parent | on HN ]