Post-Quantum Primitives in Information Security

Abstract

Public-key cryptosystems based on integer factorization and discrete logarithm problems can be broken with rapidly developing quantum computing technologies. With appearance of large-scale quantum computer, these problems can be solved in polynomial time using Shor’s algorithm. The paper provides an overview of existing cryptographic protocols based on quantum-resistant problems. One of such hard problems involves isogeny computations between supersingular elliptic curves. A cryptographic access control scheme based on such hard problem is proposed. Analysis of the proposed protocol security and practical implementation limitations are given.