National Repository of Grey Literature 17 records found  previous11 - 17  jump to record: Search took 0.00 seconds. 
On DSA
Čadová, Veronika ; Drápal, Aleš (advisor) ; Jedlička, Přemysl (referee)
This thesis deals with problems of comparing the safety and running time of digital signatures DSA and Schnorr. Digital signature is almost full, legally recognized alternative to physical sign, intended for use in a digital environment. Digital signature uses asymmetric codes and hash functions which are easily described, as well as other basic concepts such as discrete logarithm and cyclic groups. The thesis deals with the analysis of possible attacks on DSA and compares DSA and Schnorr algorithm. Digital signature history and its implementation is part of the thesis.
On DSA
Čadová, Veronika ; Drápal, Aleš (advisor) ; Jedlička, Přemysl (referee)
This thesis deals with problems of comparing the safety and running time of digital signatures DSA and Schnorr. Digital signature is almost full, legally recognized alternative to physical sign, intended for use in a digital environment. Digital signature uses asymmetric codes and hash functions which are easily described, as well as other basic concepts such as discrete logarithm and cyclic groups. The thesis deals with the analysis of possible attacks on DSA and compares DSA and Schnorr algorithm. Digital signature history and its implementation is part of the thesis.
Safe Cryptography Algorithms
Zbránek, Lukáš ; Schäfer, Jiří (referee) ; Chmelař, Petr (advisor)
In this thesis there is description of cryptographic algorithms. Their properties are being compared, weak and strong points and right usage of particular algorithms. The main topics are safeness of algorithms, their bugs and improvements and difficulty of breaching. As a complement to ciphers there are also hash functions taken in consideration. There are also showed the most common methods of cryptanalysis. As a practical application of described algorithms I analyze systems for secure data transfer SSH and SSL/TLS and demonstrate an attack on SSL connection. In conclusion there is recommendation of safe algorithms for further usage and safe parameters of SSH and SSL/TLS connections.
Duplicate Text Identification
Pekař, Tomáš ; Kouřil, Jan (referee) ; Smrž, Pavel (advisor)
The aim of this work is to design and implement a system for duplicate text identification. The application should be able to index documents and also searching documents at index. In our work we deal with preprocessing documents, their fragmentation and indexing. Furthermore we analyze methods for duplicate text identification, that are also linked with strategies for selecting substrings. The thesis includes a description of the basic data structures that can be used to index n-grams.
Password deposition techniques in operating systems
Pavlík, Martin ; Růčka, Lukáš (referee) ; Hajný, Jan (advisor)
This master thesis deals with ways to store passwords in current operating systems. Specifically, this work focuses on Windows, Linux, BSD and OS X. These systems are examined for ways of hashing passwords and on resistance of resulting hashes against various attacks. First (theoretical) section describes the procedures and algorithms that are needed for user authentication. This part also describes methods of hash storing. At the end of the theoretical part are generally described some possible attacks against hash functions. In second (practical) part is described and tested tools for obtaining hashes of the investigated operating systems. Subsequently practical attacks were conducted against obtained hashes by using appropriate tools. Furthermore there are presented results of the attacks. In the conclusion of the work there is a comparison of tools and methods which were used to obtain plaintext passwords from operating systems.
Hash functions - characteristics, implementation and collisions
Karásek, Jan ; Sobotka, Jiří (referee) ; Lambertová, Petra (advisor)
Hash functions belong to elements of modern cryptography. Their task is to transfer the data expected on the entry into a unique bite sequence. Hash functions are used in many application areas, such as message integrity verification, information authentication, and are used in cryptographic protocols, to compare data and other applications. The goal of the master’s thesis is to characterize hash functions to describe their basic characteristics and use. Next task was to focus on one hash function, in particular MD5, and describe it properly. That means, to describe its construction, safety and possible attacks on this function. The last task was to implement this function and collisions. The introductory chapters describe the basic definition of hash function, the properties of the function. The chapters mention the methods preventing collisions and the areas were the hash functions are used. Further chapters are focused on the characteristics of various types of hash functions. These types include basic hash functions built on basic bit operations, perfect hash functions and cryptographic hash functions. After concluding the characteristics of hash functions, I devoted to practical matters. The thesis describes the basic appearance and control of the program and its individual functions which are explained theoretically. The following text describes the function MD5, its construction, safety risks and implementation. The last chapter refers to attacks on hash functions and describes the hash function tunneling method, brute force attack and dictionary attack.
Cryptographic hash function
Čejka, Petr ; Ivánek, Jiří (advisor) ; Palovský, Radomír (referee)
The goal of this thesis is to create overview about cryptographic hash fiction. In the first part is explained what general hash function is with its use. Follows specification of cryptographic hash function with a description of the most common construction. The next chapter is focused on application of cryptographic hash function in practice with emphasis to digital signature. After this chapter is attention paid to security. At the end are presented the most popular and the most important representatives of cryptographic hash function.

National Repository of Grey Literature : 17 records found   previous11 - 17  jump to record:
Interested in being notified about new results for this query?
Subscribe to the RSS feed.