Name
Abstract | ||
|---|---|---|
Recently, signed-digit radix-r (r=2) representation is used to speed up the scalar multiplication of pairing based cryptosystems. One such representation is wrNAF proposed by Takagi et al. at the international conference on information security 2004 (ISC 2004). This representation is obtained from right to left. In this paper, we present a new signed-digit radix-r representation with the same average weight, that is r-1w(r-1)+1 as the wrNAF. The new representation uses the same digits as the wrNAF but has the advantage that it can be deduced using a left-to-right algorithm. Further, we show that like the wrNAF, the new representation has a minimal number of non-zero digits. Interleaved with the left-to-right scalar multiplication, the new representation can reduce both the time and space complexity of the computation compared to the right-to-left wrNAF. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.compeleceng.2008.09.007 | Computers & Electrical Engineering |
Keywords | Field | DocType |
new left-to-right minimal weight,left-to-right algorithm,left-to-right scalar multiplication,scalar multiplication,integer recoding,signed-digit radix-r,average weight,information security,non-adjacent form,signed radix- r representation,new signed-digit radix-r representation,right-to-left wrnaf,left-to-right recoding,pairing based cryptosystems,international conference,new representation,space complexity | Discrete mathematics,Non-adjacent form,Scalar multiplication,Arithmetic,Radix,Pairing,Cryptosystem,Right-to-left,Mathematics,Speedup,Computation | Journal |
Volume | Issue | ISSN |
35 | 1 | Computers and Electrical Engineering |
Citations | PageRank | References |
2 | 0.41 | 20 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Baodong Qin | 1 | 190 | 19.40 |
| Ming Li | 2 | 3 | 1.44 |
| Fanyu Kong | 3 | 251 | 21.83 |
| Daxing Li | 4 | 60 | 9.20 |