6. Conclusion
This paper proposes a fast modular arithmetic which can reduce the table size. It also implies the reduction of pre-computation time.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
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).
M. Rabin: “Digitalized signatures and public-key cryptosystems”, MIT/LCS/TR-212, Technical Report MIT (1979)
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).
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).
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kawamura, Si., Hirano, K. (1988). A Fast Modular Arithmetic Algorithm Using a Residue Table. In: Barstow, D., et al. Advances in Cryptology — EUROCRYPT ’88. EUROCRYPT 1988. Lecture Notes in Computer Science, vol 330. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45961-8_21
Download citation
DOI: https://doi.org/10.1007/3-540-45961-8_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50251-7
Online ISBN: 978-3-540-45961-3
eBook Packages: Springer Book Archive