1. Equistable graphs: conjectures, results, and connections with Boolean functionsMartin Milanič, Vadim E. Levit, Štefko Miklavič, James B. Orlin, Gábor Rudolf, D. Tankus, 2013, published scientific conference contribution abstract Found in: ključnih besedah Keywords: Boolean functions Published: 15.10.2013; Views: 1844; Downloads: 14 Full text (0,00 KB) |
2. |
3. Further results on the relation between nonlinearity and resiliency for Boolean functionsEnes Pašalić, Thomas Johansson, 1999, published scientific conference contribution (invited lecture) Abstract: 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. Found in: ključnih besedah Keywords: Boolean functions, cryptography, optimisation, search problems, stream cipher, attacks, maximum nonlinearity, search algorithm, fixed resiliency Published: 15.10.2013; Views: 1379; Downloads: 67 Full text (0,00 KB) |
4. Collisions for variants of the BLAKE hash functionJanoš Vidali, Peter Nose, Enes Pašalić, 2010, original scientific article Found in: ključnih besedah Summary of found: ...BLOKE, BRAKE, collision, cryptography, fixed point, hash functions, ... Keywords: BLAKE, BLOKE, BRAKE, collision, cryptography, fixed point, hash functions Published: 15.10.2013; Views: 1548; Downloads: 30 Full text (0,00 KB) |
5. On cryptographically significant mappings over GF(2 [sup] n)Enes Pašalić, 2008, published scientific conference contribution Abstract: 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. Found in: ključnih besedah Summary of found: ...▫$\text{GF}(2^n)$▫. We show that certain classes of functions over ▫$\text{GF}(2^n)$▫ do not possess a cryptographic... Keywords: cryptoanalysis, cryptography, permutation polynomials, power mappings, APN functions, S-box, CCZ-equivalence, algebraic properties Published: 15.10.2013; Views: 1366; Downloads: 26 Full text (0,00 KB) |
6. |
7. |
8. |
9. Advanced processing of electromyography signals in measurements of trunk postural actionsNejc Šarabon, Andrej Panjan, 2015, published scientific conference contribution abstract Found in: ključnih besedah Summary of found: ...electromyography, signal processing, trunk functions, lower back pain, ... Keywords: electromyography, signal processing, trunk functions, lower back pain Published: 15.10.2015; Views: 1525; Downloads: 11 Full text (0,00 KB) |
10. Isogeometric analysis with geometrically continuous functions on two-patch geometriesBert Jüttler, Vito Vitrih, Mario Kapl, Katharina Birner, 2015, original scientific article Abstract: We study the linear space of Cs-smooth isogeometric functions defined on a multi-patch domain % % R2. We show that the construction of these functions is closely related to the concept of geometric continuity of surfaces, which has originated in geometric design. More precisely, the Cs-smoothness of isogeometric functions is found to be equivalent to geometric smoothness of the same order (Gs-smoothness) of their graph surfaces. This motivates us to call them Cs-smooth geometrically continuous isogeometric functions. We present a general framework to construct a basis and explore potential applications in isogeometric analysis. The space of C1-smooth geometrically continuous isogeometric functions on bilinearly parameterized two-patch domains is analyzed in more detail. Numerical experiments with bicubic and biquartic functions for performing L2 approximation and for solving Poisson%s equation and the biharmonic equation on two-patch geometries are presented and indicate optimal rates of convergence. Found in: ključnih besedah Keywords: izogeometrična analiza, geometrijska zveznost, geometrijsko vzezne izogeometrične funkcije, biharmonična enačba, isogeometric analysis, geometric continuity, geometrically continuous isogeometric functions, biharmonic equation, multi-patch domain Published: 15.10.2015; Views: 1260; Downloads: 103 Full text (0,00 KB) |