|
|
Cryptography and modern cryptographic algorithms
Orság, Dominik ; Dobrovský, Ladislav (referee) ; Nevoral, Tomáš (advisor)
The goal of this bachelor thesis is to provide a comprehensive overview of the historical development of cryptography as well as important cryptographic methods of today. The theoretical section begins with an exploration of fundamental concepts and the historical progression of cryptographic algorithms. This is followed by a descroption of modern symmetric and asymmetric algorithms. The greatest attention is paid to the RSA algorithm and its implementation in the Python language.
|
|
|
Possibilities of data analysis from CAN bus
Krišková, Mahulena ; Pančík, Juraj (referee) ; Belák, Michal (advisor)
This Master’s thesis covers possibilities of data collection and data analysis from CAN. Historical background and current trends are described as well as the principle of operation. The aim of this thesis was to provide several methods of data reading and subsequently their possible ways of interpretation for purposes of Forensic Engineering, more precisely, in the terms of vehicle driving dynamics. Owing to the fact the messages on the CAN bus are themselves encoded, one is unable to read them without further decryption. However, the possibilities of decoding are limited. Individual methods of data reading, collection, and analysis are presented. The analysis is focused on the process of data collection form CAN bus and data decryption. From several software options, one was selected as a tool for experimental part.
|
|
|
Comparison of public key cryptography algorithms
Mareš, Jiří ; Stanovský, David (advisor) ; Žemlička, Jan (referee)
In the present work we study comparison of basic public key encryption algorithms - RSA, Rabin and ElGamel method. We derive theoretic complexity of encrypting / decrypting of one block and we derive an expected model of its behavior with the key of double size. We also take practical measurements of speed of each algorithm using keys sized 64 - 4096 bits and we statistically analyze the results. We also mention special cases of some algorithms and discuss the advantages and disadvantages of their practical usage. At the end of this thesis we make a comparison of the speed of algorithms and we also compare the measured data with theoretical hypothesis.
|
|
|
Web application for file encryption
Tatar, Martin ; Blažek, Petr (referee) ; Zeman, Václav (advisor)
The bachelor thesis is focused on developing a web application for file encryption. In the theoretical part symmetric encryption algorithms are divided into block ciphers and stream ciphers. Selected ciphers are described and their properties are compared. Then the modes of operation for block ciphers are described. The developed application encrypts both files and text inputs by the selected algorithm and can operate in various modes of operation. In addition to this functionality the application is supplemented with descriptions of available ciphers and modes of operation.
|
|
|
Post-quantum cryptography on constrained devices
Matula, Lukáš ; Dzurenda, Petr (referee) ; Malina, Lukáš (advisor)
In recent years, there has been a lot of technological development, which among other things, brings the designs and implementation of quantum computing. Using Shor’s algorithm for quantum computing, it is highly likely that the mathematical problems, which underlie the cryptographic systems, will be computed in polynomial time. Therefore, it is necessary to pay attention to the development of post-quantum cryptography, which is able to secure systems against quantum attacks. This work includes the summary and the comparison of different types of post-quantum cryptography, followed by measuring and analysing its levels of difficulty in order to implement them into limited devices, such as smart cards. The measured values on the PC are used to determine the most suitable implementation on the circuit card and then the verification method itself is implemented on it.
|
|
|
Is Information On Secure Hard Disk Drive Only
Yours?
Arm, Jakub
This paper focuses on security of information saved on hard disk drives using encryption. The posibilities of information protection are outlined. Security of using AES cipher algorithm is discussed and some possible attacks are described. Regarding these attacks, some of them are serious threat, for instance, side channel attacks. Some possibilities how to avoid these attacks are demonstrated. Cipher filesystem, as the file cipher tool, is also presented. Among them, EncFS is introduced in greater detail and its use on cloud server is pointed out.
|
|
|
Design and implementation of Twofish cipher on the FPGA network card
Cíbik, Peter ; Martinásek, Zdeněk (referee) ; Smékal, David (advisor)
This bachelor thesis deals with implementation of block cipher Twofish on the FPGA platform in VHDL language. The teoretical introduction explains basics of cryptography and symetric ciphers block operation modes, FPGA platform and introduction to VHDL language. In the next part the Twofish cipher, its components and flow are being dis- cussed in depth. Subsequently describes design of Twofish cipher in VHDL language and induvidual steps in this process. The last part deals with own implementation on hardware card with FPGA chip and summarizes reached goals.
|
|
|
Simulation of cryptographic algorithms using FPGA
Németh, František ; Mašek, Jan (referee) ; Smékal, David (advisor)
Bachelor thesis is dealing with a cipher standard AES and with a design of encryption and decryption components for AES in special modes of operation. Programming language is VHDL. In theoretical part of thesis is a further descriptions of AES and behaviour of block cipher operation modes. Furthermore the brief description of VHDL, FPGA and NetCOPE framework is a piece of theoretical part as well. The practical part contains designs which are made in developing environment Vivado from Xilinx. Programmed modes of operation are ECB, CBC, CTR and CFB. Simulation outputs and synthesis results are summerized in tables.
|
|
|
Comparison of public key cryptography algorithms
Mareš, Jiří ; Stanovský, David (advisor) ; Žemlička, Jan (referee)
In the present work we study comparison of basic public key encryption algorithms - RSA, Rabin and ElGamel method. We derive theoretic complexity of encrypting / decrypting of one block and we derive an expected model of its behavior with the key of double size. We also take practical measurements of speed of each algorithm using keys sized 64 - 4096 bits and we statistically analyze the results. We also mention special cases of some algorithms and discuss the advantages and disadvantages of their practical usage. At the end of this thesis we make a comparison of the speed of algorithms and we also compare the measured data with theoretical hypothesis.
|
|
|
Automatization of MitM Attack for SSL/TLS Decryption
Marušic, Marek ; Lichtner, Ondrej (referee) ; Pluskal, Jan (advisor)
SSL/TLS are protocols used to encrypt network traffic. They provide secure communication between clients and servers. The communication can be intercepted with MitM attack. This paper is aimed to describe the automatization of MitM attack and demonstrate its results. The automatization is done by MitM probe and a python script, which configures the probe and starts the attack. The script is easy to use, without great effort. It takes care of configuration of the probe, then it starts the tools used for network traffic capture and at last it starts MitM tools to perform the attack. During the MitM attack, users are warned by client applications about insecure connection. The client applications either provide an option to establish a connection anyway or it forbids clients to establish the connection with insecure parameters. In this paper, the users can learn what are SSL/TLS protocols and about a possibility how to intercept the network traffic encrypted by these protocols.
|
guest ::
