1. |
2. |
3. Karakterizacija posplošnih zlomljenih funkcij in nekatere druge kriptografske teme : doktorska disertacijaSamir Hodžić, 2017, doctoral dissertation Keywords: generalized bent functions, Zq-bent functions, Gray maps, (relative) difference sets, (generalized) Marioana-McFarland class, stream ciphers, filtering generator, guess and determine cryptanalysis, tap positions, (fast) algebraic attacks, algebraic immunity, derivatives, linear structures, planar mappings
Published in RUP: 09.11.2017; Views: 3416; Downloads: 63
 Link to full text |
4. Further results on the relation between nonlinearity and resiliency for Boolean functionsEnes Pašalić, Thomas Johansson, 1999, published scientific conference contribution (invited lecture) Abstract: A good design of a Boolean function used in a stream cipher requires that the function satisfies certain criteria in order to resist different attacks. In this paper we study the tradeoff between two such criteria, the nonlinearity and the resiliency. The results are twofold. Firstly, we establish the maximum nonlinearity for a fixed resiliency in certain cases. Secondly, we present a simple search algorithm for finding Boolean functions with good nonlinearity and some fixed resiliency.
Keywords: Boolean functions, cryptography, optimisation, search problems, stream cipher, attacks, maximum nonlinearity, search algorithm, fixed resiliency
Published in RUP: 15.10.2013; Views: 3718; Downloads: 135
Link to full text |
5. Almost fully optimized infinite classes of Boolean functions resistant to (fast) algebraic cryptanalysisEnes Pašalić, 2009, published scientific conference contribution Abstract: In this paper the possibilities of an iterative concatenation method towards construction of Boolean functions resistant to algebraic cryptanalysis are investigated. The notion of ▫$\mathcal{AAR}$▫ (Algebraic Attack Resistant) function is introduced as a unified measure of protection against classical algebraic attacks as well as fast algebraic attacks. Then, it is shown that functions that posses the highest resistance to fast algebraic attacks are necessarily of maximum ▫$\mathcal{AI}$▫ (Algebraic Immunity), the notion defined as a minimum degree of functions that annihilate either ▫$f$▫ or ▫$1+f$▫. More precisely, if for any non-annihilating function ▫$g$▫ of degree ▫$e$▫ an optimum degreerelation ▫$e+d \ge n$▫ is satisfied in the product ▫$fg=h$▫ (denoting ▫$deg(h)=d$▫), then the function ▫$f$▫ in ▫$n$▫ variables must have maximum ▫$\mathcal{AI}$▫, i.e. for nonzero function ▫$g$▫ the relation ▫$fg=0$▫ or ▫$(1+f)g=0$▫ implies. The presented theoretical framework allows us to iteratively construct functions with maximum ▫$\mathcal{AI}$▫ satisfying ▫$e+d=n-1$▫, thus almost optimized resistance to fast algebraic cryptanalysis. This infinite class for the first time, apart from almost optimal resistance to algebraic cryptanalysis, in addition generates the functions that possess high nonlinearity (superior to previous constructions) and maximum algebraic degree, thus unifying most of the relevant cryptographic criteria.
Keywords: algebraic cryptoanalysis, fast algebraic attacks, algebraic immunity, annihilators, algebraic attack resistant, high degree product, stream ciphers, Boolean function
Published in RUP: 15.10.2013; Views: 4083; Downloads: 143
Link to full text |
