34
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

A fast modular exponentiation for rsa on systolic arrays

, &
Pages 215-226 | Received 04 Apr 1995, Published online: 20 Mar 2007

References

  • Information technology - security techniques - data integrity mechanism using a cryptographic check function employing a block cipher algorithm ISO/IEC 9797.Second edition 1994-04-15
  • Koc , C.K. and Hung , C.Y. 1991 . Bit-level systolic arrays for modular multiplication . J. VLSI Signal Processing , 3 : 215 – 223 .
  • Eldridge , S.E. and Walter , C.D. 1993 . Hardware implementation of montgomery's modular multiplication algorithm . IEEE Trans. Computers , 42 ( 6 ) : 693 – 699 .
  • Eldridge , S.E. 1991 . A faster modular multiplication algorithm . International Journal of Computer Mathematics , 40 ( 6 ) : 63 – 68 .
  • Evans , D.J. 1991 . Systolic Algorithms , Gordon and Breach Science Publishers .
  • Gollmann , D. , Yongfei , Han and Mitchell , C. 1996 . Redundant integer representations and fast exponentiation . Designs, Codes and Cryptography , 7 : 135 – 151 .
  • Yongfei , Han and Evans , D.J. 1994 . Parallel inference algorithms for the connection method on systolic arrays . International Journal of Computer Mathematics , 53 ( 34 ) : 177 – 188 .
  • Yongfei , Han . 1983 . Simulation systems for Bit-Slice VLSI . Journal of Computer Engineering (Chinese) , 4 ( 34 )
  • Yongfei , Han and Evans , D.J. 1995 . On systolic arrays and neural nets for inference . International Journal of Computer Mathematics , 4 ( 34 )
  • Han Yongfei Evans D. J. The simulation methodology using models and parallel languages Proc. of the 92 Summer Computer Simulation Conference Reno, Nevada USA 1992 58 61
  • Han Yongfei Mitchell C. Gollmann D. Minimal k-SR Representations. Technical Report in preparation Dept. of Computer Science Royal Holloway, Uni. of London
  • Hui , L. C. K. and Lam , K.Y. 1994 . Fast square-and-multiply exponentiation for RSA . Electron. Lett , 30 ( 17 ) : 1396 – 1397 .
  • European Telecommunications Standards Institute. ETS 300 175-7 Radio Equipment and Systems (RES); Digital European Cordless Telecommunications (DECT) Common interface Part 7: Security feature. 1992
  • Jedwab , J. and Mitchell , C.J. 1989 . Minimum weight modified signed-digit representations and fast exponentiation . Electronics Letters , 25 ( 17 ) : 1171 – 1172 .
  • Knuth , D.E. 1981 . The art of computer programming , Edited by: Wesley. , Addison . Vol. 2 , seminumerical algorithms .
  • Kung , H.T. and Leiserson , C.E. 1978 . I.S. Duff et al . Knoxville, Tenn , 2 : 256 – 282 .
  • Lam , K.Y. and L. C. K. , Hui . 1994 . Efficiency of SS(1) square-and-multiply exponentiation algorithms . Electron. Lett , 30 ( 25 ) : 2115 – 2116 .
  • Rivest , R.L. , Shamir , A. and Adleman , L. 1978 . A method for obtaining digital signatures and public-key cryptosystems . Communication of the ACM , 21 ( 25 ) : 120 – 126 .
  • Bruce Schneier, Applied cryptography - protocol, algorithms, and source code in c
  • Shand , M. , Bertin , P. and Vuillemin , J. 1991 . Hardware speedups in long integer multiplication . ACM Sigarch , 19 ( 25 ) : 106 – 113 .
  • Walter , C.D. 1994 . Logarithmic speed modular multiplication . Electronics Letters , 30 ( 17 ) : 1397 – 1398 .
  • Walter , C.D. 1993 . Systolic modular multiplication . IEEE Trans. Computers , 42 ( 3 ) : 376 – 379 .
  • Zhang , C.N. 1993 . An improved binary algorithm for RSA . Computer Math. Applic , 25 ( 6 ) : 15 – 24 .
  • Zhang , C.N. and Yunx , Yun . 1988 . A parallel algorithm and systolic design for RSA cryptosystem . International Conf. on Systolic Array , 25 ( 6 ) : 233 – 237 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.