The root extraction problem in braid group-based cryptography

DOI10.1007/s44007-024-00117-xMaRDI QIDQ6611805

María Cumplido, Marialaura Noce, Delaram Kahrobaei

Publication date: 27 September 2024

Published in: La Matematica (Search for Journal in Brave)

zbMATH Keywords

braid groupscryptographyroot problemalgorithmic problems

Mathematics Subject Classification ID

Cryptography (94A60) Braid groups; Artin groups (20F36) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Garside groups are strongly translation discrete.
• The cyclic sliding operation in Garside groups.
• Solving the conjugacy problem in Garside groups by cyclic sliding.
• Fragments of the word \(\Delta\) in a braid group
• An algebraic method for public-key cryptography
• On the centralizer of generic braids
• The \(n\)th root of a braid is unique up to conjugacy.
• The theorem of Kerékjártó on periodic homeomorphisms of the disc and the sphere
• On the genericity of pseudo-Anosov braids. II: Conjugations to rigid braids.
• Entity authentication schemes using braid word reduction
• Artin-Gruppen und Coxeter-Gruppen
• A new approach to the conjugacy problem in Garside groups.
• Theory of braids
• Subgroup conjugacy problem for Garside subgroups of Garside groups
• THE EXTRACTION OF A ROOT IN A BRAID GROUP
• ALGORITHMS FOR POSITIVE BRAIDS
• Gaussian Groups and Garside Groups, Two Generalisations of Artin Groups
• A New Approach to Extracting Roots in Garside Groups
• Group-based Cryptography in the Quantum Era
• Applications of group theory in cryptography. Post-quantum group-based cryptography

This page was built for publication: The root extraction problem in braid group-based cryptography