Advertisement

Wuhan University Journal of Natural Sciences

, Volume 1, Issue 3–4, pp 446–449 | Cite as

A practical parallel algorithm for computinga b modc *

  • Dai Dawei
  • Huang Jingwei
Part II. Invited Lectures and Contributed Lectures 3. Non-Numerical Parallel Algorithms
  • 9 Downloads

Abstract

In this paper, we propose a practical parallel algorithm for computinga b modc. The algorithm is based on RNS representatins of integers. In particular, a technique is introduced for avoiding overflow. The algorithm is easy to be implemented on hardware and achieves linear speedup.

Key words

Public key cryptosystem RSA cryptosystem RNS representation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    W. Diffie, M. Hellman. New direction in cryptograph, IEEE Trans. Inf, Theory, IT-22:6(1976), 644–654.MATHCrossRefMathSciNetGoogle Scholar
  2. [2]
    R.L. Rivest, A. Shamir, L. Adleman, A Method for Obtaining Digital Sign- atures and Public-Key Cryptosystems. Comm. ACM Vol.21(2),120–126, Feb. 1978.MATHCrossRefMathSciNetGoogle Scholar
  3. [3]
    R. Tanaka and N. Szabo. Residue Arithmetic and Its Application to Comp- uter Technology, McGraw-Hill, New York 1968.Google Scholar

Copyright information

© Springer 1996

Authors and Affiliations

  • Dai Dawei
    • 1
  • Huang Jingwei
    • 2
  1. 1.Dept. of Computer ScienceWuhan UniversityP. R China
  2. 2.Dept. of Computer Science and TechnologyWuhan University of Hydraulic and Electric EngineeringP. R. China

Personalised recommendations