Implementation of RSA Algorithm Based on RNS Montgomery Multiplication-Reference-Cited by-同舟云学术

Implementation of RSA Algorithm Based on RNS Montgomery Multiplication

Published:2001 Issue: Volume: Page:364-376
ISSN:0302-9743
Container-title:Cryptographic Hardware and Embedded Systems — CHES 2001
language:
Short-container-title:

Author:

Nozaki Hanae,Motoyama Masahiko,Shimbo Atsushi,Kawamura Shinichi

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44709-1_30

Reference8 articles.

1. S. Kawamura, M. Koike, F. Sano, and A. Shimbo, “Cox-Rower Architecture for Fast Montgomery Multiplication,” EUROCRYPT 2000, pp. 523–538 (2000).

2. K. C. Posch and R. Posch, “Modulo Reduction in Residue Number Systems,” IEEE Tr. Parallel and Distributed Systems, Vol. 6, No. 5, pp. 449–454 (1995).

3. J.-C. Bajard, L.-S. Didier, and P. Kornerup, “An RNS Montgomery Multiplication Algorithm,” Proceedings of ARITH13, IEEE Computer Society, pp. 234–239 (1997).

4. P. Paillier, “Low-Cost Double-Size Modular Exponentiation or How to Stretch Your Cryptoprocessor,” PKC99, pp. 223–234 (1999).

5. E. Kranakis, “Primality and Cryptography,” Wiley-Teubner Series in Computer Science, John Willy & Sons (1986).

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

1. On the modulo 2 +1 addition and subtraction for weighted operands;Microprocessors and Microsystems;2023-09

2. An Efficient CRT-Base Power-of-Two Scaling in Minimally Redundant Residue Number System;Entropy;2022-12-14

3. Towards a CIA compliant RSA hybrid built on an Artificial Neural Network;2021 3rd International Multidisciplinary Information Technology and Engineering Conference (IMITEC);2021-11-23

4. Review of Algorithmic Techniques for Improving the Performance of Modular Exponentiation;Energy-Efficient Modular Exponential Techniques for Public-Key Cryptography;2021

5. Encryption and Authentication of Data Using the IPSEC Protocol;Lecture Notes in Electrical Engineering;2020-09-20