Confused by Confusion: Systematic Evaluation of DPA Resistance of Various S-boxes

Picek, Stjepan; Papagiannopoulos, Kostas; Ege, Barış; Batina, Lejla; Jakobović, Domagoj

doi:10.1007/978-3-319-13039-2_22

Cited by 38 publications

(37 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Also, it will be interesting to precisely study how the (minimum) transparency order impacts the efficiency of attacks like the template attacks [9], the linear regression attacks [10] or the MIA [14], especially when it is combined with masking. Eventually, the (revised) notion of transparency order seems to share several similarities with the notion of confusion coefficient introduced in [12] and recently used in [23] to design DPA resistant s-boxes. A comparison analysis between the two approaches appears to be a promising subject for future research on this topic Table 2.…”

Section: Resultsmentioning

confidence: 96%

Redefining the transparency order

Chakraborty

Sarkar²,

Maitra

et al. 2016

Des. Codes Cryptogr.

View full text Add to dashboard Cite

Abstract. In this paper, we consider the multi-bit Differential Power Analysis (DPA) in the Hamming weight model. In this regard, we revisit the definition of Transparency Order (TO) from the work of Prouff (FSE 2005) and find that the definition has certain limitations. Although this work has been quite well referred in the literature, surprisingly, these limitations remained unexplored for almost a decade. We analyse the definition from scratch, modify it and finally provide a definition with better insight that can theoretically capture DPA in Hamming weight model for hardware implementation with precharge logic. At the end, we confront the notion of (revised) transparency order with attack simulations in order to study to what extent the low transparency order of an s-box impacts the efficiency of a side channel attack against its processing. To the best of our knowledge, this is the first time that such a critical analysis is conducted (even considering the original notion of Prouff). It practically confirms that the transparency order is indeed related to the resistance of the s-box against side-channel attacks, but it also shows that it is not sufficient alone to directly achieve a satisfying level of security. Regarding this point, our conclusion is that the (revised) transparency order is a valuable criterion to consider when designing a cryptographic algorithm, and even if it does not preclude to also use classical countermeasures like masking or shuffling, it enables to improve their effectiveness.

show abstract

Section: Resultsmentioning

confidence: 96%

Redefining the transparency order

Chakraborty

Sarkar²,

Maitra

et al. 2016

Des. Codes Cryptogr.

View full text Add to dashboard Cite

show abstract

“…For further information about S-boxes and their cryptographic properties, we refer readers to [5,7,8].…”

Section: Experimental Setup and Resultsmentioning

confidence: 99%

“…On the other side, 8×8 size S-boxes are used when speed and security of a cipher are of primary importance; as an example consider the AES algorithm [5]. For a detailed description of relevant S-box properties, we refer the reader to [3,4,[6][7][8] In this paper we investigate the efficiency of two algorithms previously unexplored when discussing the evolution of S-boxes. Those algorithms are Cartesian Genetic Programming (CGP) and Genetic Programming (GP).…”

Section: Introductionmentioning

confidence: 99%

Cartesian Genetic Programming Approach for Generating Substitution Boxes of Different Sizes

Picek

Miller

Jakobović

et al. 2015

Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation

Self Cite

View full text Add to dashboard Cite

Substitution Boxes (S-boxes) play an important role in many modern-day cryptography algorithms. Indeed, without carefully chosen S-boxes many ciphers would be easy to break. The design of suitable S-boxes attracts a lot of attention in cryptography community. The evolutionary algorithms (EAs) community also had several attempts to evolve Sboxes with good cryptographic properties. When using EAs one usually uses permutation representation in order to preserve the bijectivity of the resulting S-boxes. In this paper we experiment with Cartesian Genetic Programming (CGP) and Genetic Programming (GP) in order to evolve bijective S-boxes of various sizes that have good cryptographic properties. Besides the standard CGP representation, we use an approach that allows CGP and GP to be mapped to the permutation encoding.

show abstract

“…Picek et al use heuristics to evolve S-boxes that have improved values of transparency order property for 8 × 8 size [20] and 4 × 4 size [21]. The same authors investigate one more measure, namely, confusion coefficient that characterizes the resilience of S-boxes against DPA attacks [22]. Evci and Kavut show the minimal affine transformation needed to change transparency order property [23].…”

Section: Related Workmentioning

confidence: 99%

“…Picek et al showed that affine transformation can be used to generate affine equivalent S-boxes that have different values of the transparency order and the confusion coefficient properties [21,22].…”

Section: Affine Equivalencementioning

confidence: 99%

Modified Transparency Order Property: Solution or Just Another Attempt

Picek

Mazumdar

Mukhopadhyay

et al. 2015

Security, Privacy, and Applied Cryptography Engineering

Self Cite

View full text Add to dashboard Cite

Abstract. S-boxes are usual targets of side-channel attacks and it is an open problem to develop design techniques for S-boxes with improved DPA resistance. One result along that line is the transparency order, a property that attempts to characterize the resilience of S-boxes against DPA attacks. Recently, it was shown there exist flaws with the original definition of transparency, which resulted in the new definition -modified transparency order. This paper develops techniques for constructions using the modified transparency as a guiding metric. For the 4 × 4 size, we significantly improve modified transparency order while remaining in the optimal classes. Experimental results are provided assuming a noisy HW leakage model to show the proposed S-boxes are more resistant than the original one of the PRESENT algorithm. We conclude with reports on 4 × 4 and 8 × 8 S-boxes where the results indicate that the modified transparency order could be a more useful metric than the transparency order. However, both measures are far from definitive solution on how to improve the DPA resistance.

show abstract

Confused by Confusion: Systematic Evaluation of DPA Resistance of Various S-boxes

Cited by 38 publications

References 31 publications

Redefining the transparency order

Redefining the transparency order

Cartesian Genetic Programming Approach for Generating Substitution Boxes of Different Sizes

Modified Transparency Order Property: Solution or Just Another Attempt

Contact Info

Product

Resources

About