|
|
Collection of Sensor Data into Cloud
Záhorský, Matej ; Musil, Petr (referee) ; Nosko, Svetozár (advisor)
Primárnym účelom tejto práce je zber dát z vybraných senzorov do vzdialeného Cloudu prostredníctvom platformy STM32MP1. V prvej časti práce je popísaná teória ohľadom možností zberu dát, ich kryptografického zabezpečenia a funkcie daného mikrokontroléra. V druhej časti je navrhnuté a implementované vhodné softvérové riešenie pre efektívne a bezpečné zbieranie dát z vybraných senzorov. Na koniec sú vyhodnotené vlastnosti riešenia, čo zahrňuje i rýchlosť kryptografického podpisovania v reálnej aplikácií.
|
|
|
Asymmetric Cryptography on FPGA
Dobiáš, Patrik ; Smékal, David (referee) ; Malina, Lukáš (advisor)
This bachelor thesis deals with the analysis of existing hardware implementations of asymmetric cryptographic schemes on the FPGA platform and the then implementation of the cryptographic scheme Ed25519 on this platform. The resulting implementation is described in detail and compared with existing implementations. At the end of this work, the deployment of this implementation on the Virtex UltraScale+ FPGA is described.
|
|
|
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.
|
|
|
Efektivní aritmetika eliptických křivek nad konečnými tělesy
Skalický, Jakub ; Krhovják, Jan (advisor) ; Drápal, Aleš (referee)
The thesis deals with arithmetics of elliptic curves over finite fields and methods to improve those calculations. In the first part, algebraic geometry helps to define elliptic curves and derive their basic properties including the group law. The second chapter seeks ways to speed up these calculations by means of time-memory tradeoff, i.e. adding redundancy. At last, the third part introduces a wholly new curve form, which is particularly effective for such purposes.
|
|
|
Efektivní aritmetika eliptických křivek nad konečnými tělesy
Skalický, Jakub ; Krhovják, Jan (advisor) ; Drápal, Aleš (referee)
The thesis deals with arithmetics of elliptic curves over finite fields and methods to improve those calculations. In the first part, algebraic geometry helps to define elliptic curves and derive their basic properties including the group law. The second chapter seeks ways to speed up these calculations by means of time-memory tradeoff, i.e. adding redundancy. At last, the third part introduces a wholly new curve form, which is particularly effective for such purposes.
|
|
|
Cryptocurrency
Šelinga, Martin ; Komosný, Dan (referee) ; Zeman, Václav (advisor)
In this bachelor thesis are analyzed elementary cryptographical techniques which are used among others also in cryptocurrencies. In second part is analysis and detail description of most used cryptocurrencies. In last part is description of simple web application which will demonstrate function of cryptocurrencies.
|
|
|
Security of Electronic Documentation in Medical Environment
Hauserová, Markéta ; Malinka, Kamil (referee) ; Barabas, Maroš (advisor)
Thesis is analyzing czech laws which are related to medical documentation. Describes the points which are mandatory for information system, so the medical documentation can be stored electronically. Includes various algorithms for implementation of certain electronic signature and for identification of person. This thesis deals with asymmetric cryptography, specifically RSA, DSA, and ECDSA. Describes the hash functions and their functions and their characteristics. Describes the principle of the certificate, ways of its obtaining, invalidation and their formats. Analyzes medical information system and suggests ways to create a program for signing medical records. Then based on that analysis, the program is implemented. At the conclusion of the work is discussed, if created program meets the criteria.
|
|
|
NSA Suite-B Cryptography algorithms
Rybka, Štěpán ; Malina, Lukáš (referee) ; Sobotka, Jiří (advisor)
This thesis entitled Algorithms Group SuiteB NSA Cryptography deals with algorithms, which are included in the set SuiteB. They serve to increase data protection and security during their transmission over an unsecured Internet environment. It also contains analysis of these algorithms, the encryption, decryption, creating hashes, key exchange, creating a signature and its verification. The algorithms are compared with others, already obsolete, or still used. The following are protocols using these algorithms. Output from the practical part is a web presentation that can serve as a teaching material.
|
|
|
Elliptic curves in cryptography
Geyer, Lukáš ; Burda, Karel (referee) ; Lambertová, Petra (advisor)
The objective of this bachelor thesis is to decribe the role of the elliptic curves in modern cryptosystems, explain the mathematical fundamentals upon which the elliptic curves are based along with their advantages and disadvantages, followed by application in the digital signature. The project is concluded by a software solution demonstrating the use of elliptic curves in digital signature scheme ECDSA
|
|
|
Software support of education in cryptography area based on elliptic curves
Szturc, Jakub ; Sobotka, Jiří (referee) ; Burda, Karel (advisor)
The master‘s thesis is focusing on cryptography based on elliptical curves consists of four main parts. The first part provides an overview of the basic cryptographic and mathematical concepts. A key element of this work is the second part which are described in detail the mechanisms of counting two points on elliptic curve and counting point to themselves over the various fields. On this mechanism is based almost the entire issue. In the third section provides the best-known algorithms and protocols for key exchange, encryption and digital signature. The goal of this paper is to devise software to support teaching. This material is created as a web presentation, which described the theoretical foundations and the main characteristics of cryptosystems based on elliptical curves. The whole issue is supported by practical examples of calculations examples, there are also examples for independent work. Additionally, java applets are prepared that allow an interactive opportunity to try the basic parameters of curves, or verify the calculations.
|
guest ::
