1. |
2. |
3. |
4. Mali Princ - primerjava prevodov v angleščini in slovenščini z izvirnim tekstom : diplomsko deloKarin Podlipnik Bukovnik, 2014, undergraduate thesis Keywords: traduction, littérature de jeunesse, Le Petit Prince, le text canonique, le conte fantastique, les méthodes de traduction, les types de traduction, l'équivalence Published in RUP: 10.07.2015; Views: 5244; Downloads: 88 Full text (10,71 MB) |
5. Vidiki in strategije prevajanja turističnih besedil : primer Slovenia.infoJanja Zorko, 2014, undergraduate thesis Keywords: translation, translations strategies, non-equivalence, tourist texts, cultural specificities, Slovene, English, Slovenia.info Published in RUP: 10.07.2015; Views: 4348; Downloads: 78 Full text (238,15 KB) |
6. 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. Keywords: cryptoanalysis, cryptography, permutation polynomials, power mappings, APN functions, S-box, CCZ-equivalence, algebraic properties Published in RUP: 15.10.2013; Views: 3641; Downloads: 75 Link to full text |