Abstract
One of the earliest examples of public key cryptography is the Diffie-Hellman key exchange protocol, which is based on the discrete logarithm problem. In 2000, Ko, Lee et al. modified the Diffie-Hellman protocol by using braid groups as platform where the security of the protocol lies on the conjugacy search problem. In this paper, we propose two key exchange protocols that use two well known classes of nonassociative Moufang loops as potential platforms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Discrete Mathematical Sciences and Cryptography
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
