Parallel computation of the generating keys for RSA cryptosystems

Electronics Letters

Volumn 32, Issue 15, 1996, Pages 1365-1366

  Chang, C C ^a   Hwang, M S ^b  

^a NATIONAL CHUNG CHENG UNIVERSITY   (Taiwan)

^b CHAOYANG UNIVERSITY OF TECHNOLOGY   (Taiwan)

Author keywords

Number theory; Public key cryptography

Indexed keywords

ALGORITHMS; CALCULATIONS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; CRYPTOGRAPHY; NUMBER THEORY; SECURITY OF DATA; THEOREM PROVING;

DEROME METHOD; EUCLIDEAN ALGORITHM; EULER TOTIENT FUNCTION; FACTORISATION THEOREM; PUBLIC KEY CRYPTOGRAPHY;

PARALLEL PROCESSING SYSTEMS;

EID: 0030192262     PISSN: 00135194     EISSN: None     Source Type: Journal    
DOI: 10.1049/el:19960886     Document Type: Article

References (3)

1. RIVEST, R.L., SHAMIR, A., and ADLEMAN, L.: 'A method for obtaining digital signatures and public key cryptosystems', Comm. ACM, 1978, 21, (2), pp. 120-126
2. KNUTH, D.E.: The art of computer programming, Vol. 2., Seminumberical algorithms' (Addison Wesley, 1981) 2nd edn. pp. 317-330
3. DERÔME, M.F.A.: 'Generating RSA keys without the Euclid algorithm', Electron. Lett., 1993, 29, (1), pp. 19-21