|
|
Banschewského funkce na komplementárních modulárních svazech
Mokriš, Samuel ; Růžička, Pavel (advisor) ; Žemlička, Jan (referee)
Title: Banaschewski function on countable complemented modular lattices Author: Samuel Mokriš Department: Department of Algebra Supervisor of the bachelor thesis: Mgr. Pavel Růžička, Ph.D., Department of Algebra Abstract: A Banaschewski function on a bounded lattice L is an antitone self-map on L that picks a complement for each element of L. On any at most countable complemented modular lattice L, there exists a Banaschewski function with a Boolean range M. Moreover, such M is a maximal Boolean sublattice of L and is uniquely determined up to isomorphism. In the thesis we give a negative answer to the related question whether all maximal Boolean sublattices in an arbitrary countable complemented modular lattice are isomorphic and whether every max- imal Boolean sublattice in an arbitrary countable complemented modular lattice L is the range of some Banaschewski function on L. We also generalize the coun- terexample to greater cardinalities; for a given infinite cardinal κ we construct a complemented modular lattice L of cardinality κ and maximal Boolean sublat- tices B and E of L such that B is not the range of any Banaschewski function on L, that there exists a Banaschewski function on L of range E, and that B is not isomorphic to E. Keywords: complemented modular lattice, Banaschewski function, von...
|
|
|
Compressing Pseudorandom sequences
Vald, Denis ; Holub, Štěpán (advisor) ; Růžička, Pavel (referee)
Generators of pseudorandom sequences are widely used objects, not in the least place because of their application in stream ciphers. One of the ways to improve resistance to different types of attack is to use compression on the generated sequence in order to remove redundant information, that might lead to an attack against the generator. In this work we try to explore from a wider perspective the theoretical foundations for compressing pseudorandom sequences created thus far. Using this general view we will examine some known attacks against the PRN generators and look for a way to resist such attacks.
|
|
|
Abelian regular rings
Vejnar, Benjamin ; Žemlička, Jan (advisor) ; Růžička, Pavel (referee)
Na/ev praco: Abelovsky regularni okruhy Autor: Benjamin Vejnar Katedra (listav): Katedra algebry VcdoLici bakalafske prace: Mgr. Jan 2emlicka, Ph.D. E-mail vedouctho: Jan.Zcmlicka&mJJ. cuni.cz Abstrakt: V pfcdloxene praci studujeme aritmeticke a strukturni vlastnosti abelovsky regularnich okruhu, tedy okruhu, jcjichx ka/xly levy i pravy konecne generova.ny ideal jo generovan idempotentnim prvkem, klery Ic/i v centra danoho okruhu. Napfiklad ka/,dy Boohmv okruh je abelovsky regularni. Venujume ye podininkam, ktere uplne diarakterizuji tn'du abelovsky regu- larnieli okruhu, jako napfiklad silna regularita. Vsimame si souvislosti mexi Booleovou algebrou vsch centralnich idempo1,entu daneho okruhu a hlavnimi idealy. Dale popiHUJeme topologit na nmo/ine visecli prvoidealu a avcdoniujeine si, '/e splyva s Lo])ologii ultrafiltrii na Booleove algebre idciiipotontd. Klicova slova: okruhy, idempoteiitni prvky, silne regularni okruhy Title: Abelian regular rings Author: Benjamin Vejnar Department: Department of Algebra Supervisor: Mgr. Jan Zemlieka, Ph.D. Supervisor's e-mail address: Jan.Zc:ttilicka((})'niff.cu'iii.cz Abstract: In the present work we study arithmetic and structural properties of abelian regular' rings. This means rings whose every left and right finitely generated ideal is generated by an idempotent...
|
|
|
Searching optimal strategies for the number field sieve
Perůtka, Lukáš ; Drápal, Aleš (advisor) ; Růžička, Pavel (referee)
In this work we study the number field sieve algorithm. Our main focus is on its theoretical background. We present all important theorems which are needed for a full understanding of the algorithm. We also describe the most widely used implementation of the parts of the algorithm and we discuss in which situation they should be used. At the end we show results from measurements of sieving phase on the implementation which was written for our Department of Algebra.
|
|
| |
|
| |
|
| |
|
|
Cryptographic schemes based on the discrete logarithm problem
Kadlček, Tomáš ; Holub, Štěpán (advisor) ; Růžička, Pavel (referee)
In the paper we try to give a view of the discrete logarithm problem, especially of related problems that appear in literature since 2001. These problems are based on a computation of Weil and Tate pairing on eliptic curves. We give a view of these problems including some reductions. We mention some chosen schemes based on these problems that are iteresting because of their practical parametrs, primaci of security proofs or because these schemes introduced the new problem. We try to cover precisely the most important definitions in this sector of cryptography because these definition are omitted in the literature and it is often left up to reader to presume details by himself.
|
|
| |
|
|
Multivariate cryptography
Jančaříková, Irena ; Žemlička, Jan (advisor) ; Růžička, Pavel (referee)
This thesis deals with multivariate cryptography. It includes specifically a description of the MQ problem and the proof of it's NP-completness. In the part of the MQ problem there is a description of a general pattern for the creation of the public part of asymetric cryptosystems based on the MQ problem. It this part the thesis describes the QMLE problem, which is important for the figure of the cryptosystem private key based on the MQ problem. Further, the thesis includes a description of the influence of the structure display, which appears in the QMLE problem, on time solution complexity of QMLE problem. The influence of time complexity has been detected by means of experimental measurement with programed algorithm. At the end of the thesis there is specified description of selected multivariety cryptosystems based on the MQ problem. Selected cryptosystems are provided with detailed description of encryption and decryption by means of selected cryptosystems and time estimations of these operations. The thesis includes estimations of memory requirements on saving of private and public key of the selected cryptosystems. Powered by TCPDF (www.tcpdf.org)
|
guest ::
RSS feed.