No label defined (Q4656952)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2144676
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 2144676 |
Statements
14 March 2005
0 references
braid-based cryptosystems
0 references
cryptographic schemes
0 references
Artin braid groups
0 references
attacks
0 references
conjugacy problem
0 references
computational complexity
0 references
0.9170637130737304
0 references
0.8899378180503845
0 references
0.8865290284156799
0 references
0.8787782788276672
0 references
0.8782153129577637
0 references
From the author's abstract: We survey some of the recently developed cryptographic schemes involving Artin's braid groups, as well as the attacks against these schemes. We also point out some hints for future work. The paper contains: Background on braids: Braid groups, The greedy normal form, Implementation of braids. Braid-based schemes: Key exchange, Enciphering-deciphering, Authentication, Signature. Attacks against the braid schemes: Solutions to the Conjugacy Problem, Attacks based on length, Attacks based on linear representations. Clues for further research: Key generation, Random drawing and security proofs, Using braid words and braid reduction, Hash functions, Resorting to other braid problems. This survey is far from complete, but its aim is to give an introduction rather than a comprehensive description. We would like to convince the reader that braid cryptography is still at a very preliminary stage, and that much more work is needed before it can be claimed to be a valuable alternative to the cryptosystems based on modular integers or on elliptic curves. For the entire collection see [Zbl 1053.20500].
0 references