RSA Cryptosystem Based on Early Word Based Montgomery Modular Multiplication-Reference-Cited by-同舟云学术

RSA Cryptosystem Based on Early Word Based Montgomery Modular Multiplication

Published:2018 Issue: Volume: Page:33-47
ISSN:0302-9743
Container-title:Services – SERVICES 2018
language:
Short-container-title:

Author:

Verma Rupali,Dutta Maitreyee,Vig Renu

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-94472-2_3

Reference22 articles.

1. Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120–126 (1978)

2. Koc, C.K.: High-Speed RSA Implementation, RSA Labs, Redwood City, CA, Technical report (1994)

3. Montgomery, P.L.: Modular multiplication without trial division. Math. Comput. 44(170), 519–521 (1985)

4. Tenca, A.F., Koc, C.K.: A Scalable architecture for modular multiplication based on montgomery’s algorithm. IEEE Trans. Comput. 52(9), 1215–1221 (2003)

5. Harris, D., Krishnamurthy, R., Anders, M., Mathew, S., Hsu, S.: An improved unified scalable radix 2 Montgomery multiplier. In: Proceedings of the 17th IEEE Symposium on Computer Arithmetic (ARITH), pp. 172–178 (2005)

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. FPGA Implementation of Enhanced Montgomery Modular for Fast Multiplication;ITM Web of Conferences;2023

2. Lattice-Based Cryptoprocessor for CCA-Secure Identity-Based Encryption;IEEE Transactions on Circuits and Systems I: Regular Papers;2020-07

3. The Novel Efficient Dual-field FIPS Modular Multiplication;KSII Transactions on Internet and Information Systems;2020-02-29