| dc.contributor.advisor | Břehovský, Petr | |
| dc.contributor.author | Kopecký, Petr | |
| dc.date.accessioned | 2021-12-06T13:40:35Z | |
| dc.date.available | 2021-12-06T13:40:35Z | |
| dc.date.issued | 2012 | |
| dc.date.submitted | 2011-12-15 | |
| dc.identifier.uri | https://dspace.jcu.cz/handle/20.500.14390/23806 | |
| dc.format | 27 s. | |
| dc.format | 27 s. | |
| dc.language.iso | cze | |
| dc.publisher | Jihočeská univerzita | cze |
| dc.rights | Bez omezení | |
| dc.subject | encryption | eng |
| dc.subject | decryption | eng |
| dc.subject | Vernam's cipher | eng |
| dc.subject | One-Time Pad | eng |
| dc.subject | random numbers | eng |
| dc.title | Praktická implementace Vernamovy šifry | cze |
| dc.title.alternative | One-Time Pad Implementation | eng |
| dc.type | bakalářská práce | cze |
| dc.identifier.stag | 21585 | |
| dc.description.abstract-translated | The text is oriented to generation of random numbers of cryptographic quality and to performing statistical methods such as Diehard test to verify them. The data obtained this way are used in implementation of one-time pad for maximizing security of message encryption. The problems that may occur and need to be dealt with are also noted. The final part of the text includes suggestions for future one-time pad implementations and the final results that author came to. | eng |
| dc.date.accepted | 2012-01-19 | |
| dc.description.department | Přírodovědecká fakulta | cze |
| dc.thesis.degree-discipline | Aplikovaná informatika - specializace Bezpečnost a sítě | cze |
| dc.thesis.degree-grantor | Jihočeská univerzita. Přírodovědecká fakulta | cze |
| dc.thesis.degree-name | Bc. | |
| dc.thesis.degree-program | Aplikovaná informatika | cze |
| dc.description.grade | Dokončená práce s úspěšnou obhajobou | cze |
| dc.contributor.referee | Novák, Václav | |
