2019, Vol.22, No.3, pp.269 - 276
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.
Key words: post-quantum cryptography, cryptographic access control, elliptic curve, isogeny
Full text: Acrobat PDF (237 KB)
Copyright © Nonlinear Phenomena in Complex Systems. Last updated: November 3, 2019