Affine braid groups: a better platform than braid groups for cryptology?

DOI10.1007/s00200-011-0157-1zbMath1276.94021MaRDI QIDQ429773

Ping Zhu, Qiao-Yan Wen

Publication date: 20 June 2012

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-011-0157-1

zbMATH Keywords

normal form; word problem; public key cryptosystem; braid group; conjugacy problem; affine braid group

Mathematics Subject Classification ID

94A60: Cryptography

20F36: Braid groups; Artin groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fast method for comparing braids
• Small cancellation theory and automatic groups. II
• Probabilistic solutions of equations in the braid group.
• Group-based cryptography
• The cyclic sliding operation in Garside groups.
• Rational subgroups of biautomatic groups
• A new approach to the word and conjugacy problems in the braid groups
• Relations among the squares of the generators of the braid group
• Generic-case complexity, decision problems in group theory, and random walks.
• Conjugacy problem for braid groups and Garside groups.
• On the linearity of Artin braid groups.
• The \(K(\pi,1)\)-conjecture for the affine braid groups.
• An algebraic method for public-key cryptography
• Statistical properties of locally free groups with applications to braid groups and growth of random heaps
• Explicit presentations for the dual braid monoids
• Linearity of Artin groups of finite type.
• Dual Euclidean Artin groups and the failure of the lattice property.
• Cryptosystems using linear groups
• Representation attacks on the Braid Diffie-Hellman public key encryption
• Conjugacy in Garside groups. III: Periodic braids.
• Conjugacy in Garside groups. I: Cyclings, powers and rigidity.
• Conjugacy in Garside groups. II: Structure of the ultra summit set.
• Entity authentication schemes using braid word reduction
• Dual presentations of braid groups of affine type \(\widetilde A\).
• Normalisateurs de tores. I: Groupes de Coxeter etendus
• Die Fundamentalgruppe des Raumes der regulären Orbits einer endlichen komplexen Spiegelungsgruppe
• Les immeubles des groupes de tresses généralises
• Artin-Gruppen und Coxeter-Gruppen
• A new approach to the conjugacy problem in Garside groups.
• The dual braid monoid
• Conjugacy Problem for Subgroups with Applications to Artin Groups and Braid Type Group
• Abelian Subgroups of Garside Groups
• Thompson’s Group and Public Key Cryptography
• Braid groups and Artin groups
• ALGORITHMS FOR POSITIVE BRAIDS
• Generalized Braid Groups and Mapping Class Gropus
• A Practical Attack on Some Braid Group Based Cryptographic Primitives
• Gaussian Groups and Garside Groups, Two Generalisations of Artin Groups
• Braid pictures for Artin groups
• ON THE JONES POLYNOMIAL OF RIBBON KNOTS
• A GEOMETRIC AND ALGEBRAIC DESCRIPTION OF ANNULAR BRAID GROUPS
• Advances in Cryptology - CRYPTO 2003
• THE BRAID GROUP AND OTHER GROUPS
• Braid Group Cryptography
• Length Based Attack and Braid Groups: Cryptanalysis of Anshel-Anshel-Goldfeld Key Exchange Protocol
• Braid groups are linear
• Public Key Cryptography - PKC 2006
• Braid groups are linear