Fast exponentiation with modifed montgonmery modular multiplication

Montgomery 모듈라 곱셈을 변형한 고속 멱승

  • 하재철 (경북대학교 전자전기공학부) ;
  • 문상재 (경북대학교 전자전기공학부)
  • Published : 1997.05.01

Abstract

We modify the montgomery modeular multikplication to extract the common parts in common-multiplicand multi-plications. Since the modified method computes the common parts in two modular multiplications once rather than twice, it can speed up the exponentiations and reduce the amount of storage tables in m-ary or windowexponentiation. It can be also applied to an exponentiation mehod by folding the exponent in half. This method is well-suited to the memory limited environments such as IC card due to its speed and requirement of small memory.

Keywords

References

  1. IEEE Trans. Inform. Theory v.31 no.4 A public key cryptosystem and a signature scheme based on discrete logarithms T. ElGamal
  2. Comm. of ACM v.21 no.2 A method for obtaining digital signatures and public key cryptosystems R. Rivest;A. Shamir;Adleman
  3. Advances in Cryptology-CRY PTO '89 Proceedings Efficient signature generation for smart cards C. P. Schnorr
  4. Specifications for a Secure Hash Standard(SHS), FIPS YY Draft National Institute Standard Technology
  5. Seminumerical Algorithms(2nd Ed.) v.2 The Art of Programming D. E. Knuth
  6. Advances in Cryptology, Proc. CRY PTO '93 Comparison of three modular reduction functions A. Bosselaers;R. Govaerts;J. Vandewalle
  7. Advances in Cryptology, Proc. CRY PTO '86 Implementing the Rivest Shamir and Adleman public key encryption algorithm on a standard digital signal processor Paul Barrett
  8. Math. of Comp. v.44 no.170 Modular multiplication without trial division Peter L. Montgomery
  9. Advances in cryptology, Proc. EU ROCRY PT '90 A cryptographic library for the Motorola DSP 56000 S. R. Dusse;B. S. Kaliski
  10. 한국통신 정보보호학회 논문집 v.6 no.1 고속 멱승을 위한 새로운 모듈라 감소 알고리듬 하재철;이창순;문상재