Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Djurasevic, Marko"'
Boolean functions are mathematical objects with numerous applications in domains like coding theory, cryptography, and telecommunications. Finding Boolean functions with specific properties is a complex combinatorial optimization problem where the se
Externí odkaz:
http://arxiv.org/abs/2302.05890
Boolean functions are mathematical objects used in diverse domains and have been actively researched for several decades already. One domain where Boolean functions play an important role is cryptography. There, the plethora of settings one should co
Externí odkaz:
http://arxiv.org/abs/2301.08012
S-boxes are an important primitive that help cryptographic algorithms to be resilient against various attacks. The resilience against specific attacks can be connected with a certain property of an S-box, and the better the property value, the more s
Externí odkaz:
http://arxiv.org/abs/2212.04789
Finding balanced, highly nonlinear Boolean functions is a difficult problem where it is not known what nonlinearity values are possible to be reached in general. At the same time, evolutionary computation is successfully used to evolve specific Boole
Externí odkaz:
http://arxiv.org/abs/2202.08743
Evolutionary algorithms have been successfully applied to attacking Physically Unclonable Functions (PUFs). CMA-ES is recognized as the most powerful option for a type of attack called the reliability attack. While there is no reason to doubt the per
Externí odkaz:
http://arxiv.org/abs/2202.08079
Finding Boolean functions suitable for cryptographic primitives is a complex combinatorial optimization problem, since they must satisfy several properties to resist cryptanalytic attacks, and the space is very large, which grows super exponentially
Externí odkaz:
http://arxiv.org/abs/2202.08221
Combinatorial designs provide an interesting source of optimization problems. Among them, permutation codes are particularly interesting given their applications in powerline communications, flash memories, and block ciphers. This paper addresses the
Externí odkaz:
http://arxiv.org/abs/2111.13252
Autor:
Planinic, Lucija, Djurasevic, Marko, Mariot, Luca, Jakobovic, Domagoj, Picek, Stjepan, Coello, Carlos Coello
This paper investigates the influence of genotype size on evolutionary algorithms' performance. We consider genotype compression (where genotype is smaller than phenotype) and expansion (genotype is larger than phenotype) and define different strateg
Externí odkaz:
http://arxiv.org/abs/2105.11502
Autor:
Carlet, Claude, Djurasevic, Marko, Jakobovic, Domagoj, Picek, S., Bäck, Thomas, Preuss, Mike, Deutz, André, Emmerich, Michael, Wang, Hao, Doerr, Carola, Trautmann, Heike
Publikováno v:
Parallel Problem Solving from Nature – PPSN XVI
ISSUE=Part II;TITLE=Parallel Problem Solving from Nature – PPSN XVI
Parallel Problem Solving from Nature – PPSN XVI ISBN: 9783030581145
PPSN (2)
ISSUE=Part II;TITLE=Parallel Problem Solving from Nature – PPSN XVI
Parallel Problem Solving from Nature – PPSN XVI ISBN: 9783030581145
PPSN (2)
We investigate whether it is possible to evolve cryptographically strong S-boxes that have additional constraints on their structure. We investigate two scenarios: where S-boxes additionally have a specific sum of values in rows, columns, or diagonal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::460fd286d2754b19f3adee3ab0c14f00
https://www.bib.irb.hr/1084086
https://www.bib.irb.hr/1084086