Using shifted conjugacy in braid-based cryptography
| dc.creator | Dehornoy, Patrick | |
| dc.date | 2006-09-16 | |
| dc.date.accessioned | 2026-07-07T07:23:53Z | |
| dc.date.available | 2026-07-07T07:23:53Z | |
| dc.description | Conjugacy is not the only possible primitive for designing braid-based protocols. To illustrate this principle, we describe a Fiat--Shamir-style authentication protocol that be can be implemented using any binary operation that satisfies the left self-distributive law. Conjugation is an example of such an operation, but there are other examples, in particular the shifted conjugation on Artin's braid group B\_oo, and the finite Laver tables. In both cases, the underlying structures have a high combinatorial complexity, and they lead to difficult problems. | |
| dc.identifier | https://arxiv.org/abs/cs/0609091 | |
| dc.identifier | http://arxiv.org/abs/cs/0609091 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/116150 | |
| dc.subject | Cryptography and Security | |
| dc.title | Using shifted conjugacy in braid-based cryptography | |
| dc.type | text |