Entity authentication schemes using braid word reduction
From MaRDI portal
Publication:2489938
DOI10.1016/j.dam.2005.03.015zbMath1091.94036OpenAlexW1986698979MaRDI QIDQ2489938
Hervé Sibert, Patrick Dehornoy, Marc Girault
Publication date: 28 April 2006
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2005.03.015
Related Items (10)
Public key authentication scheme over quaternions ⋮ Efficient Authentication Scheme Based on the Twisted Near-Ring Root Extraction Problem ⋮ New public key cryptosystems from combinatorial group theory ⋮ Authenticated commutator key agreement protocol ⋮ Affine braid groups: a better platform than braid groups for cryptology? ⋮ Groups With Two Generators Having Unsolvable Word Problem and Presentations of Mihailova Subgroups of Braid Groups ⋮ A weak key test for braid based cryptography. ⋮ Authentication from Matrix Conjugation ⋮ Mean-set attack: cryptanalysis of Sibert et al. authentication protocol ⋮ Towards generating secure keys for braid cryptography
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A fast method for comparing braids
- Fragments of the word \(\Delta\) in a braid group
- Zero-knowledge proofs of identity
- Conjugacy problem for braid groups and Garside groups.
- Ordering the braid groups
- Braids and self-distributivity
- An algebraic method for public-key cryptography
- Les immeubles des groupes de tresses généralises
- Theory of braids
- THE EXTRACTION OF A ROOT IN A BRAID GROUP
- ALGORITHMS FOR POSITIVE BRAIDS
- The knowledge complexity of interactive proof-systems
- EXTRACTION OF ROOTS IN GARSIDE GROUPS
- THE BRAID GROUP AND OTHER GROUPS
This page was built for publication: Entity authentication schemes using braid word reduction