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


1 - 10 / 12
Na začetekNa prejšnjo stran12Na naslednjo stranNa konec
Design methods for semi-bent functions
Enes Pašalić, Sugata Gangopadhyay, WeiGuo Zhang, Samed Bajrić, 2019, izvirni znanstveni članek

Opis: Semi-bent functions play an important role in the construction of orthogonal variable spreading factor codes used in code-division multiple-access (CDMA) systems as well as in certain cryptographic applications. In this article we provide several infinite classes of semi-bent functions, where each class is characterized by either a different decomposition of such a function with respect to the Walsh spectra of its subfunctions, or by the method used for its derivation. In particular, we also give the exact number of possibilities of decomposing bent functions, in a subclass of the Maiorana-McFarland class.
Ključne besede: cryptography, Boolean functions, bent functions, semi-bent functions, derivatives
Objavljeno v RUP: 19.12.2018; Ogledov: 3286; Prenosov: 171
URL Povezava na celotno besedilo

Vectorial quadratic bent functions as a product of two linearized polynomials
Samed Bajrić, 2015, objavljeni povzetek znanstvenega prispevka na konferenci

Ključne besede: cryptography, Boolean functions, CCZ inequivalence
Objavljeno v RUP: 08.08.2016; Ogledov: 2318; Prenosov: 28
URL Povezava na celotno besedilo

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

Ključne besede: cryptography, cipher, encryption, cryptosystem
Objavljeno v RUP: 15.10.2013; Ogledov: 3582; Prenosov: 123
URL Povezava na celotno besedilo

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.
Ključne besede: cryptoanalysis, cryptography, permutation polynomials, power mappings, APN functions, S-box, CCZ-equivalence, algebraic properties
Objavljeno v RUP: 15.10.2013; Ogledov: 3231; Prenosov: 74
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