Using shifted conjugacy in braid-based cryptography

Details Using shifted conjugacy in braid-based cryptography Using shifted conjugacy in braid-based cryptography

2006-09-16

arxiv.org/abs/cs/0609091v1

Computer Science

Cryptography and Security

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Using shifted conjugacy in braid-based cryptography does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Using shifted conjugacy in braid-based cryptography, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Using shifted conjugacy in braid-based cryptography will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-282637