A new approach to the conjugacy problem in Garside groups.

From MaRDI portal
Publication:2576204

DOI10.1016/j.jalgebra.2005.02.002zbMath1105.20032arXivmath/0306199OpenAlexW1972107094MaRDI QIDQ2576204

Volker Gebhardt

Publication date: 22 December 2005

Published in: Journal of Algebra (Search for Journal in Brave)

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




Related Items (51)

On the centralizer of generic braidsNoncrossing partitions for periodic braidsGarside groups are strongly translation discrete.Combinatorics of normal sequences of braidsFAST ALGORITHMIC NIELSEN–THURSTON CLASSIFICATION OF FOUR-STRAND BRAIDSPresentations of Dehn quandlesAbelian Subgroups of Garside GroupsAffine braid groups: a better platform than braid groups for cryptology?Representation attacks on the Braid Diffie-Hellman public key encryptionConjugacy search in braid groups. From a braid-based cryptogrphy point of viewPeriodic elements in Garside groups.Small braids with large ultra summit set.Cryptanalysis of the shifted conjugacy authentication protocolTwisted conjugacy in braid groups.Reducible braids and Garside theory.Fast Nielsen-Thurston classification of braids.Algorithmic recognition of quasipositive braids of algebraic length two.THE SUBWORD REVERSING METHODOn the conjugacy search problem and left conjugacy closed loopsConjugacy in Garside groups. III: Periodic braids.Limits of sequences of pseudo-Anosov maps and of hyperbolic 3-manifoldsA Garside-theoretic approach to the reducibility problem in braid groups.Conjugacy in Garside groups. II: Structure of the ultra summit set.On the structure of the centralizer of a braidAlgorithms for Garside calculusInfinite examples of cancellative monoids that do not always have least common multiple.The cyclic sliding operation in Garside groups.Basic results on braid groups.Groups With Two Generators Having Unsolvable Word Problem and Presentations of Mihailova Subgroups of Braid GroupsSolving the conjugacy problem in Garside groups by cyclic sliding.There exist conjugate simple braids whose associated permutations are not strongly conjugateIronwood meta key agreement and authentication protocolConjugacy Classes of the 3-Braid GroupTranslation numbers in a Garside group are rational with uniformly bounded denominators.On the cycling operation in braid groups.Polynomial-time solutions of computational problems in noncommutative-algebraic cryptographyTransitive Signatures from Braid GroupsTowards generating secure keys for braid cryptographySubgroup conjugacy problem for Garside subgroups of Garside groupsA New Approach to Extracting Roots in Garside GroupsOn parabolic subgroups of Artin-Tits groups of spherical typeOn the minimal positive standardizer of a parabolic subgroup of an Artin-Tits groupLeft-Garside categories, self-distributivity, and braidsA FAMILY OF PSEUDO-ANOSOV BRAIDS WITH LARGE CONJUGACY INVARIANT SETSAn attack on the Walnut digital signature algorithmCanonical forms of positive braidsUnnamed ItemA FAMILY OF PSEUDO-ANOSOV BRAIDS WHOSE SUPER-SUMMIT SETS GROW EXPONENTIALLYConjugacy Problem for Subgroups with Applications to Artin Groups and Braid Type GroupA new approach to the conjugacy problem in Garside groups.New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups


Uses Software


Cites Work


This page was built for publication: A new approach to the conjugacy problem in Garside groups.