You are looking at a specific version 20150525:211323 of this paper. See the latest version.

Paper 2014/041

Cryptanalysis via algebraic spans

Adi Ben-Zvi and Arkadius Kalka and Boaz Tsaban

Abstract

We describe a new method for obtaining polynomial time solutions of problems in noncommutative algebraic cryptography. This method is easier to apply and more efficient than the linear centralizer method. We use it to provide a cryptanalysis of the Triple Decompostion key exchange protocol, the only classic group theory based key exchange protocol that was not cryptanalyzed thus far.

Note: Substantial revision. New material added.

Metadata
Available format(s)
PDF
Publication info
Preprint. MINOR revision.
Keywords
noncommutative algebraic cryptographygroup theory-based cryptographybraid-based cryptographyTriple Decomposition key exchangeCommutator key exchangeCentralizer key exchangeBraid Diffie--Hellman key exchangelinear cryptanalysisalgebraic span cryptanalysis.
Contact author(s)
tsaban @ math biu ac il
History
2018-02-12: last of 2 revisions
2014-01-15: received
See all versions
Short URL
https://ia.cr/2014/041
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.