Reconfigurable Architecture for Elliptic Curve Cryptography using Runtime Reconfiguration
Reconfigurable Architecture for Elliptic Curve Cryptography using Runtime Reconfiguration |
||
 |
 |
|
| © 2025 by IJETT Journal | ||
| Volume-73 Issue-5 |
||
| Year of Publication : 2025 | ||
| Author : Pravin Zode, Pradnya Zode, Pankaj Joshi, Sudhanshu Maurya, Nilesh Shelke |
||
| DOI : 10.14445/22315381/IJETT-V73I5P102 | ||
How to Cite?
Pravin Zode, Pradnya Zode, Pankaj Joshi, Sudhanshu Maurya, Nilesh Shelke, "Reconfigurable Architecture for Elliptic Curve Cryptography using Runtime Reconfiguration," International Journal of Engineering Trends and Technology, vol. 73, no. 5, pp.9-15, 2025. Crossref, https://doi.org/10.14445/22315381/IJETT-V73I5P102
Abstract
The elliptic curve is mainly used in cryptographic applications for shorter keys. This helps to increase the security level without decreasing the security level. ECC security completely depends on associated domain parameters. Day by day, the security requirements are changing, and hence, the domain parameters are also changing. Interoperability is the main issue in such changing standards. This paper presents new runtime reconfigurable hardware for such changing requirements. We have used the dynamic partial reconfiguration technique for the runtime reconfiguration of domain parameters. By changing the domain parameters, different security levels are achieved. This also helps avoid side-channel attacks and provides rigid security using programmable hardware. The proposed architecture is implemented on the Xilinx ML605 development board. The experimental results show that the area delay product of the implementation is the same and hence can be used for resource constraint environments where security is important considering other tradeoff parameters.
Keywords
Partial reconfiguration, Runtime reconfiguration, Montgomery multiplication, Elliptic curve cryptography, Public key cryptography.
References
[1] Neal Koblitz, “Elliptic Curve Cryptosystems,” Mathematics of Computation, vol. 48, no. 177, pp. 203-209, 1987.
[CrossRef] [Google Scholar] [Publisher Link]
[2] Victor S. Miller, “Use of Elliptic Curves in Cryptography,” Advances in Cryptology- CRYPTO ’85 Proceedings, Conference on the Theory and Application of Cryptographic Techniques, Santa Barbara, CA, USA, pp. 417-426, 2000.
[CrossRef] [Google Scholar] [Publisher Link]
[3] Khalid Javeed, Ali El-Moursy, and David Gregg, “EC-Crypto: Highly Efficient Area-Delay Optimized Elliptic Curve Cryptography Processor,” IEEE Access, vol. 11, pp. 56649-56662, 2023.
[CrossRef] [Google Scholar] [Publisher Link]
[4] K. Lauter, “The Advantages of Elliptic Curve Cryptography for Wireless Security,” IEEE Wireless Communications, vol. 11, no. 1, pp. 62-67, 2004.
[CrossRef] [Google Scholar] [Publisher Link]
[5] Cristina Vintilă, “Interoperability Issues Among Various IPsec Implementations,” 2010 8th International Conference on Communications, Bucharest, Romania, pp. 411-414, 2010.
[CrossRef] [Google Scholar] [Publisher Link]
[6] Junfeng Fan, and Ingrid Verbauwhede, An Updated Survey on Secure ECC Implementations: Attacks, Countermeasures and Cost, Cryptography and Security: From Theory to Applications, Springer, Berlin, Heidelberg, pp. 265-282, 2012.
[CrossRef] [Google Scholar] [Publisher Link]
[7] Sultan Alqahtani et al., “A Highly Customizable and Efficient Hardware Implementation for Parallel Matrix Inversion,” 2022 International Conference on Field-Programmable Technology, Hong Kong, pp. 1-2, 2022.
[CrossRef] [Google Scholar] [Publisher Link]
[8] Jason Cong, “From Parallelization to Customization-Challenges and Opportunities,” 2021 IEEE International Parallel and Distributed Processing Symposium, Portland, OR, USA, 2021.
[CrossRef] [Google Scholar] [Publisher Link]
[9] Santosh Ghosh, Debdeep Mukhopadhyay, and Dipanwita Roychowdhury, “Petrel: Power and Timing Attack Resistant Elliptic Curve Scalar Multiplier Based on Programmable GF(P) Arithmetic Unit,” IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 58, no. 8, pp. 1798-1812, 2011.
[CrossRef] [Google Scholar] [Publisher Link]
[10] Agustin Dominguez-Oviedo, and M. Anwar Hasan, “Error Detection and Fault Tolerance in ECSM Using Input Randomization,” IEEE Transactions on Dependable and Secure Computing, vol. 6, no. 3, pp. 175-187, 2008.
[CrossRef] [Google Scholar] [Publisher Link]
[11] M. Morales-Sandoval et al., “A Reconfigurable GF(2m) Elliptic Curve Cryptographic Coprocessor,” 2011 VII Southern Conference on Programmable Logic, Cordoba, Argentina, pp. 209-214, 2011.
[CrossRef] [Google Scholar] [Publisher Link]
[12] Marcus Bednara et al., “Reconfigurable Implementation of Elliptic Curve Crypto Algorithms,” Proceedings 16th International Parallel and Distributed Processing Symposium, Ft. Lauderdale, FL, USA, 2002.
[CrossRef] [Google Scholar] [Publisher Link]
[13] A. Hodjat, D.D. Hwang, and I. Verbauwhede, “A Scalable and High Performance Elliptic Curve Processor with Resistance to Timing Attacks,” International Conference on Information Technology: Coding and Computing (ITCC’05)-Volume II, vol. 1, pp. 538-543, 2005.
[CrossRef] [Google Scholar] [Publisher Link]
[14] Gerardo Orlando, and Christof Paar, “A High-Performance Reconfigurable Elliptic Curve Processor For GF(2m),” Cryptographic Hardware and Embedded Systems - CHES 2000: Second International Workshop Worcester, MA, USA, pp. 41-56, 2000.
[CrossRef] [Google Scholar] [Publisher Link]
[15] R.C.C. Cheung et al., “Customizable Elliptic Curve Cryptosystems,” IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 13, no. 9, pp. 1048-1059, 2005.
[CrossRef] [Google Scholar] [Publisher Link]
[16] Tim Kerins et al., “Fully Parameterizable Elliptic Curve Cryptography Processor Over GF(2m),” Field-Programmable Logic and Applications: Reconfigurable Computing Is Going Mainstream, pp. 750-759, 2002.
[CrossRef] [Google Scholar] [Publisher Link]
[17] M. Ernst et al., “A Reconfigurable System on Chip Implementation for Elliptic Curve Cryptography Over GF(2n),” Cryptographic Hardware and Embedded Systems - CHES 2002: 4th International Workshop, Redwood Shores, CA, USA, pp. 381-399, 2003.
[CrossRef] [Google Scholar] [Publisher Link]
[18] Partial Reconfiguration User Guide, UG702 (v14.5), Technical Information Portal, 2013. [Online]. Available: https://docs.amd.com/v/u/en-US/ug702
[19] Marc Joye, and Sung-Ming Yen, “The Montgomery Powering Ladder,” Cryptographic Hardware and Embedded Systems - CHES 2002: 4th International Workshop, Redwood Shores, USA, pp. 291-302, 2003.
[CrossRef] [Google Scholar] [Publisher Link]
[20] Medien Zeghid et al., “Speed/Area-Efficient ECC Processor Implementation Over GF(2m) on FPGA via Novel Algorithm-Architecture Co-Design,” IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 31, no. 8, pp. 1192-1203, 2023.
[CrossRef] [Google Scholar] [Publisher Link]
[21] Binh Kieu Do-Nguyen et al., “Multi-Functional Resource-Constrained Elliptic Curve Cryptographic Processor,” IEEE Access, vol. 11, pp. 4879-4894, 2023.
[CrossRef] [Google Scholar] [Publisher Link]
[22] Darrel Hankerson, Scott Vanstone, and Alfred J. Menezes, Guide to Elliptic Curve Cryptography, Springer New York, NY, 2004.
[CrossRef] [Google Scholar] [Publisher Link]
[23] Carlos Andres Lara-Nino, Arturo Diaz-Perez, and Miguel Morales-Sandoval, “Elliptic Curve Lightweight Cryptography: A Survey,” IEEE Access, vol. 6, pp. 72514-72550, 2018.
[CrossRef] [Google Scholar] [Publisher Link]
[24] Venkata Reddy Kolagatla et al., “A Randomized Montgomery Powering Ladder Exponentiation for Side-Channel Attack Resilient RSA and Leakage Assessment,” 2021 25th International Symposium on VLSI Design and Test (VDAT), Surat, India, pp. 1-5, 2021.
[CrossRef] [Google Scholar] [Publisher Link]
[25] Mouna Bedoui et al., “An Efficient Fault Detection Method for Elliptic Curve Scalar Multiplication Montgomery Algorithm,” 2019 IEEE International Conference on Design & Test of Integrated Micro & Nano-Systems (DTS), Gammarth, Tunisia, pp. 1-5, 2019.
[CrossRef] [Google Scholar] [Publisher Link]
[26] Ravi Kishore Kodali et al., “FPGA Implementation of Itoh-Tsujii Inversion Algorithm,” International Conference on Recent Advances and Innovations in Engineering (ICRAIE-2014), Jaipur, India, pp. 1-5, 2014.
[CrossRef] [Google Scholar] [Publisher Link]
[27] Chester Rebeiro et al., “Revisiting the Itoh-Tsujii Inversion Algorithm for FPGA Platforms,” IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 19, no. 8, pp. 1508-1512, 2011.
[CrossRef] [Google Scholar] [Publisher Link]
[28] A. Arunachalamani et al., “High Radix Design for Montgomery Multiplier in FPGA Platform,” 2023 International Conference on Recent Advances in Electrical, Electronics, Ubiquitous Communication, and Computational Intelligence (RAEEUCCI), Chennai, India, pp. 1-5, 2023.
[CrossRef] [Google Scholar] [Publisher Link]