Prikladnaya Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Prikl. Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find






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


Prikladnaya Diskretnaya Matematika, 2013, Number 3(21), Pages 35–51 (Mi pdm424)  

This article is cited in 11 scientific papers (total in 11 papers)

Mathematical Methods of Cryptography

Cryptanalysis of some schemes applying automorphisms

V. A. Romankovab

a Omsk State University, Omsk, Russia
b Omsk State Technical University, Omsk, Russia
References:
Abstract: Some methods are given for cryptanalysis of encryption schemes and key establishment protocols based on a group (loop) algebra or on a graded algebra with multiplicative base and proposed by Rososhek; Mihalev et. al.; Mahalanobis, etc. These cryptosystems have a common feature that all of them (except the scheme of Mihalev) use automorphisms. Also, a cryptanalysis of the key exchange protocol proposed by Megreleshvili and Djindjihadze is given. An original approach is described to find a secret message or a shared key based on usual tools of linear algebra assuming that platform can be chosen as a finite dimensional algebra, e.g., a matrix algebra over a field. The approach does not suppose to find the secret automorphism used in protocol. A theoretical foundation of this approach and a series of attacks on some cryptosystems based on different generalizations of discrete logarithm and Diffie–Hellman's ideas to noncommutative groups are described by the author earlier. Here the approach is developed by presenting its new applications in cryptanalysis of different schemes and protocols.
Keywords: cryptographic scheme, group algebra, loop algebra, matrix algebra, graded algebra, discrete logarithm, generalized discrete logarithm, Diffie–Hellman scheme, El Gamal protocol, automorphism.
Document Type: Article
UDC: 512.5+00326.09
Language: Russian
Citation: V. A. Romankov, “Cryptanalysis of some schemes applying automorphisms”, Prikl. Diskr. Mat., 2013, no. 3(21), 35–51
Citation in format AMSBIB
\Bibitem{Rom13}
\by V.~A.~Romankov
\paper Cryptanalysis of some schemes applying automorphisms
\jour Prikl. Diskr. Mat.
\yr 2013
\issue 3(21)
\pages 35--51
\mathnet{http://mi.mathnet.ru/pdm424}
Linking options:
  • https://www.mathnet.ru/eng/pdm424
  • https://www.mathnet.ru/eng/pdm/y2013/i3/p35
  • This publication is cited in the following 11 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:798
    Full-text PDF :548
    References:97
    First page:1
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024