Towards generating secure keys for braid cryptography
- 8 September 2007
- journal article
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 45 (3) , 317-333
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A new approach to the conjugacy problem in Garside groupsJournal of Algebra, 2005
- Braid-based cryptography2004
- Conjugacy problem for braid groups and Garside groupsJournal of Algebra, 2003
- A Polynomial Time Algorithm for the Braid Diffie-Hellman Conjugacy ProblemLecture Notes in Computer Science, 2003
- A Linear Algebraic Attack on the AAFG1 Braid Group CryptosystemLecture Notes in Computer Science, 2002
- The Infimum, Supremum, and Geodesic Length of a Braid Conjugacy ClassAdvances in Mathematics, 2001
- An Efficient Implementation of Braid GroupsLecture Notes in Computer Science, 2001
- An algebraic method for public-key cryptographyMathematical Research Letters, 1999
- ALGORITHMS FOR POSITIVE BRAIDSThe Quarterly Journal of Mathematics, 1994
- THE BRAID GROUP AND OTHER GROUPSThe Quarterly Journal of Mathematics, 1969