Paper Info
Title
Refined Algorithm for Prime Number Generation in Embedded Security Systems
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.
Year
DOI
Venue
2011
10.1109/APSCC.2011.30
APSCC
Keywords
Field
DocType
prime number generation,embedded security systems,random number generation,public key crypto-systems,preinstalled modular multiplier,public key cryptosystems,modular multiplication,refined algorithm,public key cryptography,embedded systems,trial division,public key,acceleration,prime number,probabilistic logic,algorithm design and analysis,generic algorithm,algorithm design
Prime number,Algorithm design,Primality test,Computer science,Modular arithmetic,Algorithm,Trial division,Prime factor,Random number generation,Public-key cryptography
Conference
ISBN
Citations 
PageRank 
978-1-4673-0206-7
0
0.34
References 
Authors
3
3
Name
Order
Citations
PageRank
Young-Sik Kim139454.26
Sujan Raj Shrestha200.34
Ji-Woong Jang313817.79