ACCELERATED IMPLEMENTATION OF THE MODULAR EXHIBITION ON LOW-DISCHARGE MICROPROCESSORS AND INTEGRATED MICROCONTROLLERS

Authors

  • K. G. Samofalov Национальный технический университет Украины "КПИ”
  • Ramzi Anwar Saliba Sunnah Национальный технический университет Украины "КПИ”
  • D. Yu. Levchun Национальный технический университет Украины "КПИ”

Abstract

The article proposes new algorithms for modular squaring and multiplication by a fixed number, based on the Montgomery recursion. Due to the elimination of redundant operations and the use of precalculations, the computational complexity of the proposed algorithms is significantly lower compared to the Montgomery multiplication algorithm. It is shown that when the proposed algorithms are implemented on low-bit microprocessors, built-in microcontrollers or smart cards, the time for calculating the modular exponentiation is six times less compared to the Montgomery modular exponentiation algorithm.

Author Biography

K. G. Samofalov, Национальный технический университет Украины "КПИ”

член-кор. НАН України

References

Таненбаум Э. Компьютерные сети. 4-е изд. - М.: Питер, 2003. - 991 с.

Харин Ю. С., Берник В. И., Матвеев Г. В., Агиевич С. В. Математические и компьютерные основы криптологии. Мн.: Новое знание, 2003. - 382 с.

Hong S. М., Oh S.Y., Yoon Н. New modular multiplication algorithms for fast modular exponentiation // Proceeding of Advances in Cryptology Eurocrypt’96, LNCS- 1070, Springer-Verlag, 1996,-PP. 166-177.

Kawamura S., Takabayashi K., Shimbo A. A fast modular exponentiation algorithm.// IEICE Transactions., Vol.E-47, №8, 1991.-PP. 2136-2142.

Menezer A. J., Van Oorschot P. C, Vanstone S. A. Handbook of Applied Cryp-tography. CRC-Press, 1997. - 780 c.

Montgomery P. L. Modular multipli-cation without trial division. // Mathematics of Computation, Vol. 44, 1985. - PP. 519- 521.

Published

2021-12-07

Issue

Section

Статті