171. |
172. |
173. Almost fully optimized infinite classes of Boolean functions resistant to (fast) algebraic cryptanalysisEnes Pašalić, 2009, objavljeni znanstveni prispevek na konferenci Opis: 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.
Ključne besede: algebraic cryptoanalysis, fast algebraic attacks, algebraic immunity, annihilators, algebraic attack resistant, high degree product, stream ciphers, Boolean function
Objavljeno v RUP: 15.10.2013; Ogledov: 4123; Prenosov: 143
 Povezava na celotno besedilo |
174. |
175. Coding theory and applications, solved exercises and problems of cyclic codesEnes Pašalić, 2013, drugo učno gradivo Ključne besede: finite field, counting cyclic codes, codeword, Hamming code, Ternary Golay code, BCH code, BCH decoding, Fire code, Erasure corrections, MDS code, convolutional code
Objavljeno v RUP: 15.10.2013; Ogledov: 3690; Prenosov: 94
Povezava na celotno besedilo |
176. |
177. |
178. |
179. |
180. |
