Constructions in public-key cryptography over matrix groups

Details Constructions in public-key cryptography over matrix groups Constructions in public-key cryptography over matrix groups

2005-06-10

arxiv.org/abs/math/0506180v1

Mathematics

Group Theory

Scientific paper

The purpose of the paper is to give new key agreement protocols (a multi-party extension of the protocol due to Anshel-Anshel-Goldfeld and a generalization of the Diffie-Hellman protocol from abelian to solvable groups) and a new homomorphic public-key cryptosystem. They rely on difficulty of the conjugacy and membership problems for subgroups of a given group. To support these and other known cryptographic schemes we present a general technique to produce a family of instances being matrix groups (over finite commutative rings) which play a role for these schemes similar to the groups $Z\_n^*$ in the existing cryptographic constructions like RSA or discrete logarithm.

Affiliated with

Also associated with

No associations

Rating

Constructions in public-key cryptography over matrix groups 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 Constructions in public-key cryptography over matrix groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Constructions in public-key cryptography over matrix groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-730200