@inproceedings{8e47e0e996564a6fae34f856c4bd82ce,

title = "Koblitz curves and integer equivalents of frobenius expansions",

abstract = "Scalar multiplication on Koblitz curves can be very efficient due to the elimination of point doublings. Modular reduction of scalars is commonly performed to reduce the length of expansions, and τ-adic Non-Adjacent Form (NAF) can be used to reduce the density. However, such modular reduction can be costly. An alternative to this approach is to use a random τ-adic NAF, but some cryptosystems (e.g. ECDSA) require both the integer and the scalar multiple. This paper presents an efficient method for computing integer equivalents of random τ-adic expansions. The hardware implications are explored, and an efficient hardware implementation is presented. The results suggest significant computational efficiency gains over previously documented methods.",

keywords = "Digital signatures, Elliptic curve cryptography, Koblitz curves",

author = "Brumley, {Billy Bob} and Kimmo J{\"a}rvinen",

year = "2007",

month = dec,

day = "1",

language = "English",

isbn = "3540773592",

series = "Lecture Notes in Computer Science",

pages = "126--137",

booktitle = "Selected Areas in Cryptography - 14th International Workshop, SAC 2007, Revised Selected Papers",

note = "14th International Workshop on Selected Areas in Cryptography, SAC 2007 ; Conference date: 16-08-2007 Through 17-08-2007",

}