Quantum computing is a model of computation that uses quantum bits instead of classical $0/1$ bits. This allows for the superposition of classically allowable states. Relevant topics include quantum algorithms (e.g. Shor's factoring algorithm), quantum information theory, quantum entanglement, and ...
It is well known that modular exponentiation (the main part of an RSA operation) is computationally expensive, and as far as I understand things the technique of Montgomery modular exponentiation is ...
In cryptography, there are password hash functions like scrypt and argon2 for which the fastest known algorithms employ large ...