Towards generating secure keys for braid cryptography
From MaRDI portal
Publication:1008952
DOI10.1007/s10623-007-9123-0zbMath1178.94193OpenAlexW1990825084MaRDI QIDQ1008952
Ki Hyoung Ko, Tony Thomas, Jang Won Lee
Publication date: 31 March 2009
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-007-9123-0
Cryptography (94A60) Braid groups; Artin groups (20F36) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Related Items (7)
Public key protocols over the ring \(E_{p}^{(m)}\) ⋮ Cryptanalysis of the shifted conjugacy authentication protocol ⋮ Key exchange protocols over noncommutative rings. The case of ⋮ On the algebraic structure of \(E_p^{(m)}\) and applications to cryptography ⋮ Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography ⋮ Transitive Signatures from Braid Groups ⋮ New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups
Uses Software
Cites Work
- Conjugacy problem for braid groups and Garside groups.
- An algebraic method for public-key cryptography
- Conjugacy search in braid groups. From a braid-based cryptogrphy point of view
- Conjugacy in Garside groups. I: Cyclings, powers and rigidity.
- Entity authentication schemes using braid word reduction
- A weak key test for braid based cryptography.
- A new approach to the conjugacy problem in Garside groups.
- ALGORITHMS FOR POSITIVE BRAIDS
- A Practical Attack on Some Braid Group Based Cryptographic Primitives
- Advances in Cryptology - CRYPTO 2003
- A Practical Attack on a Braid Group Based Cryptographic Protocol
- THE BRAID GROUP AND OTHER GROUPS
- The infimum, supremum, and geodesic length of a braid conjugacy class.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Towards generating secure keys for braid cryptography
