|
|
Hardware Acceleration of Cipher Attack
Okuliar, Adam ; Slaný, Karel (referee) ; Vašíček, Zdeněk (advisor)
Hardware acceleration is often good tool to achieve significantly better performance of processing great ammount of data or of realization of parallel algoritms. Aim of this work is to demonstrate resoluts of using FPGA circuits for implementation exponentially complex algorithm. As example haschosen brute-force attack on WEP cryptographic algorithm with 40-bit long key. Goal of this work is to compare properties and performance of software and hardware implementation of choosen algorithm.
|
|
|
Searching algorithms
Ďuriš, Martin ; Šeda, Miloš (referee) ; Dvořák, Jiří (advisor)
The thesis describes and analyzes selected searching algorithms for single dimensional array. Algorithms are analyzed mathematically and graphically. Mathematical analysis is based on analysis of average amount of performed comparisons required for the final result and literature review. Graphical analysis is based on multiple examinations of selected searching methods with randomly generated single dimensional arrays. The graphs show dependency of elapsed searching time of successful and unsuccessful searching trial on the size of single dimensional array. The results establish the binary searching algorithm as the fastest one of the selected searching algorithms.
|
|
|
Image hashing using compressed sensing
Kopec, Peter ; Číka, Petr (referee) ; Rajmic, Pavel (advisor)
This thesis is devoted to the analysis and implementation of image hashing based on the article "Robust image hashing with compressed sensing and ordinal measures"[3]. Image hashing uses so-called perceptual hashing methods. These methods have great applications in computer vision science, and the properties of these methods allow us to compare the similarity of hashed images and classify these images into groups. We can use this comparison, for example, to search images on the Internet for various reasons. In the theoretical part, we will talk more about the properties of these hashing methods and describe the hashing method according to the mentioned paper, we will focus most on what is compressive sampling, saliency map and how we achieve it. In the practical part, we will prepare a test dataset using Python scripting language and implement the hashing method according to the mentioned article. Then we test this hashing method on this dataset and finally compare it with another hashing method.
|
|
|
Hardware Acceleration of Cipher Attack
Okuliar, Adam ; Slaný, Karel (referee) ; Vašíček, Zdeněk (advisor)
Hardware acceleration is often good tool to achieve significantly better performance of processing great ammount of data or of realization of parallel algoritms. Aim of this work is to demonstrate resoluts of using FPGA circuits for implementation exponentially complex algorithm. As example haschosen brute-force attack on WEP cryptographic algorithm with 40-bit long key. Goal of this work is to compare properties and performance of software and hardware implementation of choosen algorithm.
|
|
|
Searching algorithms
Ďuriš, Martin ; Šeda, Miloš (referee) ; Dvořák, Jiří (advisor)
The thesis describes and analyzes selected searching algorithms for single dimensional array. Algorithms are analyzed mathematically and graphically. Mathematical analysis is based on analysis of average amount of performed comparisons required for the final result and literature review. Graphical analysis is based on multiple examinations of selected searching methods with randomly generated single dimensional arrays. The graphs show dependency of elapsed searching time of successful and unsuccessful searching trial on the size of single dimensional array. The results establish the binary searching algorithm as the fastest one of the selected searching algorithms.
|
guest ::
