On the Construction of Side-Channel Attack Resilient S-boxes

Lerman, Liran; Veshchikov, Nikita; Picek, Stjepan; Markowitch, Olivier

doi:10.1007/978-3-319-64647-3_7

Cited by 9 publications

(6 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Finally, we hope that our work will be followed by some interesting further research works. Among them, experiments should be performed on protected implementation and on different machine architectures [27][28][29][30][31]. The principal component analysis (PCA) could also be used to enhance our strategies [32].…”

Section: Resultsmentioning

confidence: 99%

Chosen message strategy to improve the correlation power analysis

Ouladj

Guillot

Mokrane

2019

IET Information Security

View full text Add to dashboard Cite

Section: Resultsmentioning

confidence: 99%

Chosen message strategy to improve the correlation power analysis

Ouladj

Guillot

Mokrane

2019

IET Information Security

View full text Add to dashboard Cite

“…Menyachikhin (2017) presented the spectral-linear and spectral differential techniques for constructing s-boxes consisting of near-optimal security features of s-boxes [28], wherein, they used the information from linear approximation table and differential spectrum of s-boxes to improve the properties of resulting s-boxes. Lerman et al are assisted by genetic algorithms in the generation of side-channel attacks robust s-boxes of small dimensions [29]. Martínez-Díaz works with local search algorithms to evolve s-boxes with improved side-channel resistivity having good values of nonlinearity [30].…”

Section: Related Workmentioning

confidence: 99%

“…Appendix A. Some Substitution Boxes with the Best Nonlinearity Achieved S 5 ={7, 12,21,29,17,23,10,26,31,16,27,30,28,3,5,15,8,18,1,19,9,2,11,25,4,0,6,20,22,24,13, 14} S 6 ={28, 17, 1, 13, 38, 41, 46, 6, 0, 29, 53, 20, 59, 5, 24, 21, 35, 26, 61, 16, 48, 37, 58, 22, 55, 44, 39, 56, 34, 43,…”

Section: Appendix B Pseudo-code Of the Local Search Algorithmmentioning

confidence: 99%

An External Parameter Independent Novel Cost Function for Evolving Bijective Substitution-Boxes

et al. 2020

View full text Add to dashboard Cite

The property of nonlinearity has high importance for the design of strong substitution boxes. Therefore, the development of new techniques to produce substitution boxes with high values of nonlinearity is essential. Many research papers have shown that optimization algorithms are an efficient technique to obtain good solutions. However, there is no reference in the public literature showing that a heuristic method obtains optimal nonlinearity unless seeded with optimal initial solutions. Moreover, the majority of papers with the best nonlinearity reported for pseudo-random seeding of the algorithm(s) often achieve their results with the help of some cost function(s) over the Walsh–Hadamard spectrum of the substitution. In the sense, we proposed to present, in this paper, a novel external parameter independent cost function for evolving bijective s-boxes of high nonlinearity, which is highly correlated to this property. Several heuristic approaches including GaT (genetic and tree), LSA (local search algorithm), and the Hill Climbing algorithm have been investigated to assess the performance of evolved s-boxes. A performance comparison has been done to show the advantages of our new cost function, with respect to cost functions for s-boxes like Clark’s and Picek’s cost functions.

show abstract

“…We note that other considerations could be incorporated in addition to the ones mentioned in this section, such as side-channel attacks resilient criteria [29], but we believe this falls out of the scope of our research that tries to focus on natural immunity to DFA.…”

Section: Selection Of the Default Sboxesmentioning

confidence: 99%