|
This article is cited in 2 scientific papers (total in 2 papers)
Application of non-associative structures to the construction of public key distribution algorithms
A. V. Baryshnikov, S. Yu. Katyshev Certification Research Center, LLC, Moscow
Abstract:
We explore the possibility of using non-associative groupoids to construct public key distribution algorithms generalizing the Diffie–Hellmann algorithm. A class of non-associative groupoids satisfying the power permutability property is founded. For this class the complexity of computing powers of an element and the complexity of discrete logarithm problem, including the possible usage of hypothetical quantum computer.
Key words:
public key distribution algorithm, non-associative groupoids, linear quasigroups, discrete logarithm problem, Hellmann method, quantum computer.
Received 11.V.2017
Citation:
A. V. Baryshnikov, S. Yu. Katyshev, “Application of non-associative structures to the construction of public key distribution algorithms”, Mat. Vopr. Kriptogr., 9:4 (2018), 5–30
Linking options:
https://www.mathnet.ru/eng/mvk267https://doi.org/10.4213/mvk267 https://www.mathnet.ru/eng/mvk/v9/i4/p5
|
|