Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/de-gruyter/subgroup-conjugacy-problem-for-garside-subgroups-of-garside-groups-Flo5CZxh1T
References (37)
-
Jonathan Longrigg, A. Ushakov (2007)
Cryptanalysis of the shifted conjugacy authentication protocol, 2
-
E-mail address: arkadius.kalka@rub.de, manliber@netvision.net.il, teicher@macs.biu.ac.il DEPT -
(2000)
Petites groupes gaussiens -
(1999)
Gaussian groups and Garside groups -
Patrick Dehornoy (2006)
Using shifted conjugacy in braid-based cryptographyArXiv, abs/cs/0609091
-
(2006)
Conjugacy search in braid groups, Applicable Algebra in Engineering -
(2008)
Cryptanalysis of shifted conjugacy authentication protocol , Journal of Math -
(1958)
The occurence problem for direct products of groups, Dokl -
J. Crisp (1999)
Injective maps between Artin groups -
Braid groups, chapter 9 in -
E. Artin (1950)
The theory of braids.American scientist, 38 1
-
D. Epstein (1992)
Word processing in groups -
(2009)
The occurence problem for direct products of groups -
(1998)
New approaches to the word and conjugacy problem in the braid groups, Advances in Math -
(1996)
Injective maps between Artin groups, in: Geometric Group Theory Down Under, Proceedings of a Special Year in Geometric Group Theory -
V. Gebhardt (2003)
A New Approach to the Conjugacy Problem in Garside GroupsMathematics eJournal
-
(1994)
Elrifai and Hugh R . Morton , Algorithms for positive braids -
(2006)
Conjugacy search in braid groups, Applicable Algebra in Engineering, Communication and Computing -
Matthieu Picantin (2001)
THE CONJUGACY PROBLEM IN SMALL GAUSSIAN GROUPSCommunications in Algebra, 29
-
D. Bessis (2001)
The dual braid monoidAnnales Scientifiques De L Ecole Normale Superieure, 36
-
(2000)
Ju-sung Kang and Choonsik Park, New Public-key Cryptosystem Using Braid Groups, Advances in cryptology -CRYPTO 2000 -
(1996)
Injective maps between Artin groups, in: Geometric Group Theory Down Under -
Eddy Godelle (2004)
Parabolic subgroups of Garside groupsJournal of Algebra, 317
-
N. Franco, J. González-Meneses (2001)
Conjugacy problem for braid groups and Garside groups1Journal of Algorithms
-
F. Garside (1969)
THE BRAID GROUP AND OTHER GROUPSQuarterly Journal of Mathematics, 20
-
D. Krammer (2002)
Braid groups are -
A. Clifford, G. Preston (1964)
The algebraic theory of semigroups -
J. Birman, K. Ko, Sangjin Lee (1997)
A new approach to the word and conjugacy problems in the braid groupsAdvances in Mathematics, 139
-
(1998)
New approaches to the word and conjugacy problem in the braid groups -
A. Kalka, E. Liberman, M. Teicher (2009)
A Note on the Shifted Conjugacy Problem in Braid Groups, 1
-
Patrick Dehornoy, L. Paris (1999)
Gaussian Groups and Garside Groups, Two Generalisations of Artin GroupsProceedings of the London Mathematical Society, 79
-
P. Deligne (1972)
Les immeubles des groupes de tresses généralisésInventiones mathematicae, 17
-
E. Elrifai, H. Morton (1994)
ALGORITHMS FOR POSITIVE BRAIDSQuarterly Journal of Mathematics, 45
-
V. Gebhardt (2006)
Conjugacy Search in Braid GroupsApplicable Algebra in Engineering, Communication and Computing, 17
-
K. Ko, Sangjin Lee, J. Cheon, Jae-Woo Han, Ju-Sung Kang, Choonsik Park (2000)
New Public-Key Cryptosystem Using Braid Groups -
E. Brieskorn, Kyoji Saito (1972)
Artin-Gruppen und Coxeter-GruppenInventiones mathematicae, 17
-
Jonathan Longrigg, A. Ushakov (2009)
A Practical Attack on a Certain Braid Group Based Shifted Conjugacy Authentication Protocol, 1
- Publisher
- de Gruyter
- Copyright
- Copyright © 2010 by the
- ISSN
- 1867-1144
- eISSN
- 1869-6104
- DOI
- 10.1515/gcc.2010.010
- Publisher site
- See Article on Publisher Site
Abstract
Abstract We solve the subgroup conjugacy problem for parabolic subgroups and Garside subgroups of a Garside group, and we present deterministic algorithms. This solution may be improved by using minimal simple elements. For standard parabolic subgroups of Garside groups we provide effective algorithms for computing minimal simple elements.
Journal
Groups - Complexity - Cryptology – de Gruyter
Published: Dec 1, 2010