Secure signed radix-r recoding methods for constrained-embedded devices

Dong Guk Han, Sung Kyoung Kim, Ho Won Kim, Kyo Il Chung, Jong In Lim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages238-253
Number of pages16
Volume4464 LNCS
Publication statusPublished - 2007 Dec 20
Event3rd International Conference on Information Security Practice and Experience, ISPEC 2007 - Hong Kong, Hong Kong
Duration: 2007 May 72007 May 9

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4464 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other3rd International Conference on Information Security Practice and Experience, ISPEC 2007
CountryHong Kong
CityHong Kong
Period07/5/707/5/9

Fingerprint

Signed
Digit
Scalar
Random access storage
Equipment and Supplies
Scalar multiplication
Data storage equipment
Binary

Keywords

  • Elliptic curve cryptosystems
  • Left-to-right
  • Pairingbased cryptosystems
  • Right-to-left
  • Side channel attacks

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Han, D. G., Kim, S. K., Kim, H. W., Chung, K. I., & Lim, J. I. (2007). Secure signed radix-r recoding methods for constrained-embedded devices. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4464 LNCS, pp. 238-253). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4464 LNCS).

Secure signed radix-r recoding methods for constrained-embedded devices. / Han, Dong Guk; Kim, Sung Kyoung; Kim, Ho Won; Chung, Kyo Il; Lim, Jong In.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4464 LNCS 2007. p. 238-253 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4464 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Han, DG, Kim, SK, Kim, HW, Chung, KI & Lim, JI 2007, Secure signed radix-r recoding methods for constrained-embedded devices. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 4464 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4464 LNCS, pp. 238-253, 3rd International Conference on Information Security Practice and Experience, ISPEC 2007, Hong Kong, Hong Kong, 07/5/7.
Han DG, Kim SK, Kim HW, Chung KI, Lim JI. Secure signed radix-r recoding methods for constrained-embedded devices. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4464 LNCS. 2007. p. 238-253. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Han, Dong Guk ; Kim, Sung Kyoung ; Kim, Ho Won ; Chung, Kyo Il ; Lim, Jong In. / Secure signed radix-r recoding methods for constrained-embedded devices. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4464 LNCS 2007. pp. 238-253 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{667f2d7317ef4d598ae93db736f30828,
title = "Secure signed radix-r recoding methods for constrained-embedded devices",
abstract = "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.",
keywords = "Elliptic curve cryptosystems, Left-to-right, Pairingbased cryptosystems, Right-to-left, Side channel attacks",
author = "Han, {Dong Guk} and Kim, {Sung Kyoung} and Kim, {Ho Won} and Chung, {Kyo Il} and Lim, {Jong In}",
year = "2007",
month = "12",
day = "20",
language = "English",
isbn = "3540721592",
volume = "4464 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "238--253",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

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, Jong In

PY - 2007/12/20

Y1 - 2007/12/20

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

M3 - Conference contribution

SN - 3540721592

SN - 9783540721598

VL - 4464 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 238

EP - 253

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -