Part of the Lecture Notes in Computer Science book series (LNCS, volume 330)
A Fast Modular Arithmetic Algorithm Using a Residue Table
This paper proposes a fast modular arithmetic which can reduce the table size. It also implies the reduction of pre-computation time.
KeywordsInformation Security Table Lookup Memory Size Table Size High Block
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.
- R.L. Rivest, A. Shamir, L. Adleman: “A method of obtaining digital signatures and public key cryptosystem”, Comm. of ACM, pp.120–126 (Feb.1978).Google Scholar
- M. Rabin: “Digitalized signatures and public-key cryptosystems”, MIT/LCS/TR-212, Technical Report MIT (1979)Google Scholar
- N. Torii, M. Azuma, R. Akiyama: “A study on RSA parallel processing method” (in Japanese), Proc. of Workshop on cryptography and information security, pp.15–17 (Aug.1986).Google Scholar
- Y. Nagai, T. Takaragi, F. Nakagawa, R. Sasaki: “Development of trial production for electronic contract authentication system” (in Japanese), Proc. of Workshop on cryptography and information security, pp.109–121 (Jul.1987).Google Scholar
- Y. Kano, N. Matsuzaki, M. Tatebayashi: “A modulo exponentiation LSI using high-order modified Booth’s algorithm” (in Japanese), Proc. of workshop on cryptography and information security, pp.133–142.Google Scholar
© Springer-Verlag Berlin Heidelberg 1988