Abstract
RSA is an algorithm for public-key cryptography and is considered as one of the great advances in the field of public key cryptography. RSA security lies in the difficulty of factoring large number into prime factors. The inventor of RSA Algorithm suggests prime number that is used to generate the keys have more than 100 digits' length for security reasons. Elgamal algorithm also is one of public key cryptography algorithm. The security of this algorithm lies in the difficulty of calculating discrete logarithm. In this paper, the author proposes key generation algorithm that is considered safe from the combination of the RSA and Elgamal algorithm. Based on the experiment that has been done, the computing time required for the proposed algorithm is relatively short, compared to the original RSA algorithm.
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.
