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


171 - 180 / 186
Na začetekNa prejšnjo stran10111213141516171819Na naslednjo stranNa konec
171.
Sustainable development in slovenian wood science and industry
Andreja Kutnar, 2011, predavanje na tuji univerzi

Ključne besede: wood science, Slovenia
Objavljeno v RUP: 15.10.2013; Ogledov: 3620; Prenosov: 50
URL Povezava na celotno besedilo

172.
Skripta za predmet Programiranje II: koncept programskih jezikov
Iztok Savnik, 2012, drugo učno gradivo

Ključne besede: programiranje, programski jeziki
Objavljeno v RUP: 15.10.2013; Ogledov: 12049; Prenosov: 125
URL Povezava na celotno besedilo

173.
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.
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
URL Povezava na celotno besedilo

174.
175.
176.
Wood science at the University of Primorska
Andreja Kutnar, 2012, predavanje na tuji univerzi

Ključne besede: wood science, Slovenia
Objavljeno v RUP: 15.10.2013; Ogledov: 4839; Prenosov: 43
URL Povezava na celotno besedilo

177.
Maximum (weight) stable sets are sometimes easy to find
Martin Milanič, 2005, predavanje na tuji univerzi

Objavljeno v RUP: 15.10.2013; Ogledov: 3301; Prenosov: 44
URL Povezava na celotno besedilo

178.
Leonard triples and hypercubes
Štefko Miklavič, 2006, predavanje na tuji univerzi

Objavljeno v RUP: 15.10.2013; Ogledov: 2911; Prenosov: 67
URL Povezava na celotno besedilo

179.
Consistent cycles
Štefko Miklavič, 2005, predavanje na tuji univerzi

Objavljeno v RUP: 15.10.2013; Ogledov: 3137; Prenosov: 34
URL Povezava na celotno besedilo

180.
On two open problems in vertex-transitive graphs
Dragan Marušič, 2012, predavanje na tuji univerzi

Ključne besede: automorphism group
Objavljeno v RUP: 15.10.2013; Ogledov: 4084; Prenosov: 48
URL Povezava na celotno besedilo

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