Optimizing the improved Barrett modular multipliers for public-key cryptography

Yinan Kong

doi:10.1109/CISE.2010.5676912

Optimizing the improved Barrett modular multipliers for public-key cryptography

Yinan Kong^*

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

18 Citations (Scopus)

329 Downloads (Pure)

Abstract

This work is a significant stage of the project, "Digital Arithmetic Public-Key Cryptography". It constructs a modular multiplier for use in the channel of a Residue Number System (RNS). The modular multiplier is implemented on FPGA and optimized by evaluating different versions of the Improved Barrett Algorithm. The resulting optimized multiplier is 12 bits wide and uses separated multiplication and reduction.

Original language	English
Title of host publication	2010 International Conference on Computational Intelligence and Software Engineering, CiSE 2010
Place of Publication	Piscataway, NJ
Publisher	Institute of Electrical and Electronics Engineers (IEEE)
Pages	1-4
Number of pages	4
ISBN (Print)	9781424453924
DOIs	https://doi.org/10.1109/CISE.2010.5676912
Publication status	Published - 2010
Event	2010 International Conference on Computational Intelligence and Software Engineering, CiSE 2010 - Wuhan, China Duration: 10 Dec 2010 → 12 Dec 2010

Other

Other	2010 International Conference on Computational Intelligence and Software Engineering, CiSE 2010
Country/Territory	China
City	Wuhan
Period	10/12/10 → 12/12/10

Bibliographical note

Copyright 2010 IEEE. Reprinted from 2010 International Conference on Computational Intelligence and Software Engineering (CiSE 2010) : December 10-12, 2010, Wuhan, China. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Macquarie Universityâ€™s products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

Access to Document

10.1109/CISE.2010.5676912

Publisher version (open access).pdfFinal published version, 286 KB

Cite this

@inproceedings{dff7ec4b868f43d1bdb3b9c2b9ee3745,

title = "Optimizing the improved Barrett modular multipliers for public-key cryptography",

abstract = "This work is a significant stage of the project, {"}Digital Arithmetic Public-Key Cryptography{"}. It constructs a modular multiplier for use in the channel of a Residue Number System (RNS). The modular multiplier is implemented on FPGA and optimized by evaluating different versions of the Improved Barrett Algorithm. The resulting optimized multiplier is 12 bits wide and uses separated multiplication and reduction.",

author = "Yinan Kong",

note = "Copyright 2010 IEEE. Reprinted from 2010 International Conference on Computational Intelligence and Software Engineering (CiSE 2010) : December 10-12, 2010, Wuhan, China. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Macquarie University{\^a}€{\texttrademark}s products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.; 2010 International Conference on Computational Intelligence and Software Engineering, CiSE 2010 ; Conference date: 10-12-2010 Through 12-12-2010",

year = "2010",

doi = "10.1109/CISE.2010.5676912",

language = "English",

isbn = "9781424453924",

pages = "1--4",

booktitle = "2010 International Conference on Computational Intelligence and Software Engineering, CiSE 2010",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

address = "United States",

}

Kong, Y 2010, Optimizing the improved Barrett modular multipliers for public-key cryptography. in 2010 International Conference on Computational Intelligence and Software Engineering, CiSE 2010., 5676912, Institute of Electrical and Electronics Engineers (IEEE), Piscataway, NJ, pp. 1-4, 2010 International Conference on Computational Intelligence and Software Engineering, CiSE 2010, Wuhan, China, 10/12/10. https://doi.org/10.1109/CISE.2010.5676912

Optimizing the improved Barrett modular multipliers for public-key cryptography. / Kong, Yinan.
2010 International Conference on Computational Intelligence and Software Engineering, CiSE 2010. Piscataway, NJ: Institute of Electrical and Electronics Engineers (IEEE), 2010. p. 1-4 5676912.

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

TY - GEN

T1 - Optimizing the improved Barrett modular multipliers for public-key cryptography

AU - Kong, Yinan

N1 - Copyright 2010 IEEE. Reprinted from 2010 International Conference on Computational Intelligence and Software Engineering (CiSE 2010) : December 10-12, 2010, Wuhan, China. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Macquarie Universityâ€™s products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

PY - 2010

Y1 - 2010

N2 - This work is a significant stage of the project, "Digital Arithmetic Public-Key Cryptography". It constructs a modular multiplier for use in the channel of a Residue Number System (RNS). The modular multiplier is implemented on FPGA and optimized by evaluating different versions of the Improved Barrett Algorithm. The resulting optimized multiplier is 12 bits wide and uses separated multiplication and reduction.

AB - This work is a significant stage of the project, "Digital Arithmetic Public-Key Cryptography". It constructs a modular multiplier for use in the channel of a Residue Number System (RNS). The modular multiplier is implemented on FPGA and optimized by evaluating different versions of the Improved Barrett Algorithm. The resulting optimized multiplier is 12 bits wide and uses separated multiplication and reduction.

UR - https://www.scopus.com/pages/publications/79951653984

U2 - 10.1109/CISE.2010.5676912

DO - 10.1109/CISE.2010.5676912

M3 - Conference proceeding contribution

AN - SCOPUS:79951653984

SN - 9781424453924

SP - 1

EP - 4

BT - 2010 International Conference on Computational Intelligence and Software Engineering, CiSE 2010

PB - Institute of Electrical and Electronics Engineers (IEEE)

CY - Piscataway, NJ

T2 - 2010 International Conference on Computational Intelligence and Software Engineering, CiSE 2010

Y2 - 10 December 2010 through 12 December 2010

ER -

Optimizing the improved Barrett modular multipliers for public-key cryptography

Abstract

Other

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this