Lupa

Iskanje po repozitoriju Pomoč

A- | A+ | Natisni
Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


1 - 4 / 4
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
1.
Almost fully optimized infinite classes of Boolean functions resistant to (fast) algebraic cryptanalysis
Enes 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.
Najdeno v: ključnih besedah
Povzetek najdenega: ...iterative concatenation method towards construction of Boolean functions resistant to algebraic cryptanalysis are investigated. The...
Ključne besede: algebraic cryptoanalysis, fast algebraic attacks, algebraic immunity, annihilators, algebraic attack resistant, high degree product, stream ciphers, Boolean function
Objavljeno: 15.10.2013; Ogledov: 1489; Prenosov: 66
URL Polno besedilo (0,00 KB)

2.
Finite structures in cryptology
Enes Pašalić, 2013, predavanje na tuji univerzi

Najdeno v: ključnih besedah
Povzetek najdenega: ...multiple Boolean function, bent function, cryptology, ...
Ključne besede: multiple Boolean function, bent function, cryptology
Objavljeno: 15.10.2013; Ogledov: 1021; Prenosov: 12
URL Polno besedilo (0,00 KB)

3.
Linear separation of connected dominating sets in graphs
Nina Chiarelli, Martin Milanič, 2019, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ...minimal separator, 1-Sperner hypergraph, threshold hypergraph, threshold Boolean function...
Ključne besede: connected dominating set, connected domination, connected-domishold graph, forbidden induced subgraph characterization, split graph, chordal graph, minimal cutset, minimal separator, 1-Sperner hypergraph, threshold hypergraph, threshold Boolean function
Objavljeno: 04.04.2019; Ogledov: 336; Prenosov: 97
URL Polno besedilo (0,00 KB)

4.
On certain properties of APN and AB functions
Amar Bapić, 2019, magistrsko delo

Najdeno v: ključnih besedah
Povzetek najdenega: ... Boolean function, APN function, AB function...
Ključne besede: Boolean function, APN function, AB function
Objavljeno: 25.07.2019; Ogledov: 214; Prenosov: 10
URL Polno besedilo (0,00 KB)

Iskanje izvedeno v 0 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici