Conjugacy search in braid groups. From a braid-based cryptogrphy point of view

DOI10.1007/s00200-006-0008-7zbMath1104.94020MaRDI QIDQ2432564

Volker Gebhardt

Publication date: 25 October 2006

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00200-006-0008-7

zbMATH Keywords

Cryptography; Cryptanalysis; Key exchange; Encryption; Braid groups; Braid-Diffie-Hellman; Conjugacy problem; Conjugacy search; Ultra summit set

Mathematics Subject Classification ID

20F05: Generators, relations, and presentations of groups

94A60: Cryptography

20F36: Braid groups; Artin groups

Related Items

Unnamed Item, On the conjugacy search problem and left conjugacy closed loops, Towards generating secure keys for braid cryptography, Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography

Uses Software

• Magma
• CBraid

Cites Work

• The Magma algebra system. I: The user language
• Conjugacy problem for braid groups and Garside groups.
• An algebraic method for public-key cryptography
• Computation of centralizers in braid groups and Garside groups.
• A new approach to the conjugacy problem in Garside groups.
• Theory of braids
• On the geometry and dynamics of diffeomorphisms of surfaces
• ALGORITHMS FOR POSITIVE BRAIDS
• A Practical Attack on Some Braid Group Based Cryptographic Primitives
• On the structure of the centralizer of a braid
• Advances in Cryptology - CRYPTO 2003
• THE BRAID GROUP AND OTHER GROUPS
• The infimum, supremum, and geodesic length of a braid conjugacy class.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item