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 - 10 / 32
Na začetekNa prejšnjo stran1234Na naslednjo stranNa konec
1.
Coding theory and applications, cyclic codes
Enes Pašalić, 2013, drugo učno gradivo

Najdeno v: osebi
Ključne besede: coding theory, cyclic codes, BCH codes, Reed-Solomon codes, channel erasures
Objavljeno: 15.10.2013; Ogledov: 1353; Prenosov: 29
URL Polno besedilo (0,00 KB)
Gradivo ima več datotek! Več...

2.
3.
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: osebi
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: 1417; Prenosov: 58
URL Polno besedilo (0,00 KB)

4.
Stream ciphers
Enes Pašalić, 2013, drugo učno gradivo

Najdeno v: osebi
Ključne besede: stream ciphers, pseudo-random sequences, Boolean functions
Objavljeno: 15.10.2013; Ogledov: 1164; Prenosov: 18
URL Polno besedilo (0,00 KB)
Gradivo ima več datotek! Več...

5.
Further results on the relation between nonlinearity and resiliency for Boolean functions
Enes Pašalić, Thomas Johansson, 1999, objavljeni znanstveni prispevek na konferenci (vabljeno predavanje)

Opis: 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.
Najdeno v: osebi
Ključne besede: Boolean functions, cryptography, optimisation, search problems, stream cipher, attacks, maximum nonlinearity, search algorithm, fixed resiliency
Objavljeno: 15.10.2013; Ogledov: 1218; Prenosov: 55
URL Polno besedilo (0,00 KB)

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

Najdeno v: osebi
Ključne besede: multiple Boolean function, bent function, cryptology
Objavljeno: 15.10.2013; Ogledov: 918; Prenosov: 11
URL Polno besedilo (0,00 KB)

7.
Collisions for variants of the BLAKE hash function
Janoš Vidali, Peter Nose, Enes Pašalić, 2010, izvirni znanstveni članek

Najdeno v: osebi
Ključne besede: BLAKE, BLOKE, BRAKE, collision, cryptography, fixed point, hash functions
Objavljeno: 15.10.2013; Ogledov: 1419; Prenosov: 21
URL Polno besedilo (0,00 KB)

8.
On cryptographically significant mappings over GF(2 [sup] n)
Enes Pašalić, 2008, objavljeni znanstveni prispevek na konferenci

Opis: In this paper we investigate the algebraic properties of important cryptographic primitives called substitution boxes (S-boxes). An S-box is a mapping that takes ▫$n$▫ binary inputs whose image is a binary ▫$m$▫-tuple; therefore it is represented as ▫$F:\text{GF}(2)^n \rightarrow \text{GF}(2)^m$▫. One of the most important cryptographic applications is the case ▫$n = m$▫, thus the S-box may be viewed as a function over ▫$\text{GF}(2^n)$▫. We show that certain classes of functions over ▫$\text{GF}(2^n)$▫ do not possess a cryptographic property known as APN (AlmostPerfect Nonlinear) permutations. On the other hand, when ▫$n$▫ is odd, an infinite class of APN permutations may be derived in a recursive manner, that is starting with a specific APN permutation on ▫$\text{GF}(2^k), k$▫ odd, APN permutations are derived over ▫$\text{GF}(2^{k+2i})$▫ for any ▫$i \geq 1$▫. Some theoretical results related to permutation polynomials and algebraic properties of the functions in the ring ▫$\text{GF}(q)[x,y]$▫ are also presented. For sparse polynomials over the field ▫$\text{GF}(2^n)$▫, an efficient algorithm for finding low degree I/O equations is proposed.
Najdeno v: osebi
Ključne besede: cryptoanalysis, cryptography, permutation polynomials, power mappings, APN functions, S-box, CCZ-equivalence, algebraic properties
Objavljeno: 15.10.2013; Ogledov: 1266; Prenosov: 24
URL Polno besedilo (0,00 KB)

9.
Coding theory and applications, linear codes
Enes Pašalić, 2013, drugo učno gradivo

Najdeno v: osebi
Ključne besede: Shannon theory, decoding, MacWilliams identity, Reed-Muller code
Objavljeno: 15.10.2013; Ogledov: 1235; Prenosov: 28
URL Polno besedilo (0,00 KB)
Gradivo ima več datotek! Več...

10.
Selected topics in cryptography, solved exam problems
Enes Pašalić, 2013, drugo učno gradivo

Najdeno v: osebi
Ključne besede: cryptography, cipher, encryption, cryptosystem
Objavljeno: 15.10.2013; Ogledov: 1971; Prenosov: 46
URL Polno besedilo (0,00 KB)
Gradivo ima več datotek! Več...

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