Post-Quantum Cryptographic Schemes Based on Codes

Abstract

Not all mathematical problems that today are considered hard will remain hard after the advent of quantum computers. In fact, there are some quantum algorithms able to accelerate the solution of some problems that are hard to solve with classical non-quantum computers. Among these, Grover’s algorithm [1] is able to provide a quadratic speedup in the search of an item in a non-ordered list, whereas Shor’s [2] algorithm is even more groundbreaking, since it allows to find the prime factors of an integer in polynomial time.