Abstract
Vuillaume-Okeya presented unsigned recoding methods for protecting modular exponentiations against side channel attacks, which are suitable for tamper-resistant implementations of RSA or DSA which does not benefit from cheap inversions. This paper describes new recoding methods for producing SPA-resistant unsigned representations which are scanned from left to right (i.e., from the most significant digit to the least significant digit) contrary to the previous ones. Our contributions are as follows; (1) SPAresistant unsigned left-to-right recoding with general width-w, (2) special case when w = 1, i.e., unsigned binary representation using the digit set {1,2}. These methods reduce the memory required to perform the modular exponentiation gk.
| Original language | English |
|---|---|
| Title of host publication | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Pages | 286-295 |
| Number of pages | 10 |
| Volume | 4610 LNCS |
| Publication status | Published - 2007 Dec 1 |
| Event | 4th International Conference on Autonomic and Trusted Computing: Bringing Safe, Self-x and Organic Computing Systems into Reality, ATC 2007 - Hong Kong, China Duration: 2007 Jul 11 → 2011 Jul 13 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 4610 LNCS |
| ISSN (Print) | 03029743 |
| ISSN (Electronic) | 16113349 |
Other
| Other | 4th International Conference on Autonomic and Trusted Computing: Bringing Safe, Self-x and Organic Computing Systems into Reality, ATC 2007 |
|---|---|
| Country | China |
| City | Hong Kong |
| Period | 07/7/11 → 11/7/13 |
Fingerprint
ASJC Scopus subject areas
- Computer Science(all)
- Biochemistry, Genetics and Molecular Biology(all)
- Theoretical Computer Science
Cite this
SPA countermeasure based on unsigned left-to-right recodings. / Kim, Sung Kyoung; Han, Dong Guk; Kim, Ho Won; Chung, Kyo I L; Lim, Jong In.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4610 LNCS 2007. p. 286-295 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4610 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - SPA countermeasure based on unsigned left-to-right recodings
AU - Kim, Sung Kyoung
AU - Han, Dong Guk
AU - Kim, Ho Won
AU - Chung, Kyo I L
AU - Lim, Jong In
PY - 2007/12/1
Y1 - 2007/12/1
N2 - Vuillaume-Okeya presented unsigned recoding methods for protecting modular exponentiations against side channel attacks, which are suitable for tamper-resistant implementations of RSA or DSA which does not benefit from cheap inversions. This paper describes new recoding methods for producing SPA-resistant unsigned representations which are scanned from left to right (i.e., from the most significant digit to the least significant digit) contrary to the previous ones. Our contributions are as follows; (1) SPAresistant unsigned left-to-right recoding with general width-w, (2) special case when w = 1, i.e., unsigned binary representation using the digit set {1,2}. These methods reduce the memory required to perform the modular exponentiation gk.
AB - Vuillaume-Okeya presented unsigned recoding methods for protecting modular exponentiations against side channel attacks, which are suitable for tamper-resistant implementations of RSA or DSA which does not benefit from cheap inversions. This paper describes new recoding methods for producing SPA-resistant unsigned representations which are scanned from left to right (i.e., from the most significant digit to the least significant digit) contrary to the previous ones. Our contributions are as follows; (1) SPAresistant unsigned left-to-right recoding with general width-w, (2) special case when w = 1, i.e., unsigned binary representation using the digit set {1,2}. These methods reduce the memory required to perform the modular exponentiation gk.
UR - http://www.scopus.com/inward/record.url?scp=38049003526&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=38049003526&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:38049003526
SN - 9783540735465
VL - 4610 LNCS
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 286
EP - 295
BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ER -