A Fast Hardware Architecture for Integer to tauNAF Conversion for Koblitz Curves

Author

Adikari, Jithra ; Dimitrov, Vassil S. ; Järvinen, Kimmo U.

Author_Institution

Dept. of Electr. & Comput. Eng., Univ. of Waterloo, Waterloo, ON, Canada

Volume

61

Issue

5

fYear

2012

fDate

5/1/2012 12:00:00 AM

Firstpage

732

Lastpage

737

Abstract

Scalar multiplication in elliptic curve cryptography is the most computational intensive operation. Efficiency of this operation can be significantly improved in hardware implementations by using Frobenius endomorphisms which require integer to _τ-adic nonadjacent form conversion. Because conversion is one of the limiting factors in some of Koblitz curve-based cryptosystems, it has become an interesting problem. In this paper, we propose two algorithms and a novel hardware architecture to double the speed of integer to _τ-adic nonadjacent form conversion.

Keywords

computer architecture; public key cryptography; τNAF conversion; Frobenius endomorphisms; Koblitz curve-based cryptosystems; Koblitz curves; computational intensive operation; elliptic curve cryptography; hardware architecture; hardware implementations; integer to τ-adic nonadjacent form conversion; limiting factors; scalar multiplication; Adders; Algorithm design and analysis; Clocks; Computer architecture; Delay; Hardware; Logic gates; Elliptic curve cryptography; Koblitz curves; application specific integrated circuit.; field programmable gate array; integer to tauNAF conversion;

fLanguage

English

Journal_Title

Computers, IEEE Transactions on

Publisher

ieee

ISSN

0018-9340

Type

jour

DOI

10.1109/TC.2011.87

Filename

5753886