A quantum circuit to find discrete logarithms on binary elliptic curves in depth O(log^2 n).
Martin RoettelerRainer SteinwandtPublished in: CoRR (2013)
Keyphrases
- elliptic curve
- logic circuits
- scalar multiplication
- high speed
- binary valued
- depth map
- digital signature
- elliptic curve cryptography
- public key cryptosystems
- public key cryptography
- continuous valued
- diffie hellman
- efficient computation
- worst case
- lower bound
- quantum computing
- real time
- low cost
- logic synthesis
- computational complexity