The authors present a parallel implementation for generating RSA keys without using the Euclidean algorithm. Their method is based on a unique factorisation theorem, which combines with Derôme's method and allows the generation of RSA keys without using the Euclidean algorithm.
References
-
-
1)
-
D.E. Knuth
.
(1981)
The art of computer programming Vol. 2. Seminumberical algorithms.
-
2)
-
M.F.A. Derôme
.
Generating RSA keys without the Euclid algorithm.
Electron. Lett.
,
1 ,
19 -
21
-
3)
-
R.L. Rivest ,
A. Shamir ,
L. Adleman
.
A method for obtaining digital signatures and public key cryptosystems.
Comm. ACM
,
2 ,
120 -
126
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19960886
Related content
content/journals/10.1049/el_19960886
pub_keyword,iet_inspecKeyword,pub_concept
6
6