Post-quantum Cryptoschemes: New Finite Non-commutative Algebras for Defining Hidden Logarithm Problem
In the article we present some properties of non-commutative finite algebras of four-dimension vectors with parameterized multiplication operation characterized in that different modifications of the multiplication operation are mutually associative. One of the introduced finite algebras represents ring. Other algebra contains no global unit element, its elements are invertible locally, and is characterized in that the multiplication operation possess compression property. Regarding the investigated ring, the detailed attention is paid to properties of the set of non-invertible elements of the ring. Formulas for zero-divisors and unit elements of different types are derived. The introduced finite algebras represent interest to define over them the hidden discrete logarithm problem that is a promising cryptographic primitive for post-quantum cryptography.
KeywordsFinite algebra Ring Galois field Vector Local left unit element Bi-side unit element Associative multiplication Parameterized multiplication Cryptoscheme
- 1.Sirwan, A., Majeed, N.: New algorithm for wireless network communication security. Int. J. Cryptogr. Inf. Secur. 6(3/4), 1–8 (2016)Google Scholar
- 3.Chiou, S.Y.: Novel digital signature schemes based on factoring and discrete logarithms. Int. J. Secur. Appl. 10(3), 295–310 (2016)Google Scholar
- 9.Federal Register: Announcing Request for Nominations for Public-Key Post-Quantum Cryptographic Algorithms. The Daily journal of the United States Government. https://www.gpo.gov/fdsys/pkg/FR-2016-12-20/pdf/2016-30615.pdf. Accessed 6 June 2018