Iskanje po repozitoriju

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.
Ključne besede: Boolean functions, cryptography, optimisation, search problems, stream cipher, attacks, maximum nonlinearity, search algorithm, fixed resiliency
Objavljeno v RUP: 15.10.2013; Ogledov: 5242; Prenosov: 152
Povezava na celotno besedilo

PhD course algebraic combinatorics, computability and complexity in TEMPUS project SEE doctoral studies in mathematical sciences
Štefko Miklavič, 2011, predavanje na tuji univerzi

Ključne besede: algebraic combinatorics, computability, complexity
Objavljeno v RUP: 15.10.2013; Ogledov: 4293; Prenosov: 79
Povezava na celotno besedilo

Hamilton cycles and paths in vertex-transitive graphs
Klavdija Kutnar, 2011, predavanje na tuji univerzi

Ključne besede: Hamilton cycles
Objavljeno v RUP: 15.10.2013; Ogledov: 4459; Prenosov: 35
Povezava na celotno besedilo

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

Ključne besede: stream ciphers, pseudo-random sequences, Boolean functions
Objavljeno v RUP: 15.10.2013; Ogledov: 5019; Prenosov: 109
Povezava na celotno besedilo

Geometric interpolation by spatial cubic rational curves
Vito Vitrih, 2012, predavanje na tuji univerzi

Objavljeno v RUP: 15.10.2013; Ogledov: 5783; Prenosov: 40
Povezava na celotno besedilo