Abstract
Large prime numbers are one of inevitable ingredients in the public key crypto-systems. However, the decision of the primality requires significant computational resources. In this paper, we proposed two efficient methods to generate large prime numbers. Firstly, an accelerating method by utilizing pre-installed modular multiplier which is used to calculate public key algorithm is proposed. Secondly, new improved algorithm which reduces computational resources is presented. In the latter algorithm, the requirement for the related parameters are reinforced in order to prevent generating random numbers with small prime factors. In addition, by slightly releasing the requirement for the parameters, it is possible to remove the unit generation procedure in Joye and Paillier's scheme. Through these modifications, it is possible to obtain new efficient prime number generation 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.
