橢圓曲線密碼處理器之有效率設計

AN EFFICIENT DESIGN OF ELLIPTIC CURVE CRYPTOGRAPHY PROCESSOR

謝其緯(Chi-Wei Shieh)

指導教授 ： 汪順祥

大同大學/電機資訊學院/通訊工程研究所/碩士(2006年)

摘要

由於近年來無線通訊以及網際網路的快速且蓬勃的發展，使得通訊安全顯得格外重要。如果無法提供一個安全的通訊環境，則無線通訊以及網際網路的應用，如：網路購物、網路銀行，將會受到限制。在此篇論文中，我們提出一個修改過的快速不相鄰表示轉換法（on-the-fly non- adjacent-form　conversion），以及在2163有限場下的一個較有效率的橢圓曲線乘法處理器。此處理器的運算時間為155265個計數器時間，且可以抵抗時間攻擊法（timing attack）。

關鍵字

橢圓曲線密碼

並列摘要

In the recent, wireless communication and global network bave been broadly developed, so the security of communication is very important. If there is no secure environment, the applications, like E-commerce system and Internet Commercial Bank, will be limited. In this thesis, we devise a modified on-the-fly non-adjacent-form (NAF) conversion without look-up-table and propose an efficient Elliptic curve cryptography (ECC) processor over GF(2163) which is resistant to timing attacks. It is shown that the delay of our processor is 155265 clock cycles For the case of GF(2163).

並列關鍵字

ELLIPTIC CURVE CRYPTOGRAPHY

參考文獻

[1] W. Stallings, Cryptography and Network Security: Principles and Practice, 1999.

[2] A. Hodjat, D. D. Hwang, I. Verbauwhede “A scalable and high performance elliptic curve processor with resistance to timing attacks,” ITCC. vol. 1, pp. 538 – 543, April 2005.

[5] A. Satoh and K. Takan, “A Scalable Dual-Field Elliptic Curve Cryptographic Processor,” IEEE Transactions on Computers, vol 52, pp. 449 – 460, April 2003.

[6] J. Lopez and R. Dahab, “Improved Algorithms for Elliptic Curve Arithmetic in GF(2n),” Lecture Notes In Computer Science, vol. 1556, pp. 201 – 212, 1998.

[7] N. Koblitz, “Elliptic curve cryptosystems,” Mathematics of Computation, vol. 48, pp. 203-209, 1987.