1
vote
Accepted
Complexity of DLP vs ECDLP in MOV attack
Note that $O(\sqrt{p})$ is $\exp\big((\frac12+o(1))\log p\big)$, so exponential in $\log p$, whereas the complexity for the DLP is exponential in $(\log p)^{1/3}$ up to polynomial factors. ...
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
complexity × 274encryption × 32
hash × 20
rsa × 19
cryptanalysis × 18
discrete-logarithm × 18
algorithm-design × 16
factoring × 16
computational-complexity-theory × 16
public-key × 15
brute-force-attack × 13
aes × 12
hardness-assumptions × 12
one-way-function × 11
zero-knowledge-proofs × 10
provable-security × 9
finite-field × 9
number-theory × 9
elliptic-curves × 8
post-quantum-cryptography × 8
lattice-crypto × 8
symmetric × 7
des × 6
modular-arithmetic × 6
attack × 6