高效能低功率橢圓曲線硬體設計

High Performance, Low Power Elliptic Curve Cryptography Hardware Architecture

張智凱

指導教授 ： 黃之浩

國立清華大學/電機資訊學院/通訊工程研究所/碩士(2013年)

摘要

橢圓曲線是新定義的數學群(Group)，藉由此新定義的運算結構套用於現今加解密演算法當中，此外橢圓曲線在相同的安全性下所用的金鑰長度遠比RSA還要小，因此在學術界和業界皆投入橢圓曲線的研究，本論文會專注在橢圓曲線的純量乘法，以及其特別應用RFID，並且選用目前最有效率的演算法L pez-Dahab Montgomery scalar multiplication當作本篇論文核心，透過優化電路排程以及降低運算複雜度本論文獲得以下結果：在橢圓曲線純量乘法部分，我們使用TSMC 130nm 在GF(2^163)下，本論文設計之電路完成一次純量乘法所需的時間為6.4μs。在RFID的部分，本論文選用TSMC 180nm在GF(2^163)下，本論文設計之電路需消耗8.1μw。

關鍵字

橢圓曲線

並列摘要

Elliptic Curve Cryptography has gained much attention in recent years. It has smaller key length than RSA with the same level of security. In this thesis, we propose a high performance, low power elliptic curve cryptography processor over GF(2^163).We adopt Lopez-Dahab Montgomery scalar multiplication algorithm to avoid the inverse operation. By optimizing circuit implementation, we can obtain very competitive results. In regard to Elliptic curve cryptography, our ECC processor can complete one scalar multiplication in 6.4μs with TSMC 130 nm technology. In regard to RFID, our ECC processor consumes 8.1μw with TSMC 180 nm technology.

並列關鍵字

elliptic curve

參考文獻

[1] J. Lopez and R. Dahab, “Fast multiplication on elliptic curves over GF(2m) without precomputation,” Cryptographic Hardware and Embedded Systems (CHES), vol. 1717 of LNCS, pp. 316–327, Aug. 1999.

[2] T. Itoh, S. Tsujii, “A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases,” Information and Computation, vol. 78, pp. 171-177, Sept. 1988.

[3] H. Wu, “Bit-Parallel Finite Field Multiplier and Squarer Using Polynomial Basis,” IEEE Transactions on Computers, vol. 51, no.7, pp.750-758, July 2002.

[4] W. Tang, H. Wu and M. Ahmadi, “VLSI implementation of bit-parallel word-serial multiplier in GF(2233),” IEEE-NEWCAS Conference, pp.399 -402, June 2005.

[5] B. Ansari and M. A. Hasan, “High-Performance architecture of elliptic curve scalar multiplication,” IEEE Transactions on Computers, vol. 57, no. 11, pp. 1443-1453, Nov. 2008.