|
|
Weil pairing
Luňáčková, Radka ; Drápal, Aleš (advisor) ; Šťovíček, Jan (referee)
This work introduces fundamental and alternative definition of Weil pairing and proves their equivalence. The alternative definition is more advantageous for the purpose of computing. We assume basic knowledge of elliptic curves in the affine sense. We explain the K-rational maps and its generalization at the point at infinity, rational map. The proof of equivalence of the two mentioned definitions is based upon the Generalized Weil Reciprocity, which uses a concept of local symbol. The text follows two articles from year 1988 and 1990 written by L. Charlap, D. Robbins a R. Coley, and corrects a certain imprecision in their presentation of the alternative definition. Powered by TCPDF (www.tcpdf.org)
|
|
|
Weil pairing
Luňáčková, Radka ; Drápal, Aleš (advisor) ; Šťovíček, Jan (referee)
This work introduces fundamental and alternative definition of Weil pairing and proves their equivalence. The alternative definition is more advantageous for the purpose of computing. We assume basic knowledge of elliptic curves in the affine sense. We explain the K-rational maps and its generalization at the point at infinity, rational map. The proof of equivalence of the two mentioned definitions is based upon the Generalized Weil Reciprocity, which uses a concept of local symbol. The text follows two articles from year 1988 and 1990 written by L. Charlap, D. Robbins a R. Coley, and corrects a certain imprecision in their presentation of the alternative definition. Powered by TCPDF (www.tcpdf.org)
|
|
|
Cryptographic criteria for Boolean functions
Luňáčková, Radka ; Hojsík, Michal (advisor) ; Tůma, Jiří (referee)
The work is focused on Boolean functions. At first, it describes the ways Boolean functions are represented. Besides the representation using truth- table, vector of values and algebraic normal form which are usually shown we also show some other representations like univariate representation and trace repre- sentation. Moreover, we explain the relations among these representations. Then summary of the theory of Boolean functions is given, in order to understand important properties of Boolean functions corectly. Finally, these properties are studied, their interconnection is explained and the following cryptographic cri- teria of Boolean functions are describe: the algebraic degree, the nonlinearity, balancedness, resiliency and correlation immunity. 1
|
guest ::
