Abstract
Large prime number generation methods in need of a more complex modular exponentiation, leading to defects of slower computing speed, Based on this genetic algorithm, proposed a new strong prime number generated algorithm. The method according to the characteristics of Strong Primes, the algorithm is simple, easy to implement to meet the needs of the RSA algorithm security , giving the method of determining the large prime numbers. Design fitness function , crossover and mutation strategies which can be used in genetic algorithm. Finally design the algorithm of producing Strong prime numbers
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.
