Cellular automata based S-boxes

Mariot, Luca; Picek, Stjepan; Leporati, Alberto; Jakobović, Domagoj

doi:10.1007/s12095-018-0311-8

Cited by 50 publications

(39 citation statements)

References 33 publications

(52 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This makes RCA especially interesting for the design of energyefficient computing devices since as stated by Landauer's principle [7] any irreversible logical operation implemented in hardware leads to the dissipation of heat, hence posing a physical lower bound on the miniaturization of devices based on irreversible gates. Another domain of interest is cryptography, where RCA can be used to design encryption and decryption algorithms [10].…”

Section: Introductionmentioning

confidence: 99%

An Evolutionary View on Reversible Shift-Invariant Transformations

Mariot

Picek

Jakobović

et al. 2020

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

We consider the problem of evolving a particular kind of shift-invariant transformation-namely, Reversible Cellular Automata (RCA) defined by conserved landscape rules-using GA and GP. To this end, we employ three different optimization strategies: a single-objective approach carried out with GA and GP where only the reversibility constraint of marker CA is considered, a multi-objective approach based on GP where both reversibility and the Hamming weight are taken into account, and a lexicographic approach where GP first optimizes only the reversibility property until a conserved landscape rule is obtained, and then maximizes the Hamming weight while retaining reversibility. The results are discussed in the context of three different research questions stemming from exhaustive search experiments on conserved landscape CA, which concern 1) the difficulty of the associated optimization problem for GA and GP, 2) the utility of conserved landscape CA in the domain of cryptography and reversible computing, and 3) the relationship between the reversibility property and the Hamming weight.

show abstract

Section: Introductionmentioning

confidence: 99%

An Evolutionary View on Reversible Shift-Invariant Transformations

Mariot

Picek

Jakobović

et al. 2020

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…Remark 5. It is shown that the nonlinearity of an RSSB is bounded above by the nonlinearity of f , where f is the coordinate function defining the RSSB, see [36] for more details. It can be easily checked that this property is also true for Γ f .…”

Section: B In Dimensionmentioning

confidence: 99%

Intrinsic Resiliency of S-Boxes Against Side-Channel Attacks–Best and Worst Scenarios

Carlet

Chérisey

Guilley

et al. 2021

IEEE Trans.Inform.Forensic Secur.

View full text Add to dashboard Cite

Constructing S-boxes that are inherently resistant against side-channel attacks is an important problem in cryptography. By using an optimal distinguisher under an additive Gaussian noise assumption, we clarify how a defender (resp., an attacker) can make side-channel attacks as difficult (resp., easy) as possible, in relation with the auto-correlation spectrum of Boolean functions. We then construct balanced Boolean functions that are optimal for each of these two scenarios. Generalizing the objectives for an S-box, we analyze the auto-correlation spectra of some well-known S-box constructions in dimensions at most 8 and compare their intrinsic resiliency against side-channel attacks. Finally, we perform several simulations of side-channel attacks against the aforementioned constructions, which confirm our theoretical approach.

show abstract

“…The NBCA model has been investigated in [22] for the design of S-boxes. There, the authors considered the case where the alphabet is A = F 2 , so that a NBCA corresponds to a particular kind of vectorial Boolean function defined by shift-invariant coordinate functions.…”

Section: Preliminaries On Latin Squares and Cellular Automatamentioning

confidence: 99%

Mutually orthogonal latin squares based on cellular automata

Mariot

Gadouleau

Formenti

et al. 2019

Des. Codes Cryptogr.

Self Cite

View full text Add to dashboard Cite

We investigate sets of Mutually Orthogonal Latin Squares (MOLS) generated by Cellular Automata (CA) over finite fields. After introducing how a CA defined by a bipermutive local rule of diameter d over an alphabet of q elements generates a Latin square of order q d−1 , we study the conditions under which two CA generate a pair of orthogonal Latin squares. In particular, we prove that the Latin squares induced by two Linear Bipermutive CA (LBCA) over the finite field F q are orthogonal if and only if the polynomials associated to their local rules are relatively prime. Next, we enumerate all such pairs of orthogonal Latin squares by counting the pairs of coprime monic polynomials with nonzero constant term and degree n over F q . Finally, we present a construction of MOLS generated by LBCA with irreducible polynomials and prove the maximality of the resulting sets, as well as a lower bound which is asymptotically close to their actual number.

show abstract

Cellular automata based S-boxes

Abstract: Important note To cite this publication, please use the final published version (if applicable). Please check the document version above.

Cited by 50 publications

References 33 publications

An Evolutionary View on Reversible Shift-Invariant Transformations

An Evolutionary View on Reversible Shift-Invariant Transformations

Intrinsic Resiliency of S-Boxes Against Side-Channel Attacks–Best and Worst Scenarios

Mutually orthogonal latin squares based on cellular automata

Contact Info

Product

Resources

About