Abstract
Many methods have been proposed to generate the strong primes for the RSA public key cryptosystem. However, all of the methods are inefficient if strong primes with the constraint of bit length need to be generated. An efficient method is proposed for generating strong primes with the constraint of bit length.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.