TY - GEN
T1 - Secure signed radix-r recoding methods for constrained-embedded devices
AU - Han, Dong Guk
AU - Kim, Sung Kyoung
AU - Kim, Ho Won
AU - Chung, Kyo Il
AU - Lim, Jongin
PY - 2007
Y1 - 2007
N2 - This paper presents two recoding methods for a radix-r representation of a secret scalar which are resistant to SPA. These recoding methods are left-to-right so they can be interleaved with a left-to-right scalar multiplication, removing the need to store both a scalar and its recoding. Next, we show the ideas of left-to-right recoding for a radix-r representation lead to simplified recoding methods for a binary representation. In general our proposed algorithms asymptotically require additional (w + 1)-digit and w-bit of RAM in the case of width-w radix-r representation and a special case when r = 2, respectively, which is independent from the digit (bit) size n of the scalar and considerably reduces the required space comparing with previous methods which require n-digit (bit) of RAM additional memory to store the recoded scalar. Consequently, thanks to its left-to-right nature, the scalar multiplication based on it is by far more convenient with respect to memory consumption.
AB - This paper presents two recoding methods for a radix-r representation of a secret scalar which are resistant to SPA. These recoding methods are left-to-right so they can be interleaved with a left-to-right scalar multiplication, removing the need to store both a scalar and its recoding. Next, we show the ideas of left-to-right recoding for a radix-r representation lead to simplified recoding methods for a binary representation. In general our proposed algorithms asymptotically require additional (w + 1)-digit and w-bit of RAM in the case of width-w radix-r representation and a special case when r = 2, respectively, which is independent from the digit (bit) size n of the scalar and considerably reduces the required space comparing with previous methods which require n-digit (bit) of RAM additional memory to store the recoded scalar. Consequently, thanks to its left-to-right nature, the scalar multiplication based on it is by far more convenient with respect to memory consumption.
KW - Elliptic curve cryptosystems
KW - Left-to-right
KW - Pairingbased cryptosystems
KW - Right-to-left
KW - Side channel attacks
UR - http://www.scopus.com/inward/record.url?scp=37149004360&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=37149004360&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-72163-5_19
DO - 10.1007/978-3-540-72163-5_19
M3 - Conference contribution
AN - SCOPUS:37149004360
SN - 3540721592
SN - 9783540721598
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 238
EP - 253
BT - Information Security Practice and Experience - Third International Conference, ISPEC 2007, Proceedings
PB - Springer Verlag
T2 - 3rd International Conference on Information Security Practice and Experience, ISPEC 2007
Y2 - 7 May 2007 through 9 May 2007
ER -