Skip to content

Constructing TI-Friendly Substitution Boxes Using Shift-Invariant Permutations

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

Standard

Constructing TI-Friendly Substitution Boxes Using Shift-Invariant Permutations. / Gao, Si; Roy, Arnab; Oswald, Elisabeth.

Topics in Cryptology – CT-RSA 2019 - The Cryptographers’ Track at the RSA Conference 2019, Proceedings. ed. / Mitsuru Matsui. Springer Verlag, 2019. p. 433-452 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11405 LNCS).

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

Harvard

Gao, S, Roy, A & Oswald, E 2019, Constructing TI-Friendly Substitution Boxes Using Shift-Invariant Permutations. in M Matsui (ed.), Topics in Cryptology – CT-RSA 2019 - The Cryptographers’ Track at the RSA Conference 2019, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11405 LNCS, Springer Verlag, pp. 433-452, Cryptographers Track at the RSA Conference 2019, CT-RSA 2019, San Francisco, United States, 4/03/19. https://doi.org/10.1007/978-3-030-12612-4_22

APA

Gao, S., Roy, A., & Oswald, E. (2019). Constructing TI-Friendly Substitution Boxes Using Shift-Invariant Permutations. In M. Matsui (Ed.), Topics in Cryptology – CT-RSA 2019 - The Cryptographers’ Track at the RSA Conference 2019, Proceedings (pp. 433-452). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11405 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-030-12612-4_22

Vancouver

Gao S, Roy A, Oswald E. Constructing TI-Friendly Substitution Boxes Using Shift-Invariant Permutations. In Matsui M, editor, Topics in Cryptology – CT-RSA 2019 - The Cryptographers’ Track at the RSA Conference 2019, Proceedings. Springer Verlag. 2019. p. 433-452. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-030-12612-4_22

Author

Gao, Si ; Roy, Arnab ; Oswald, Elisabeth. / Constructing TI-Friendly Substitution Boxes Using Shift-Invariant Permutations. Topics in Cryptology – CT-RSA 2019 - The Cryptographers’ Track at the RSA Conference 2019, Proceedings. editor / Mitsuru Matsui. Springer Verlag, 2019. pp. 433-452 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

Bibtex

@inproceedings{1add1a4c031b43c092e2fee3efd773a6,
title = "Constructing TI-Friendly Substitution Boxes Using Shift-Invariant Permutations",
abstract = "The threat posed by side channels requires ciphers that can be efficiently protected in both software and hardware against such attacks. In this paper, we proposed a novel Sbox construction based on iterations of shift-invariant quadratic permutations and linear diffusions. Owing to the selected quadratic permutations, all of our Sboxes enable uniform 3-share threshold implementations, which provide first order SCA protections without any fresh randomness. More importantly, because of the \shift-invariant{"} property, there are ample implementation trade-offs available, in software as well as hardware. We provide implementation results (software and hardware) for a four-bit and an eight-bit Sbox, which confirm that our constructions are competitive and can be easily adapted to various platforms as claimed. We have successfully verified their resistance to first order attacks based on real acquisitions. Because there are very few studies focusing on software-based threshold implementations, our software implementations might be of independent interest in this regard.",
keywords = "Sbox, Shift-invariant, Threshold implementation",
author = "Si Gao and Arnab Roy and Elisabeth Oswald",
year = "2019",
month = "2",
day = "3",
doi = "10.1007/978-3-030-12612-4_22",
language = "English",
isbn = "9783030126117",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "433--452",
editor = "Mitsuru Matsui",
booktitle = "Topics in Cryptology – CT-RSA 2019 - The Cryptographers’ Track at the RSA Conference 2019, Proceedings",
address = "Germany",

}

RIS - suitable for import to EndNote

TY - GEN

T1 - Constructing TI-Friendly Substitution Boxes Using Shift-Invariant Permutations

AU - Gao, Si

AU - Roy, Arnab

AU - Oswald, Elisabeth

PY - 2019/2/3

Y1 - 2019/2/3

N2 - The threat posed by side channels requires ciphers that can be efficiently protected in both software and hardware against such attacks. In this paper, we proposed a novel Sbox construction based on iterations of shift-invariant quadratic permutations and linear diffusions. Owing to the selected quadratic permutations, all of our Sboxes enable uniform 3-share threshold implementations, which provide first order SCA protections without any fresh randomness. More importantly, because of the \shift-invariant" property, there are ample implementation trade-offs available, in software as well as hardware. We provide implementation results (software and hardware) for a four-bit and an eight-bit Sbox, which confirm that our constructions are competitive and can be easily adapted to various platforms as claimed. We have successfully verified their resistance to first order attacks based on real acquisitions. Because there are very few studies focusing on software-based threshold implementations, our software implementations might be of independent interest in this regard.

AB - The threat posed by side channels requires ciphers that can be efficiently protected in both software and hardware against such attacks. In this paper, we proposed a novel Sbox construction based on iterations of shift-invariant quadratic permutations and linear diffusions. Owing to the selected quadratic permutations, all of our Sboxes enable uniform 3-share threshold implementations, which provide first order SCA protections without any fresh randomness. More importantly, because of the \shift-invariant" property, there are ample implementation trade-offs available, in software as well as hardware. We provide implementation results (software and hardware) for a four-bit and an eight-bit Sbox, which confirm that our constructions are competitive and can be easily adapted to various platforms as claimed. We have successfully verified their resistance to first order attacks based on real acquisitions. Because there are very few studies focusing on software-based threshold implementations, our software implementations might be of independent interest in this regard.

KW - Sbox

KW - Shift-invariant

KW - Threshold implementation

UR - http://www.scopus.com/inward/record.url?scp=85062788391&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-12612-4_22

DO - 10.1007/978-3-030-12612-4_22

M3 - Conference contribution

AN - SCOPUS:85062788391

SN - 9783030126117

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

SP - 433

EP - 452

BT - Topics in Cryptology – CT-RSA 2019 - The Cryptographers’ Track at the RSA Conference 2019, Proceedings

A2 - Matsui, Mitsuru

PB - Springer Verlag

ER -