On using genetic algorithms for intrinsic side-channel resistance

Picek, Stjepan; Ege, Barış; Batina, Lejla; Jakobović, Domagoj; Chmielewski, Łukasz; Golub, Marin

doi:10.1145/2556315.2556319

Cited by 34 publications

(19 citation statements)

References 23 publications

(32 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…One year later, Prouff presents the transparency order property which is the first DPA-related property for the multi-bit case [7]. The idea proved to be valuable, as in 2012 several papers revisit the topic [11][12][13]15]. Apart from the transparency-related efforts, a new line of research by Yunsi Fei et al [9,10,19,20] attempts to actually model the behavior of a cryptographic implementation with respect to side-channel resistance.…”

Section: Related Workmentioning

confidence: 99%

“…Currently, the properties related with SCA are SNR (DPA) [6], transparency order [7], criterion for the S-box resilience against CPA attacks [8] and the most recent measure, confusion coefficient [9,10]. Considering the transparency order, which was heavily investigated so far, results from different groups are somewhat conflicting [11][12][13]. Yet in all previous works the transparency order seems to have a certain influence on DPA resistance.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

Picek

Papagiannopoulos

Ege

et al. 2014

Progress in Cryptology -- INDOCRYPT 2014

Self Cite

View full text Add to dashboard Cite

Abstract. When studying the DPA resistance of S-boxes, the research community is divided in their opinions on what properties should be considered. So far, there exist only a few properties that aim at expressing the resilience of S-boxes to side-channel attacks. Recently, the confusion coefficient property was defined with the intention to characterize the resistance of an S-box. However, there exist no experimental results or methods for creating S-boxes with a "good" confusion coefficient property. In this paper, we employ a novel heuristic technique to generate S-boxes with "better" values of the confusion coefficient in terms of improving their side-channel resistance. We conduct extensive side-channel analysis and detect S-boxes that exhibit previously unseen behavior. For the 4 × 4 size we find S-boxes that belong to optimal classes, but they exhibit linear behavior when running a CPA attack, therefore preventing an attacker from achieving 100% success rate on recovering the key.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

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

Picek

Papagiannopoulos

Ege

et al. 2014

Progress in Cryptology -- INDOCRYPT 2014

Self Cite

View full text Add to dashboard Cite

show abstract

“…[1]'de, bir S-kutusunun FGA dayanıklılıgı saydamlık derecesi (SD) kavramı ortaya konularak nicelleştirilmiş ve bu ölçütün geçerliligi SASEBO-GII kartı [2][3][4] ve ATmega163 akıllı kart [5,6] gibi kriptografik cihazlar üzerinde uygulanan birçok implementasyon ile dogrulanmıştır.…”

Section: Introductionunclassified

“…Döngüsel simetrik S-kutuları (DSSK) sınıfına bakıldıgında ise dogrusal olmama, farksal birbiçimlilik ve SD arasında daha iyi bir denge elde edilmiştir [4]. Bahsedilen bu sonuçlar, en dik iniş prensibine dayalı özyineli arama [8] ve genetik [5] algoritmalar gibi sezgisel arama yöntemleri kullanılarak dikkate deger birşekilde geliştirilmiştir. Bu aramaların tümü boyutu 8 olan S-kutuları için yürütüldügünden karşılık gelen arama uzayları çok büyük-tür (bütün arama uzayının büyüklügü ≈ 2 1684 , DSSK sınıfı için arama uzayının büyüklügü ≈ 2 208.3 ).…”

Section: Introductionunclassified

Düşük Saydamlık Derecesine Sahip Küçük Büyüklükte S-kutuları

Kavut¹

2017

SDÜ Fen Bil Enst Der

View full text Add to dashboard Cite

Özet: Farksal güç analizine (FGA) kendiliginden dayanıklı S-kutularının inşası kriptografide önemli bir problemdir. Prouff tarafından 2004'te ortaya konuldugundan itibaren bir S-kutusunun saydamlık derecesi (SD), FGA karşısında önemli bir gösterge olarak yaygın biçimde kullanılmaktadır. Bu çalışmada ilk olarak, bir S-kutusunun SD'sini degiştirmeyen bazı afin dönüşümler saglanmakta ve bu sonuca dayanarak afin eşdeger olan bütün S-kutuları arasından en düşük SD'yi başaran S-kutularını elde etmek için verimli bir tüketici arama stratejisi verilmektedir.İyi bilinen yapıların boyutu ≤ 6 olan durumları için arama stratejimiz başarıyla uygulanmış ve sonuçlar sunulmuştur.İkinci olarak, boyutun 6 oldugu durum için en dik iniş prensibine dayalı özyineli arama algoritması gerçekleştirilmiş ve bilinen yapılardan daha iyi SD degerleri saglarken aynı zamanda yüksek dogrusal olmama ve düşük farksal birbiçimlilige sahip S-kutuları üretilmiştir. Small Size S-boxes with Low Transparency Order Keywords Differential power analysis (DPA), S-boxes, Transparency order (TO)Abstract: Constructing S-boxes that are inherently resistant against the differential power analysis (DPA) is an important problem in cryptography. Since it was introduced by Prouff in 2004, the transparency order (TO) of an S-box has been commonly used as a significant indicator against the DPA. In this work, we fist provide some affine transformations under which the TO of an S-box remains the same, and based on this result we give an efficient exhaustive search strategy to attain the S-boxes achieving the lowest TO among all the S-boxes which are affine equivalent. For the well-known constructions in dimensions ≤ 6, we apply our search strategy successfully and present the results. Secondly, for dimension 6 we perform the steepest-descent-like iterative search algorithm and generate the S-boxes which, while providing better TOs than those of the known constructions, have high nonlineariy and low differential uniformity.

show abstract

“…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

On using genetic algorithms for intrinsic side-channel resistance

Cited by 34 publications

References 23 publications

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

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

Düşük Saydamlık Derecesine Sahip Küçük Büyüklükte S-kutuları

Cartesian Genetic Programming Approach for Generating Substitution Boxes of Different Sizes

Contact Info

Product

Resources

About