The Community for Technology Leaders
Green Image
Issue No. 05 - May (2012 vol. 61)
ISSN: 0018-9340
pp: 732-737
Jithra Adikari , University of Waterloo, Waterloo
Vassil S. Dimitrov , University of Calgary, Calgary
Kimmo U. Järvinen , Aalto University of Technology, Aalto
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 \tau-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 \tau-adic nonadjacent form conversion.
Elliptic curve cryptography, Koblitz curves, integer to \tauNAF conversion, field programmable gate array, application specific integrated circuit.

J. Adikari, V. S. Dimitrov and K. U. Järvinen, "A Fast Hardware Architecture for Integer to \tauNAF Conversion for Koblitz Curves," in IEEE Transactions on Computers, vol. 61, no. , pp. 732-737, 2011.
93 ms
(Ver 3.3 (11022016))