Research on Algorithm in Fast Modular Exponentiation Based on FPGA

Lian Qing Zhao; Shu Li; Yuan Xun Chen; Dong Jun Liu

doi:10.4028/www.scientific.net/AMM.433-435.499

Paper Titles

A Feature Extraction Method of Gear Fault Based on the SVD EMD and Morphology
p.477

Study of the Fault Diagnosis Based on Wavelet and Neural Network for the Motor
p.483

Numerical Simulation of Underground Plant Rhizome Detection
p.489

Research of Fault Diagnosis of Coalmine Motor Bearings Based on Scale Adaptive Lifting Wavelet Transform
p.494

Research on Algorithm in Fast Modular Exponentiation Based on FPGA
p.499

Target Tracking in Sensor Networks Using Additive Divided Difference Information Filtering Method
p.503

ECG Denoising Based on MP Algorithm
p.510

Research on the Approximate Establish Condition of the Scattering Center
p.514

Design of Multi-Parameter Environmental Monitoring Instrument Based on Labview
p.519

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 433-435Research on Algorithm in Fast Modular...

Research on Algorithm in Fast Modular Exponentiation Based on FPGA

Abstract:

Modular exponentiation of large number is widely applied in public-key cryptosystem, also the bottleneck in the computation of public-key algorithm. Modular multiplication is the key calculation in modular exponentiation. An improved Montgomery algorithm is utilized to achieve modular multiplication and converted into systolic array to increase the running frequency. A high efficiency fast modular exponentiation structure is developed on FPGA to bring the best out of the modular multiplication module and enhance the ability of defending timing attacks and power attacks. For 1024 bit key operands, the design can be run at 170MHz.

You might also be interested in these eBooks

Advances in Mechatronics and Control Engineering II

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 433-435)

Pages:

499-502

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.433-435.499

Citation:

Cite this paper

Online since:

October 2013

Authors:

Lian Qing Zhao, Shu Li, Yuan Xun Chen, Dong Jun Liu

Keywords:

FPGA, Modular Exponentiation on Large Number, Montgomery Modular Multiplication, Public-Key Cryptography, Systolic Array

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Xiaona Jiang, Chenhua Duan. Improved Montgomery Algorithm and its modular multiplier implementation [J]. Computer Engineering, 2008, 34(12); 209-211.

Google Scholar

[2] MIAOQING HUANG, KRIS GAJ, TAREK EL-GHAZAWI. New hardware architectures for Montgomery modular multiplication algorithm[J]. IEEE Transactions on Computers, 2011, 60(7): 923-936.

DOI: 10.1109/tc.2010.247

Google Scholar

[3] C.D. WALTER. Montgomery exponentiation needs no final subtraction[J]. Electronics Letters, 1999, 35(21): 1831-1832.

DOI: 10.1049/el:19991230

Google Scholar

[4] GAËL HACHEZ, JEAN-JACQUES QUISQUATER. Montgomery exponentiation with no final subtractions: improved results [A]. CHES 2000. Lecture Notes in Computer Science[C]. 2000: 293-301.

DOI: 10.1007/3-540-44499-8_23

Google Scholar