Lupa

Search the repository Help

A- | A+ | Print
Query: search in
search in
search in
search in
* old and bolonia study programme

Options:
  Reset


1 - 10 / 13
First pagePrevious page12Next pageLast page
1.
Almost fully optimized infinite classes of Boolean functions resistant to (fast) algebraic cryptanalysis
Enes Pašalić, 2009, published scientific conference contribution

Abstract: 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.
Found in: ključnih besedah
Summary of found: ...Immunity), the notion defined as a minimum degree of functions that annihilate either ▫$f$▫ or...
Keywords: algebraic cryptoanalysis, fast algebraic attacks, algebraic immunity, annihilators, algebraic attack resistant, high degree product, stream ciphers, Boolean function
Published: 15.10.2013; Views: 1500; Downloads: 67
URL Full text (0,00 KB)

2.
A note on a geometric construction of large Cayley graps of given degree and diameter
György Kiss, István Kovács, Klavdija Kutnar, János Ruff, Primož Šparl, 2008, published scientific conference contribution abstract

Found in: ključnih besedah
Summary of found: Zadetek v naslovu
Keywords: diameter-degree problem, Cayley graph, projective space
Published: 15.10.2013; Views: 1786; Downloads: 12
URL Full text (0,00 KB)

3.
A note on a geometric construction of large Cayley graps of given degree and diameter
György Kiss, István Kovács, Klavdija Kutnar, János Ruff, Primož Šparl, 2009, original scientific article

Abstract: An infinite series and some sporadic examples of large Cayley graphs with given degree and diameter are constructed. The graphs arise from arcs, caps and other objects of finite projective spaces.
Found in: ključnih besedah
Summary of found: Zadetek v naslovu
Keywords: degree, diameter problem, Moore bound, finite projective spaces
Published: 15.10.2013; Views: 1671; Downloads: 24
URL Full text (0,00 KB)
This document has more files! More...

4.
On the index of caterpillars
Francesco Belardo, Enzo M. Li Marzi, Slobodan Simić, 2008, original scientific article

Found in: ključnih besedah
Summary of found: ...eigenvalues, index, trees, caterpillars, diameter, degree sequence, ...
Keywords: eigenvalues, index, trees, caterpillars, diameter, degree sequence
Published: 15.10.2015; Views: 964; Downloads: 55
URL Full text (0,00 KB)

5.
On the spectral radius of unicyclic graphs with prescribed degree sequence
JianFeng Wang, Francesco Belardo, Enzo M. Li Marzi, Slobodan Simić, 2010, published scientific conference contribution

Found in: ključnih besedah
Summary of found: Zadetek v naslovu
Keywords: grafi, spektri, zaporedje stopenj, graphs, specters, degree sequence
Published: 15.10.2015; Views: 887; Downloads: 92
URL Full text (0,00 KB)

6.
Minimal normal subgroups of transitive permutation groups of square-free degree
Aleksander Malnič, Dragan Marušič, Edward Dobson, Lewis A. Nowitz, 2007, original scientific article

Abstract: It is shown that a minimal normal subgroup of a transitive permutation group of square-free degree in its induced action is simple and quasiprimitive, with three exceptions related to ▫$A_5$▫, ▫$A_7$▫, and PSL(2,29). Moreover, it is shown that a minimal normal subgroup of a 2-closed permutation group of square-free degree in its induced action is simple. As an almost immediate consequence, it follows that a 2-closed transitive permutation group of square-free degree contains a semiregular element of prime order, thus giving a partial affirmative answer to the conjecture that all 2-closed transitive permutation groups contain such an element (see [D. Marušic, On vertex symmetric digraphs,Discrete Math. 36 (1981) 69-81; P.J. Cameron (Ed.), Problems from the fifteenth British combinatorial conference, Discrete Math. 167/168 (1997) 605-615]).
Found in: ključnih besedah
Summary of found: Zadetek v naslovu
Keywords: mathematics, graph theory, transitive permutation group, 2-closed group, square-free degree, semiregular automorphism, vertex-transitive graph
Published: 03.04.2017; Views: 921; Downloads: 53
URL Full text (0,00 KB)

7.
Grafi struktur proteinov
Miloš Tomić, 2017, undergraduate thesis

Found in: ključnih besedah
Summary of found: ...a graph, average shortest path, average node degree, graph energy...
Keywords: proteins, amino acids, graph theory, protein graphs, radius of a graph, average shortest path, average node degree, graph energy
Published: 09.11.2017; Views: 550; Downloads: 10
URL Full text (0,00 KB)

8.
On the defect of vertex-transitive graphs of given degree and diameter
Geoffrey Exoo, Robert Jajcay, Martin Mačaj, Jozef Širan, 2019, original scientific article

Found in: ključnih besedah
Summary of found: Zadetek v naslovu
Keywords: degree, diameter, vertex-transitive
Published: 21.01.2019; Views: 323; Downloads: 91
URL Full text (0,00 KB)

9.
A dichotomy for weighted efficient dominating sets with bounded degree vertices
Andreas Brandstädt, Martin Milanič, 2019, original scientific article

Found in: ključnih besedah
Summary of found: Zadetek v naslovu
Keywords: weighted efficient domination, bounded degree vertices, k-Bounded Weighted Efficient Domination, polynomial-time algorithm, graph algorithms
Published: 21.01.2019; Views: 266; Downloads: 97
URL Full text (0,00 KB)

10.
O ekstremnih grafih z dano stopnjo in premerom/ožino
Slobodan Filipovski, 2018, doctoral dissertation

Found in: ključnih besedah
Summary of found: ...graphs, cages, excess, defect, Ramanujan graphs, selfrepeats, degree/diameter problem, spectrum, Moore graphs, asymptotic density, distance...
Keywords: adjacency matrix, antipodal graphs, cages, excess, defect, Ramanujan graphs, selfrepeats, degree/diameter problem, spectrum, Moore graphs, asymptotic density, distance matrices, Bermond and Bollobas problem
Published: 21.01.2019; Views: 539; Downloads: 0

Search done in 0 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica