Constructions in public-key cryptography over matrix groups
Grigoriev, Dimitri ; Ponomarenko, Ilia
arXiv, 0506180 / Harvested from arXiv
Text on arXiv
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.
Publié le : 2005-06-10
Classification:  Mathematics - Group Theory,  Computer Science - Cryptography and Security,  Mathematical Physics 
@article{0506180,
     author = {Grigoriev, Dimitri and Ponomarenko, Ilia},
     title = {Constructions in public-key cryptography over matrix groups},
     journal = {arXiv},
     volume = {2005},
     number = {0},
     year = {2005},
     language = {en},
     url = {http://dml.mathdoc.fr/item/0506180}
}

Grigoriev, Dimitri; Ponomarenko, Ilia. Constructions in public-key cryptography over matrix groups. arXiv, Tome 2005 (2005) no. 0, . http://gdmltest.u-ga.fr/item/0506180/