Montgomery’s Multiplication Technique: How to Make It Smaller and Faster-Reference-Cited by-同舟云学术

Montgomery’s Multiplication Technique: How to Make It Smaller and Faster

Published:1999 Issue: Volume: Page:80-93
ISSN:0302-9743
Container-title:Cryptographic Hardware and Embedded Systems
language:
Short-container-title:

Author:

Walter Colin D.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-48059-5_9

Reference29 articles.

1. T. Blum & C. Paar,“Montgomery Modular Exponentiation on Reconfigurable Hard-Ware”, Proc. 14th IEEE Symp. on Computer Arithmetic,Adelaide, 14-16 April 1999,IEEE Press (1999) 70–77

2. Lect Notes Comput Sci;D. Boneh,1997

3. R. P. Brent & H. T. Kung,“The Area-Time Complexity of Binary Multiplication”, J.ACM 28 (1981) 521–534

4. R. P. Brent & H. T. Kung, “A Regular Layout for Parallel Adders”, IEEE Trans. Comp. C-31 no. 3 (March 1982) 260–264

5. E. F. Brickell,“A Fast Modular Multiplication Algorithm with Application to Two Key Cryptography”, Advances in Cryptology-CRYPTO’ 82, Chaum et al. (eds.),New York, Plenum (1983) 51–60

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

1. Design of hybrid cryptosystem using AES and SHA-1 algorithms;PROCEEDINGS OF THE 1ST INTERNATIONAL CONFERENCE ON FRONTIER OF DIGITAL TECHNOLOGY TOWARDS A SUSTAINABLE SOCIETY;2023

2. Hybrid Cryptosystem’s Design with AES and SHA-1 Algorithms;Algorithms for Intelligent Systems;2022-09-14

3. High-Radix Design of a Scalable Montgomery Modular Multiplier With Low Latency;IEEE Transactions on Computers;2022-02-01

4. Fast Computation of the Exact Number of Magic Series with an Improved Montgomery Multiplication Algorithm;Algorithms and Architectures for Parallel Processing;2020

5. Are Timing-Based Side-Channel Attacks Feasible in Shared, Modern Computing Hardware?;International Journal of Organizational and Collective Intelligence;2018-04