# great discovery in the field of elliptic curves cryptography?

Prof. Adi Shamir says in The Cryptographers' Panel 2016:

i think that NSA has made a great discovery in the field of elliptic curves cryptography and NSA wants to avoid the increased use and growth of ECC, so the NSA's argument of the quantum computer would be a smokescreen.

i know that ECC is faster and better than RSA but my questions:

1. is ECC resistant against quantum computer? i know that RSA isn't!
2. what could be great discovery? is it on implementation?
3. professor shamir says that quantum computers aren't risk for cryptography nowadays(in the near future) but i read in internet that the rate of progression in quantum computer is faster than what was predicted for it. am i true?

note:my main question is 2 ;in another words which aspect of ECC can be a great discovery that this aspect is not clear and known for cryptographers? what does professor shamir talk about?

• 1) ECC is less resistant against quantum computers than RSA. 2) We don't know. NSA is not known for sharing their cryptanalytic breakthroughs. – SEJPM Mar 4 '16 at 10:54

Quantum complexity for breaking RSA and ECC are $O(\frac{s^9}{{(\log (s))}^5})$ and $O(s^3)$ respectively. Which $s$ is security level $(80-96)$.