A quantum circuit to find discrete logarithms on ordinary binary elliptic curves in depth O(log^2n).
Martin RöttelerRainer SteinwandtPublished in: Quantum Inf. Comput. (2014)
Keyphrases
- elliptic curve
- logic circuits
- scalar multiplication
- lower bound
- public key cryptography
- digital signature
- continuous valued
- efficient computation
- elliptic curve cryptography
- high speed
- logic synthesis
- diffie hellman
- quantum computing
- binary valued
- power analysis
- worst case
- real time
- circuit design
- depth map
- key management
- low cost
- end to end
- key distribution
- similarity measure