1
vote
How to prove that an algorithm is the time optimal algorithm for implementing a problem?
Since you stated interest in how to prove an algorithm is time-optimal, a telescopic summary:
This requires proving lower bounds on complexity, which is very difficult in general. I will use "...
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
complexity × 258encryption × 30
hash × 20
rsa × 18
cryptanalysis × 17
discrete-logarithm × 16
public-key × 15
algorithm-design × 15
factoring × 14
computational-complexity-theory × 14
brute-force-attack × 13
aes × 12
one-way-function × 11
hardness-assumptions × 11
provable-security × 9
finite-field × 9
number-theory × 9
post-quantum-cryptography × 8
elliptic-curves × 7
zero-knowledge-proofs × 7
symmetric × 7
lattice-crypto × 7
des × 6
modular-arithmetic × 6
attack × 6