Paper 2022/1644

An attack on a key exchange protocol based on max-times and min-times algebras

Ivan Buchinskiy, Sobolev Institute of Mathematics of SB RAS
Matvei Kotov, Sobolev Institute of Mathematics of SB RAS
Alexander Treier, Sobolev Institute of Mathematics of SB RAS
Abstract

In this paper, we examine one of the public key exchange protocols proposed in [M. I. Durcheva. An application of different dioids in public key cryptography. In AIP Conference Proceedings, vol. 1631, pp 336-343. AIP, 2014] which uses max-times and min-times algebras. We discuss properties of powers of matrices over these algebras and introduce a fast attack on this protocol. This preprint has not undergone peer review (when applicable) or any post-submission improvements or corrections. The Version of Record of this article is published in Indian Journal of Pure and Applied Mathematics, and is available online at https://doi.org/10.1007/s13226-023-00469-0.

Metadata
Available format(s)
PDF
Category
Attacks and cryptanalysis
Publication info
Published elsewhere. Minor revision. Indian Journal of Pure and Applied Mathematics
DOI
10.1007/s13226-023-00469-0
Keywords
key exchange protocoltropical algebramax-times algebramin-times algebramatrix powers
Contact author(s)
buchvan @ mail ru
matvej kotov @ gmail com
alexander treyer @ gmail com
History
2023-07-25: revised
2022-11-25: received
See all versions
Short URL
https://ia.cr/2022/1644
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2022/1644,
      author = {Ivan Buchinskiy and Matvei Kotov and Alexander Treier},
      title = {An attack on a key exchange protocol based on max-times and min-times algebras},
      howpublished = {Cryptology {ePrint} Archive, Paper 2022/1644},
      year = {2022},
      doi = {10.1007/s13226-023-00469-0},
      url = {https://eprint.iacr.org/2022/1644}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.