A Novel and High-Performance Modular Square Scheme for Elliptic Curve Cryptography Over GF( ${p}$ )

In this brief, we present a novel and high-performance modular squaring scheme with low complexity and a small hardware area for elliptic curve cryptography over GF(<inline-formula> <tex-math notation="LaTeX">${p}$ </tex-math></inline-formula>). First, we develop a method to reduce half of partial products in a squaring operation by using the proposed same items merging and logic combination. Second, we propose the modular squaring scheme that can compress the partial products based on the method above and accomplish accumulation and reduction simultaneously. Third, we devise the implementation circuits for the proposed modular squaring scheme and then simplify the circuits by using the property of the prime number. Finally, we implement the circuits on different platform and the 0.13-<inline-formula> <tex-math notation="LaTeX">${\mu }\text{m}$ </tex-math></inline-formula> CMOS ASIC implementation demonstrates that our design can perform a 256-bit modular squaring in 0.36-<inline-formula> <tex-math notation="LaTeX">$ {\mu }\text{s}$ </tex-math></inline-formula> with 17200 gates, which achieves a desirable balance between hardware resource and performance.

[1]  Zilong Liu,et al.  An Efficient and Flexible Hardware Implementation of the Dual-Field Elliptic Curve Cryptographic Processor , 2017, IEEE Transactions on Industrial Electronics.

[2]  Mike Scott,et al.  High performance hardware support for elliptic curve cryptography over general prime field , 2017, Microprocess. Microsystems.

[3]  Oliver Chiu-sing Choy,et al.  A low power asynchronous GF(2/sup 173/) ALU for elliptic curve crypto-processor , 2003, Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03..

[4]  Hamad Alrimeih,et al.  Pipelined modular multiplier supporting multiple standard prime fields , 2014, 2014 IEEE 25th International Conference on Application-Specific Systems, Architectures and Processors.

[5]  Shuguo Li,et al.  A Modular Multiplier Implemented With Truncated Multiplication , 2018, IEEE Transactions on Circuits and Systems II: Express Briefs.

[6]  Shan Huang,et al.  Cryptographie coprocessor design for IoT sensor nodes , 2016, 2016 International SoC Design Conference (ISOCC).

[7]  Yinan Kong,et al.  High-performance elliptic curve cryptography processor over NIST prime fields , 2017, IET Comput. Digit. Tech..

[8]  Wei Li,et al.  A compact and efficient architecture for elliptic curve cryptographic processor , 2016, 2016 13th IEEE International Conference on Solid-State and Integrated Circuit Technology (ICSICT).

[9]  Xiaojun Wang,et al.  Low latency flexible FPGA implementation of point multiplication on elliptic curves over GF(p) , 2017, Int. J. Circuit Theory Appl..

[10]  Hsie-Chia Chang,et al.  A dual-field elliptic curve cryptographic processor with a radix-4 unified division unit , 2011, 2011 IEEE International Symposium of Circuits and Systems (ISCAS).

[11]  Gang Chen,et al.  A High-Performance Elliptic Curve Cryptographic Processor for General Curves Over ${\rm GF}(p)$ Based on a Systolic Arithmetic Unit , 2007, IEEE Transactions on Circuits and Systems II: Express Briefs.

[12]  Thanos Stouraitis,et al.  A High-Speed FPGA Implementation of an RSD-Based ECC Processor , 2016, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[13]  Khaled Salah,et al.  Review of Elliptic Curve Cryptography processor designs , 2015, Microprocess. Microsystems.

[14]  Xiaojun Wang,et al.  Radix-4 and radix-8 booth encoded interleaved modular multipliers over general Fp , 2014, 2014 24th International Conference on Field Programmable Logic and Applications (FPL).

[15]  Hsie-Chia Chang,et al.  An Efficient DPA Countermeasure With Randomized Montgomery Operations for DF-ECC Processor , 2012, IEEE Transactions on Circuits and Systems II: Express Briefs.