Title : “Pioneering research on the implementation of public-key cryptography using residue number system (RNS)”
Recipients : Shinichi Kawamura (AIST), Masanobu Koike (Toshiba), Yuichi Komano (Toshiba)

Abstract

Public-key cryptography is inevitable for realizing a secure digital society.
The award recipients proposed fundamental algorithms for implementing public-key cryptography using residue number system (RNS), which is more suitable for parallel processing than ordinary binary representation.
Their main contribution is to open a door to the new research field called “implementation of public-key cryptography using RNS”, by introducing an approximation in the process of RNS operation and thus invented efficient but accurate algorithms for the modular reduction and the comparison in RNS.

Link

https://www.ieice.org/eng_r/awards/new_honorary_members_award_winners.html?id=c

Reference

(1) S. Kawamura, M. Koike, F. Sano, and A. Shimbo, “Cox-rower architecture for fast parallel Montgomery multiplication,” EUROCRYPT2000, Lect. Note Comput. Sci., vol. 1807, Springer, May 2000.

(2) H. Nozaki, M. Motoyama, A. Shimbo, and S. Kawamura, “Implementation of RSA algorithm based on RNS Montgomery multiplication,” CHES 2001, Lect. Note Comput. Sci., vol. 2162, Springer, Sept. 2001.

(3) H. Nozaki, A. Shimbo, and S. Kawamura, “RNS Montgomery multiplication algorithm for duplicate processing of base transformations,” IEICE Trans. Fundamentals, vol. E86-A, no. 1, pp. 89-97, Jan. 2003.

(4) S. Kawamura, Y. Komano, H. Shimizu, and T. Yonemura, “RNS Montgomery reduction algorithms using quadratic residuosity,” Journal of Cryptographic Engineering, vol. 9, no. 4, Springer, Nov. 2019.

(5) S. Kawamura, Y. Komano, H. Shimizu, S. Osuka, D. Fujimoto, Y. Hayashi, and K. Imafuku, “Efficient algorithms for sign detection in RNS using approximate reciprocals,” IEICE Trans. Fundamentales, vol. E104-A, no. 1, pp. 121-134, Jan. 2021.