1
$\begingroup$

I know, that quantum computers can theoretically break the discrete logarithm problem using the shor algorithm. The problem with quantum computers is not the time, but the space ( the needed qubits ). My question is: Can elliptic curve cryptographie be adjusted so that they are secure against quantum computers? ( e.g. longer key length )

$\endgroup$
  • 2
    $\begingroup$ Does this answer to your question How effective is quantum computing against elliptic curve cryptography? $\endgroup$ – kelalaka Jul 31 at 11:00
  • 2
    $\begingroup$ Related to your question: Supersingular isogeny key exchange. $\endgroup$ – AleksanderRas Jul 31 at 11:59
  • 2
    $\begingroup$ "The problem with quantum computers is not the time, but the space ( the needed qubits )" - actually, as we don't have a real quantum computer (a cryptographically relevant one) in front of us, we don't know what would be its most critical constraints - it may be the number of qubits, it may be a bound on the circuit depth, it may be limitations on moving the qubits around... $\endgroup$ – poncho Jul 31 at 12:50

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.