Author:
Moldovyan Nikolay Andreevich,Moldovyan Dmitriy Nikolaevich
Abstract
PurposeThe practical purpose of this research is to propose a candidate for post-quantum signature standard that is free of significant drawback of the finalists of the NIST world competition, which consists in the large size of the signature and the public key. The practical purpose is to propose a fundamentally new method for development of algebraic digital signature algorithms.Design/methodology/approachThe proposed method is distinguished by the use of two different finite commutative associative algebras as a single algebraic support of the digital signature scheme and setting two different verification equation for a single signature. A single public key is computed as the first and the second public keys, elements of which are computed exponentiating two different generators of cyclic groups in each of the algebras.FindingsAdditionally, a scalar multiplication by a private integer is performed as final step of calculation of every element of the public key. The same powers and the same scalar values are used to compute the first and the second public keys by the same mathematic formulas. Due to such design, the said generators are kept in secret, providing resistance to quantum attacks. Two new finite commutative associative algebras, multiplicative group of which possesses four-dimensional cyclicity, have been proposed as a suitable algebraic support.Originality/valueThe introduced method is novel and includes new techniques for designing algebraic signature schemes that resist quantum attacks. On its base, a new practical post-quantum signature scheme with relatively small size of signature and public key is developed.
Subject
Computer Science Applications,Information Systems,Software
Reference19 articles.
1. Polynomial-time algorithms for prime factorization and discrete logarithms on quantum computer;SIAM J Comput,1997
2. Quantum computation and Shor's factoring algorithm;Rev Mod Phys,1996
3. Oversimplifying quantum factoring;Nature,2013
4. Federal Register. Announcing request for nominations for public-key post-quantum cryptographic algorithms. Available from: https://www.gpo.gov/fdsys/pkg/FR-2016-12-20/pdf/2016-30615.pdf (accessed 13 February 2021).
5. Round 3 Finalists. Public-key encryption and key-establishment algorithms. Available from: https://csrc.nist.gov/projects/post-quantum-cryptography/round-3-submissions (accessed 13 February 2021).
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献