Parallel computation of the generating keys for RSA cryptosystems

Access Full Text

Parallel computation of the generating keys for RSA cryptosystems

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

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.

Inspec keywords: number theory; public key cryptography

Other keywords: RSA cryptosystems; parallel implementation; factorisation theorem; Derome's method; generating keys

Subjects: Combinatorial mathematics; Combinatorial mathematics; Data security; Codes

References

    1. 1)
      • D.E. Knuth . (1981) The art of computer programming Vol. 2. Seminumberical algorithms.
    2. 2)
      • M.F.A. Derôme . Generating RSA keys without the Euclid algorithm. Electron. Lett. , 1 , 19 - 21
    3. 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
Loading

Related content

content/journals/10.1049/el_19960886
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading