|
|
Security risks of wireless access networks
Špidla, Milan ; Hošek, Jiří (referee) ; Polívka, Michal (advisor)
Master´s thesis „Security risks of wireless access networks“ deals with wireless access networks, which are the most widespread in this time. The main target is realization of attacks wireless access networks protected by various using methods. This thesis shows main securities gaps, which originate from project this networks. These securities gaps are used for realization attacts in practical part. In the next part I took attention of network´s monitoring possibilities.
|
|
|
Software support for cryptography education
Stančík, Peter ; Vyoral, Josef (referee) ; Burda, Karel (advisor)
The main aim of this thesis was to study, choose and decribe techniques eligible for cryptography education. A pedagogically appropriate presentation for the selected techniques' principles was to be chosen. Another goal was to create an integrated modular web interface containing a calculator focused on cryptographic operations. The eligibility of techniques was assessed accordingly to the computing processes implied by these techniques and also accordingly to the ability of being presented in an illustrative way. A program simplifying calculations used in symetric and asymetric cryptography was designed and implemented. It disposes of a web interface and one of its parts is focused on steganographic techniques. On the other hand, any pedagogically appropriate presentation interconnecting this program with theoretical findings from this field was not found.
|
|
|
Library of Algorithms for Text Ciphering
Vozák, Petr ; Řezníček, Ivo (referee) ; Kubíček, Radek (advisor)
p, li { white-space: pre-wrap; } p, li { white-space: pre-wrap; } This thesis deals with text ciphering. The presented paper describes at first basic theoretical background of cryptology and basic distribution of cryptographic algorithms. Then it describes a brief history of encryption from beginning to present. Theoretical description of ciphering methods and its implementation details are discussed here. All basic types of conventional encryption algorithms and also some modern ciphering methods are included; these are substitution, transposition, steganographic or combinations encryption systems. The result of this thesis is the library of algorithms for text ciphering in Java with a sample application, which demonstrates its funcionality.
|
|
|
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.
|
|
|
Secure Transport of NetFlow Data
Ručka, Tomáš ; Halfar, Patrik (referee) ; Grégr, Matěj (advisor)
The aim of my bachalor's thesis is secure transport NetFlow data. Communication in NetFlow is not protected against unauthorized intrusion, in addition works over UDP protocol which is protocol that allows data loss. The aim of this work is to create an encrypted tunnel through which communication will take place between the exporter and collector.
|
|
|
Protection of highspeed communication systems
Smékal, David ; Martinásek, Zdeněk (referee) ; Hajný, Jan (advisor)
The diploma thesis deals with 128–bit AES data encryption and its implementation in FPGA network card using VHDL programming language. The theoretical part explains AES encryption and decryption, its individual steps and operating modes. Further was described the VHDL programming language, development environment Vivado, FPGA network card Combo–80G and configurable framework NetCOPE. The practical part is the implementation of AES–128 in VHDL. A simulation was used to eliminate errors, then the synthesis was performed. These steps were made using Vivado software. Last step of practical part was testing of synthesized firmware on COMBO–80G card. Total of 4 projects were implemented in FPGA card. Two of them were AES encryption and decryption with ECB mode and another two describe the encryption and decryption with CBC mode.
|
|
|
Design of hardware cipher module
Bayer, Tomáš ; Stančík, Peter (referee) ; Sobotka, Jiří (advisor)
This diploma’s thesis discourses the cryptographic systems and ciphers, whose function, usage and practical implementation are analysed. In the first chapter basic cryptographic terms, symmetric and asymetric cryptographic algorithms and are mentioned. Also usage and reliability are analysed. Following chapters mention substitution, transposition, block and stream ciphers, which are elementary for most cryptographic algorithms. There are also mentioned the modes, which the ciphers work in. In the fourth chapter are described the principles of some chosen cryptographic algorithms. The objective is to make clear the essence of the algorithms’ behavior. When describing some more difficult algorithms the block scheme is added. At the end of each algorithm’s description the example of practical usage is written. The chapter no. five discusses the hardware implementation. Hardware and software implementation is compared from the practical point of view. Several design instruments are described and different hardware design programming languages with their progress, advantages and disadvantages are mentioned. Chapter six discourses the hardware implementation design of chosen ciphers. Concretely the design of stream cipher with pseudo-random sequence generator is designed in VHDL and also in Matlab. As the second design was chosen the block cipher GOST, which was designed in VHDL too. Both designs were tested and verified and then the results were summarized.
|
|
|
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.
|
|
|
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.
|
|
|
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.
|
guest ::
