Abstract
Elliptic Curve Cryptography is gaining popularity, and optimization opportunities exist on several different levels: algorithm, architecture, and/or implementation. To support a wide variety of curves and at the same time resist timing/power-based side-channel attacks, our scalar multiplication is implemented using the Co-Z ladder due to Hutter, Joye, and Sierra. We analyze the parallelism of the Co-Z ladder and show that a 12-core (though inefficient) system can complete a ladder step with the fastest speed. We also combine optimizations at every level in an efficient multi-core FPGA implementation. The size of the prime modulus can also be changed easily, for which we have implemented and tested up to 528-bits used in the NIST P-521 curve. Based on this building block, we have developed a multi-core architecture that supports multiple parallel modular additions, multiplications, and inverses.
Original language | English |
---|---|
Title of host publication | Cryptology and Network Security - 15th International Conference, CANS 2016, Proceedings |
Editors | Giuseppe Persiano, Sara Foresti |
Publisher | Springer Verlag |
Pages | 637-647 |
Number of pages | 11 |
ISBN (Print) | 9783319489643 |
DOIs | |
State | Published - 2016 |
Externally published | Yes |
Event | 15th International Conference on Cryptology and Network Security, CANS 2016 - Milan, Italy Duration: 14 11 2016 → 16 11 2016 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 10052 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 15th International Conference on Cryptology and Network Security, CANS 2016 |
---|---|
Country/Territory | Italy |
City | Milan |
Period | 14/11/16 → 16/11/16 |
Bibliographical note
Publisher Copyright:© Springer International Publishing AG 2016.
Keywords
- Co-Z
- ECC
- FPGA
- Montgomery reduction
- Multi-core