Public key exchange using matrices over group rings

@inproceedings{Kahrobaei2013PublicKE,
  title={Public key exchange using matrices over group rings},
  author={Delaram Kahrobaei and Charalambos Koupparis and V. Shpilrain},
  booktitle={Groups Complex. Cryptol.},
  year={2013}
}
Abstract. We offer a public key exchange protocol in the spirit of Diffie–Hellman, but we use (small) matrices over a group ring of a (small) symmetric group as the platform. This “nested structure” of the platform makes computation very efficient for legitimate parties. We discuss security of this scheme by addressing the Decision Diffie–Hellman (DDH) and Computational Diffie–Hellman (CDH) problems for our platform. 
Cryptanalysis of Some Protocols Using Matrices over Group Rings
Public Key Exchange Using Semidirect Product of (Semi)Groups
Quantum algorithm for discrete logarithm problem for matrices over finite group rings
Undeniable signature scheme based over group ring
A New Authenticated Key Agreement Protocol
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 12 REFERENCES
The Decision Diffie-Hellman Problem
  • D. Boneh
  • Mathematics, Computer Science
  • ANTS
  • 1998
Fast Elliptic Curve Cryptography in OpenSSL
An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (Corresp.)
New directions in cryptography
Algorithms for quantum computation: discrete logarithms and factoring
  • P. Shor
  • Mathematics, Computer Science
  • Proceedings 35th Annual Symposium on Foundations of Computer Science
  • 1994
Handbook of Applied Cryptography
Monte Carlo Methods for Index Computation (mod p)
The Class Number
Nonparametric Statistical Inference
...
1
2
...