Paper 2014/041 Original: eprint.iacr.org/2014/041 ↗

Cryptanalysis via algebraic spans

Adi Ben-Zvi
Arkadius Kalka
Boaz Tsaban
Abstract

We introduce a method for obtaining provable polynomial time solutions of problems in nonabelian algebraic cryptography. This method is widely applicable, easier to apply, and more efficient than earlier methods. After demonstrating its applicability to the major classic nonabelian protocols, we use this method to cryptanalyze the Triple Decomposition key exchange protocol, the only classic group theory based key exchange protocol that could not be cryptanalyzed by earlier methods.

Metadata
Available format(s)
PDF
Publication info
Preprint.
History
2018-02-12: last updated
2014-01-15: published
Short URL
https://ia.cr/2014/041
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2014/041,
      author = {Adi Ben-Zvi and Arkadius Kalka and Boaz Tsaban},
      title = {Cryptanalysis via algebraic spans},
      howpublished = {Cryptology {ePrint} Archive, Paper 2014/041},
      year = {2014},
      url = {https://eprint.iacr.org/2014/041}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.