Public Key Exchange Using Matrices Over Group Rings
Delaram Kahrobaei, Charalambos Koupparis, Vladimir Shpilrain
TL;DR
This paper introduces a new public key exchange protocol utilizing matrices over group rings, enhancing computational efficiency and analyzing its security against DDH and CDH problems.
Contribution
It presents a novel key exchange method based on matrices over group rings, with security analysis for DDH and CDH problems on this platform.
Findings
Efficient computation for legitimate users.
Security considerations for DDH and CDH problems.
Novel platform using matrices over group rings.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.