Short expressions of permutations as products and cryptanalysis of the algebraic eraser

DOI10.1016/j.aam.2012.03.001zbMath1272.94040arXiv0804.0629OpenAlexW1965815019WikidataQ61603157 ScholiaQ61603157MaRDI QIDQ432493

Boaz Tsaban, Mina Teicher, Arkadius G. Kalka

Publication date: 4 July 2012

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0804.0629

zbMATH Keywords

symmetric groupexpanderalgebraic erasercolored burau key agreement protocolexpressions of permutationsminimal cycle conjecture

Mathematics Subject Classification ID

Related Items (4)

Random generators of the symmetric group: diameter, mixing time and spectral gap. ⋮ Ironwood meta key agreement and authentication protocol ⋮ Distance in cayley graphs on permutation groups generated by $k$ $m$-Cycles ⋮ A Practical Cryptanalysis of the Algebraic Eraser

Uses Software

• GAP
• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A class of hash functions based on the Algebraic Eraser\(^{\text{TM}}\)
• An algorithm for solving the factorization problem in permutation groups
• The Magma algebra system. I: The user language
• An algebraic method for public-key cryptography
• Asymptotics of generating the symmetric and alternating groups.
• Cryptanalysis of the Anshel-Anshel-Goldfeld-Lemieux Key Agreement Protocol
• Seifert Fibre Spaces and Braid Groups
• The action of a few permutations onr-tuples is quickly transitive
• The probability of generating the symmetric group
• The probability of generating the symmetric group

This page was built for publication: Short expressions of permutations as products and cryptanalysis of the algebraic eraser