Constructing TI-Friendly Substitution Boxes Using Shift-Invariant Permutations

Si Gao; Arnab Roy; Elisabeth Oswald

doi:10.1007/978-3-030-12612-4_22

Constructing TI-Friendly Substitution Boxes Using Shift-Invariant Permutations

Si Gao^*, Arnab Roy, Elisabeth Oswald

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference Contribution (Conference Proceeding)

1 Citation (Scopus)

92 Downloads (Pure)

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.

Original language	English
Title of host publication	Topics in Cryptology – CT-RSA 2019 - The Cryptographers’ Track at the RSA Conference 2019, Proceedings
Editors	Mitsuru Matsui
Publisher	Springer Verlag
Pages	433-452
Number of pages	20
ISBN (Print)	9783030126117
DOIs	https://doi.org/10.1007/978-3-030-12612-4_22
Publication status	Published - 3 Feb 2019
Event	Cryptographers Track at the RSA Conference 2019, CT-RSA 2019 - San Francisco, United States Duration: 4 Mar 2019 → 8 Mar 2019

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	11405 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	Cryptographers Track at the RSA Conference 2019, CT-RSA 2019
Country	United States
City	San Francisco
Period	4/03/19 → 8/03/19

Keywords

Sbox
Shift-invariant
Threshold implementation

Access to Document

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

Full-text PDF (accepted author manuscript)
This is the accepted author manuscript (AAM). The final published version (version of record) is available online via Springer Verlag at https://doi.org/10.1007/978-3-030-12612-4_22 . Please refer to any applicable terms of use of the publisher.
Accepted author manuscript, 1.16 MBLicence: Other

Link to publication in Scopus

Fingerprint Dive into the research topics of 'Constructing TI-Friendly Substitution Boxes Using Shift-Invariant Permutations'. Together they form a unique fingerprint.

Projects

1 Active

Side channel aware software design flow

Page, D.

1/01/16 → 31/12/20

Project: Research

Cite this

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

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)).

@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 = feb,

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{\textquoteright} Track at the RSA Conference 2019, Proceedings",

address = "Germany",

note = "Cryptographers Track at the RSA Conference 2019, CT-RSA 2019 ; Conference date: 04-03-2019 Through 08-03-2019",

}

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

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 proceeding › Conference Contribution (Conference Proceeding)

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 (Conference Proceeding)

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

T2 - Cryptographers Track at the RSA Conference 2019, CT-RSA 2019

Y2 - 4 March 2019 through 8 March 2019

ER -

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