National Repository of Grey Literature 5 records found  Search took 0.01 seconds. 
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.
Laboratory exercise of attacks on HTTPS protocol
Šindler, Martin ; Číka, Petr (referee) ; Burda, Karel (advisor)
This thesis describes principles of specific HTTPS attacks and provides realization of attacks using lab environment based on VMware. Elaboration is divided to specific dedicated attacks, each part evaluates risk of vulnerability and describes the way of realization in guides for students and lector´s manuals.
Laboratory exercise of attacks on HTTPS protocol
Šindler, Martin ; Číka, Petr (referee) ; Burda, Karel (advisor)
This thesis describes principles of specific HTTPS attacks and provides realization of attacks using lab environment based on VMware. Elaboration is divided to specific dedicated attacks, each part evaluates risk of vulnerability and describes the way of realization in guides for students and lector´s manuals.
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.
Comparison of Java and Pascal potentials in finding private keys in assymetric cryptography
Reiter, Tomáš ; Tichý, Vladimír (advisor) ; Svatoš, Oleg (referee)
This document focuses on assymetric cryptography and Java and Pascal potentials in finding private keys in assymetric ciphers. The theoretical part summarizes basics and principles of some of integer factorisation algorithms. The practical part objective is to implement a factorisation algorithm in both Java and Pascal and compare their performance after a month of computing.

Interested in being notified about new results for this query?
Subscribe to the RSS feed.