We give an overview of currently known and practically relevant conventional cryptography algorithms. The list is currently very incomplete, but will be expanded in the future.
|Algorithm||Type||Underlying mathematical problem||Typical key length||Known quantum computer attacks||Information-theoretically secure|
|RSA||Asymmetric/Public key||Prime factorization||1024-4096 bit||Shor's factoring algorithm|
|ECC||Asymmetric/Public key||Discrete logarithm||Shor's discrete log algorithm|
|AES||Symmetric||256 bit||Grover's algorithm|
|One-time pad||Symmetric||-||as long as message||None||Yes|
|Lattice-based cryptography||Asymmetric||Learning with errors/Finding short vectors||8000-32000 bits for Ring-LWE and a factor 10 more for standard LWE|