METHOD FOR A PRIME NUMBER TEST, CAPABLE OF PERFORMING A HIGH SPEED PRIME NUMBER TEST FOR PUBIC/SECRET KEY GENERATION

摘要

PURPOSE: A method for a prime number test is provided to minimize the number of necessary calculations in a prime number decision through a calculation process which is simpler than a Miler-Rabin test.;CONSTITUTION: A small embedded system generates an arbitrary random number(n)(S300). The system generates two variables(r,s)(S302). The system generates a first modular value(a') through a first modular operation(S308). The system generates a second modular value(b) through a second modular value(S312). If the second modular value is 1 or n-1, the system determines the generated random number(n) as a prime number(S320).;COPYRIGHT KIPO 2010