Post-quantum cryptography refers to cryptographic algorithms, usually public key algorithms (Asymmetric Cryptography), that are considered to be secure against ta cryptanalytic attack using a quantum computer. The security of currently popular public key algorithms is based on one of the following three hard mathematical problems, Integer Factorization Problem, Discrete Log Problem, or EC Discrete Log Problem. All of these problems could easily be solved on a sufficiently powerful quantum computer running Shor’s Algorithm. Examples of Asymmetric Cryptography include Rivest-Shamir-Adleman (RSA), Elliptic Curve Cryptography (ECC), and Diffie-Hellman. These cryptographic methods are in use for internet protocols and secure communications with an impact on the security of public, commercial, financial, and government domains.
Quantum Information Science (QIS) will be an influencing aspect of the future through the development of the new cryptographic key distribution, advanced sensors, and another necessary advancements in technology to meet the rapidly shifting security concerns of the upcoming quantum information processing era. The most near-term threat to asymmetric cryptography and one for which QuantumRonics is working to design new post-quantum cryptographic algorithms to replace current asymmetric algorithms.
Although quantum computing poses a threat to current public key algorithms, most of the symmetric cryptographic algorithms and hash functions are considered to be relatively secure against attacks using quantum computers. Since Quantum Grover’s Algorithm does speed up attacks against symmetric ciphers, it is being assumed that doubling the key size can effectively block these attacks. QuantumRonics is working on indigenous block ciphers of key-size 512-bit as well as discovering new areas of mathematics that can be used to design quantum secure block ciphers in line with quantum computer working principle for provable security.