Name
Abstract | ||
|---|---|---|
At CRYPTO 1991, Koblitz proposed the anomalous binary curves for speeding up scalar multiplication in elliptic curve cryptosystem. At CRYPTO 1997, Solinas proposed the tau-NAF method on Koblitz curves and reduced the Hamming weight of the scalar to n/3 over the field F2n. At PKC 2004, Avanzi et al combined the tau-NAF with one point halving and reduced the Hamming weight of the scalar to 2n/7. Recently, Avanzi et al improved this method by introducing the wide-double-NAF whose Hamming weight is n/4. In this paper, we propose the wide-w-NAF, which is an extension of Avanzi's wide-double-NAF, and reduce the Hamming weight to n/(w + 1). When n > 144, our method is at least 43%-56% faster than Solinas's tau-NAF method and 21%-39% faster than Avanzi's wide-double-NAF method without additional memory requirements. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/SNPD.2007.194 | SNPD (2) |
Keywords | Field | DocType |
wide-double-naf method,koblitz curves,cryptography,scalar multiplication,hamming weight,wide-w-naf method,curve fitting,point halving,elliptic curve cryptosystem,field f_2n,anomalous binary curve,tau-naf method,koblitz curve,additional memory requirement,elliptic equations | Discrete mathematics,Scalar multiplication,Computer science,Elliptic curve point multiplication,Hyperelliptic curve cryptography,Hamming weight,Elliptic curve cryptography,Jacobian curve,Hessian form of an elliptic curve,Distributed computing,Tripling-oriented Doche–Icart–Kohel curve | Conference |
Volume | ISBN | Citations |
2 | 978-0-7695-2909-7 | 0 |
PageRank | References | Authors |
0.34 | 17 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ming Li | 1 | 3 | 1.44 |
| Baodong Qin | 2 | 190 | 19.40 |
| Fanyu Kong | 3 | 251 | 21.83 |
| Daxing Li | 4 | 60 | 9.20 |