An Efficient Parallel Montgemery Cryptography for Multi-Core Processor

Shi Ji Yuan; Ming Feng Sun; Zhi Hua Liu; Wen Jing Huang

doi:10.4028/www.scientific.net/AMM.385-386.1804

Paper Titles

The Principle of Dynamic Diagnosis Based on Integrated Maintenance Information and its Application
p.1785

A Research on KVM I/O Performance
p.1790

Generating Idempotents of Cubic Residue Codes over the Field F₄
p.1797

Multiple Factor Ambiguous Pattern Recognition Based on Secure Multi-Party Computation - An Important Future Technology in Engineering Application
p.1801

An Efficient Parallel Montgemery Cryptography for Multi-Core Processor
p.1804

ID-Based Multi-Signature Scheme in Electronic Communication
p.1808

The Application of Entropy Weighting Ideal Point Method in Electronic Information Equipment System of Systems Construction Decision-Making
p.1813

A Flexible Workflow Engine for Product Design Process
p.1819

Application of Digital Factory Technology for Transmission Production Line
p.1823

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 385-386An Efficient Parallel Montgemery Cryptography for...

An Efficient Parallel Montgemery Cryptography for Multi-Core Processor

Abstract:

The classical Montgomery ladder algorithm (MPL) is an effective way to improve the operational efficiency of elliptic curve cryptography. First, an improved MPL is proposed by loop unrolling, and then the Montgomery elliptic curve encryption and decryption process is realized using data parallel and task parallel. The experimental results show that the ratio of acceleration parallel processing efficiency can reach 70%, and the method can effectively improve the speed of elliptic curve encryption algorithm.

You might also be interested in these eBooks

Applied Scientific Research and Engineering Developments for Industry

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 385-386)

Pages:

1804-1807

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.385-386.1804

Citation:

Cite this paper

Online since:

August 2013

Authors:

Shi Ji Yuan, Ming Feng Sun, Zhi Hua Liu, Wen Jing Huang

Keywords:

Elliptic Curve Cryptography, Modular Exponentiation, Montgomery Ladder Algorithm (MPL), Parallel Processing

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Diffie W, Hellman M. New directions in cryptography . IEEE tans. Inform. Theory, 1976 (22): 644-654.

DOI: 10.1109/tit.1976.1055638

Google Scholar

[2] Zhu Zhaoguo, Ren Zhongbao, Gui Zuoqin. Fast algorithm of large integer modular exponentiation. High Performance Computing Technology. 2006(2) : 45-48.

Google Scholar

[3] Montgomery P L. Modular multiplication without trial division . Mathmatics of Computation, 1985, 44(170): 519-521.

DOI: 10.1090/s0025-5718-1985-0777282-x

Google Scholar

[4] Zuo Ping, Pang Shichun, Hua Hongtu. Secure and parallel Montgomery ladder algorithm of ECC. Journal of Jilin University(Science Edition) , 2011, 49(4): 690-692.

Google Scholar

[5] Li Xiaomei, Dou Yong. Parallel computation models and algorithm design. Journal of numerical methods and computer applications. 1995, 16(3): 18-22.

Google Scholar

[6] Gordon D M. A survey of fast exponentiation methods. Algorithms, 1998, 27(1): 129–146.

Google Scholar

[7] Li Wenlong, Liu Li , Tang Zhizhong. Loop unrolling optimization for software pipelining. Journal of Beijing University of Aeronautics and Astronautics. 2004, 30(11): 1111-1115.

Google Scholar

[8] Information on http: /so. 5ipatent. com/PatentDetails. aspx?patentID=4ba69c8d-aaee-44a5-9478 h-7c0411970b64&patentClass=1.

Google Scholar