Abstract
Many of the best-known cryptosystems, particularly public key systems, are numbertheory based and work within the setting of abelian groups. With increased computing power the security of these systems is constantly threatened. Consequently, non-commutative algebraic structures have been investigated as possible sources of cryptographic platforms. We discuss some of the group-theoretic problems exploited in the security of these new cryptosystems. We also describe Hurley's method for encryption and decryption using specially chosen units in group rings.
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 callDisclaimer: 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.
