Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Fast decipherment algorithm for RSA public-key cryptosystem

Fast decipherment algorithm for RSA public-key cryptosystem

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.

A fast algorithm is presented for deciphering cryptograms involved in the public-key cryptosystem proposed by Rivest, Shamir and Adleman. The deciphering method is based on the Chinese remainder theorem and on improved modular multiplication algorithms.

References

    1. 1)
      • Willoner, R., Chen, I-Neo: `An algorithm for modular exponentiation', Proc. 5th symp. on computer arithmetic, 1981, IEEE Computer society, p. 135–138.
    2. 2)
      • R.L. Rivest , A. Shamir , L. Adleman . A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM , 120 - 126
    3. 3)
      • A.V. Aho , J.E. Hopcroft , J.D. Ullman . (1974) , The design and analysis of computer algorithms.
    4. 4)
      • N.S. Szabo , R.I. Tanaka . (1967) , Residue arithmetic and its applications to computer technology.
    5. 5)
      • R.L. Rivest . A description of a single-chip implementation of the RSA cipher. Lambda , 14 - 18
    6. 6)
      • D.E. Knuth . (1981) , The art of computer programming, Vol. 2: semi-numerical algorithms.
    7. 7)
      • E.V. Krishnamurthy , V. Ramachandran . A cryptographic system based on finite field transforms. Proc. Ind. Acad. Sci. (Math. Sci.) , 75 - 93
    8. 8)
      • P.S. Henry . Fast decryption algorithm for the knapsack cryptographic system. Bell Syst. Tech. J. , 767 - 773
    9. 9)
      • Blakley, G.R.: `A computer algorithm for calculating the product ', Research report, .
    10. 10)
      • Schanning, B.P.: `Data encryption with public-key distribution', Proc. Eascon, 1979, IEEE, p. 653–660.
    11. 11)
      • Davies, D.W., Price, W.L., Parkin, G.I.: `An evaluation of public-key cryptosystems', NPL report, April 1980, CTUI (revised).
    12. 12)
      • E.H. Michelman . The design and operation of public-key cryptosystems. NCC , 305 - 311
    13. 13)
      • H.C. Williams . A modification of the RSA public-key encryption procedure. IEEE Trans. , 726 - 729
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19820617
Loading

Related content

content/journals/10.1049/el_19820617
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address