Advertisement

Modular Exponentiation Using Recursive Sums of Residues

  • P. A. Findlay
  • B. A. Johnson
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 435)

1. Summary

This paper describes a method for computing a modular exponentiation, useful in performing the RSA Public Key algorithm, suitable for software or hardware implementation. The method uses conventional multiplication, followed by partial modular reduction based on sums of residues. We show that for a simple recursive system where the output of partial modular reduction is the input for the next multiplication, overflow presents few problems.

Keywords

Modular Exponentiation Multiplier Array Typical Digital Signal Processing 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. [1]
    Baker, P.W. ‘Fast computation of A*B mod N’ IEE Electronics Letters, Vol.23, No.15, 16 July 1987, pp794.CrossRefGoogle Scholar
  2. [2]
    Blakley, G.R. ‘A Computer Algorithm for Calculating the Product AB Mod M’ IEEE Trans. Comp. Vol.C32 No.5 May 1983Google Scholar
  3. [3]
    Brickell, E.F. ‘A Fast Modular Multiplication Algorithm with application to two-key Cryptography’ In “Advances in Cryptology”, conf. proc. Crypto’82, Plenum Press, 1982.Google Scholar
  4. [4]
    Ngo-Chen, I., Willoner, R. ‘An O(n) Parallel Multiplier having Bit Sequential Input and Output’ IEEE Trans. Comp. Vol.C28 No.10 Oct.1979Google Scholar
  5. [5]
    Ngo-Chen, I., Willoner, R. ‘An Algorithm for Modular Exponentiation’ Proc. 5th Symp. Comp. Arith. IEEE 1981Google Scholar
  6. [6]
    Rivest, R.L., Shamir, A., and Adleman, L. ‘On Digital Signatures and Public Key Cryptosystems’, Comms. ACM, Vol.21, No.2, Feb. 1978 pp120–126zbMATHCrossRefMathSciNetGoogle Scholar
  7. [7]
    Selby, A., Mitchell, C. ‘Algorithms for Software Implementations of RSA’ IEE Proc. May 1989 Vol.136 Part E No.3 p166Google Scholar
  8. [8]
    Strader, N.R., Rhynne, V.T. ‘A Canonical Bit Sequential Multiplier’ IEEE Trans. Comp. Vol.C31 No.8 Aug. 1982Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • P. A. Findlay
    • 1
  • B. A. Johnson
    • 1
  1. 1.Hatfield PolytechnicUK

Personalised recommendations