Abstract
In this paper we introduce a secure and efficient public key cryptosystem using generalized Mersenne primes based on two hard problems: the cubic root extraction modulo a composite integer and the discrete logarithm problem (DLP). These two problems are combined during the key generation, encryption and decryption phases. To break the scheme, an attacker has to solve the cubic root computation and the DLP separately which is computationally infeasible.
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.
