Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography]
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Mat. Vopr. Kriptogr.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography], 2018, Volume 9, Issue 4, Pages 5–30
DOI: https://doi.org/10.4213/mvk267 (Mi mvk267) 		 
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
Full-text PDF (294 kB) Citations (2)
References:
PDF
HTML
DOI: https://doi.org/10.4213/mvk267
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
Bibliographic databases:
Document Type: Article
UDC: 519.548.2
Language: Russian
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
Citation in format AMSBIB
\Bibitem{BarKat18}
\by A.~V.~Baryshnikov, S.~Yu.~Katyshev
\paper Application of non-associative structures to the construction of public key distribution algorithms
\jour Mat. Vopr. Kriptogr.
\yr 2018
\vol 9
\issue 4
\pages 5--30
\mathnet{http://mi.mathnet.ru/mvk267}
\crossref{https://doi.org/10.4213/mvk267}
\elib{https://elibrary.ru/item.asp?id=32810558}
Linking options:
  • https://www.mathnet.ru/eng/mvk267
  • https://doi.org/10.4213/mvk267
  • https://www.mathnet.ru/eng/mvk/v9/i4/p5
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Математические вопросы криптографии
    Statistics & downloads:
    Abstract page:395
    Full-text PDF :210
    References:48
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024