Welcome to the resource topic for 2014/041
Title:
Cryptanalysis via algebraic spans
Authors: 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.
ePrint: https://eprint.iacr.org/2014/041
Talk: https://www.youtube.com/watch?v=FErhgOIpGEA
Slides: https://crypto.iacr.org/2018/slides/Cryptanalysis%20via%20algebraic%20spans.pdf
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .