prikaz prve stranice dokumenta Savršena sigurnost u kriptografiji
  Download
PDF 242.64 KB
master's thesis
Savršena sigurnost u kriptografiji
Zagreb: University of Zagreb, Faculty of Science, 2022. urn:nbn:hr:217:205982
Majin, Ena
University of Zagreb
Faculty of Science
Department of Mathematics

Institutional repository: Repository of the Faculty of Science

Cite this document

Majin, E. (2022). Savršena sigurnost u kriptografiji (Master's thesis). Zagreb: University of Zagreb, Faculty of Science. Retrieved from https://urn.nsk.hr/urn:nbn:hr:217:205982

Majin, Ena. "Savršena sigurnost u kriptografiji." Master's thesis, University of Zagreb, Faculty of Science, 2022. https://urn.nsk.hr/urn:nbn:hr:217:205982

Majin, Ena. "Savršena sigurnost u kriptografiji." Master's thesis, University of Zagreb, Faculty of Science, 2022. https://urn.nsk.hr/urn:nbn:hr:217:205982

Majin, E. (2022). 'Savršena sigurnost u kriptografiji', Master's thesis, University of Zagreb, Faculty of Science, accessed 04 November 2024, https://urn.nsk.hr/urn:nbn:hr:217:205982

Majin E. Savršena sigurnost u kriptografiji [Master's thesis]. Zagreb: University of Zagreb, Faculty of Science; 2022 [cited 2024 November 04] Available at: https://urn.nsk.hr/urn:nbn:hr:217:205982

E. Majin, "Savršena sigurnost u kriptografiji", Master's thesis, University of Zagreb, Faculty of Science, Zagreb, 2022. Available at: https://urn.nsk.hr/urn:nbn:hr:217:205982

Metadata
TitleSavršena sigurnost u kriptografiji
Title (english)Perfect security in cryptography
AuthorEna Majin
MentorAndrej Dujella (mentor)
Committee memberAndrej Dujella (predsjednik povjerenstva)
Committee memberGoranka Nogo (član povjerenstva)
Committee memberMiljenko Marušić (član povjerenstva)
Committee memberTina Bosner (član povjerenstva)
GranterUniversity of Zagreb
Faculty of Science
(Department of Mathematics)
Zagreb
Defense date and country2022-09-27, Croatia
Scientific / art field,
discipline and subdiscipline		NATURAL SCIENCES
Mathematics
Abstract
U ovom radu je detaljno objašnjena savršena sigurnost kriptosustava. Dan je primjer kriptosustava koji nije savršeno siguran te je definiran i prikazan jedan savršeno siguran kriptosustav, Vernamova jednokratna bilježnica. Iskazan je i dokazan Shannonov teorem o nužnim i dovoljnim uvjetima savršene sigurnosti kriptosustava. Definirani su pojmovi entropije, uvjetne entropije i višeznačnosti ključa uz popratne primjere za razumijevanje. Na kraju je pojam entropije povezan sa savršenom sigurnosti.
Abstract (english)
This thesis explains perfect secrecy of cryptosystems in detail. It gives an example of a cryptosystem that is not perfectly secret, and it defines and shows a cryptosystem that is perfectly secret - Vernam cipher known as one-time pad. Shannon’s theorem about necessary and sufficient conditions for perfectly secret cryptosystems is stated and proven in the thesis. Terms of entropy, conditional entropy and key equivocation are introduced with supporting examples for better understanding. In the end, the thesis explains the connection of entropy and perfect secrecy.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:217:205982
Study programmeTitle: Computer Science and Mathematics
Study programme type: university
Study level: graduate
Academic / professional title: magistar/magistra računarstva i matematike (magistar/magistra računarstva i matematike)
Type of resourceText
File originBorn digital
Access conditionsOpen access
Embargo expiration date: 2024-10-28
Terms of useLicence In copyright icon
Created on2022-10-28 11:52:35