11. Single muscle fibre contractile properties differ between body-builders, power athletes and control subjectsJ. P. Meijer, R. T. Jaspers, Joern Rittweger, Olivier Seynnes, S. Kamandulis, M. Brazaitis, A. Skurvydas, Rado Pišot, Boštjan Šimunič, Marco Vincenzo Narici, Hans Degens, 2015, izvirni znanstveni članek Ključne besede: skeletal muscles, muscle fibers, contractile properties, body-builders, power athletes Objavljeno v RUP: 08.08.2016; Ogledov: 4210; Prenosov: 196 Povezava na celotno besedilo |
12. |
13. Peak power output test on a rowing ergometer - a methodological studyBoris Metikoš, Pavle Mikulić, Nejc Šarabon, Goran Marković, 2015, izvirni znanstveni članek Ključne besede: vadba celega telesa, mišična moč, zanesljivost, veljavnost, whole-body exercise, muscle power, reliability, validity Objavljeno v RUP: 15.10.2015; Ogledov: 5957; Prenosov: 235 Povezava na celotno besedilo |
14. 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: 3285; Prenosov: 74 Povezava na celotno besedilo |
15. |