Method and device for generating big prime number rapidly
A large prime number and fast technology, applied in the field of cryptography, can solve problems such as low efficiency and long operation time
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0042] In order to explain in detail the technical content, structural features, achieved goals and effects of the technical solution, the following will be described in detail in conjunction with specific embodiments and accompanying drawings.
[0043] see figure 1 , is a flowchart of a method for rapidly generating large prime numbers according to an embodiment of the present invention. The method can be used to find large prime numbers, and specifically includes the following steps:
[0044] First enter step S101 to generate a random number of corresponding length according to the number of digits input by the user, and the number of digits of the random number is the same as the number of digits input by the user. In order to ensure that the generated random number is large enough, if the highest bit of the generated random number is not 1, the highest bit of the random number can be set to 1 (the random number here is based on binary representation). In some embodiments...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


