Public key exchange using matrices over group rings
Public key exchange using matrices over group rings
Kahrobaei, Delaram; Koupparis, Charalambos; Shpilrain, Vladimir
2013-05-01 00:00:00
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.
http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.pngGroups Complexity Cryptologyde Gruyterhttp://www.deepdyve.com/lp/de-gruyter/public-key-exchange-using-matrices-over-group-rings-5OJORHULfO
Public key exchange 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.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.