prikaz prve stranice dokumenta Razvoj kripotografskih hash funkcija bez ključa
  Download
PDF 22.44 MB
master's thesis
Razvoj kripotografskih hash funkcija bez ključa
2019. urn:nbn:hr:126:866940
Šormaz, Danilo
Josip Juraj Strossmayer University of Osijek
Department of Mathematics
Chair of Pure Mathematics and Mathematics Teaching
Algebra, Analysis and Number Theory Research Group

Cite this document

Šormaz, D. (2019). Razvoj kripotografskih hash funkcija bez ključa (Master's thesis). Osijek: Josip Juraj Strossmayer University of Osijek, Department of Mathematics. Retrieved from https://urn.nsk.hr/urn:nbn:hr:126:866940

Šormaz, Danilo. "Razvoj kripotografskih hash funkcija bez ključa." Master's thesis, Josip Juraj Strossmayer University of Osijek, Department of Mathematics, 2019. https://urn.nsk.hr/urn:nbn:hr:126:866940

Šormaz, Danilo. "Razvoj kripotografskih hash funkcija bez ključa." Master's thesis, Josip Juraj Strossmayer University of Osijek, Department of Mathematics, 2019. https://urn.nsk.hr/urn:nbn:hr:126:866940

Šormaz, D. (2019). 'Razvoj kripotografskih hash funkcija bez ključa', Master's thesis, Josip Juraj Strossmayer University of Osijek, Department of Mathematics, accessed 16 November 2024, https://urn.nsk.hr/urn:nbn:hr:126:866940

Šormaz D. Razvoj kripotografskih hash funkcija bez ključa [Master's thesis]. Osijek: Josip Juraj Strossmayer University of Osijek, Department of Mathematics; 2019 [cited 2024 November 16] Available at: https://urn.nsk.hr/urn:nbn:hr:126:866940

D. Šormaz, "Razvoj kripotografskih hash funkcija bez ključa", Master's thesis, Josip Juraj Strossmayer University of Osijek, Department of Mathematics, Osijek, 2019. Available at: https://urn.nsk.hr/urn:nbn:hr:126:866940

Please login to the repository to save this object to your list.
Metadata
TitleRazvoj kripotografskih hash funkcija bez ključa
Title (english)Development of keyless cryptographic Hash functions
AuthorDanilo Šormaz
MentorIvan Matić (mentor)
Committee memberZoran Tomljanović (predsjednik povjerenstva)
Committee memberIvan Matić (član povjerenstva)
Committee memberDomagoj Ševerdija (član povjerenstva)
GranterJosip Juraj Strossmayer University of Osijek
Department of Mathematics
(Chair of Pure Mathematics and Mathematics Teaching)
(Algebra, Analysis and Number Theory Research Group)
Osijek
Defense date and country2019-03-15, Croatia
Scientific / art field,
discipline and subdiscipline		NATURAL SCIENCES
Mathematics
Abstract
U radu smo opisali funkcije koje zbog svojih svojstava zauzimaju vrlo značajno mjesto u kriptografiji, a to su hash funkcije. U prvom dijelu smo definirali jednosmjernu funkciju, budući da je jednosmjernost bitno svojstvo hash funkcija. Naveli smo svojstva kriptografske hash funkcije, kao i odnose medu njima. Pomoću rođendanskog paradoksa odnosno rođendanskog napada, objasnili smo potrebu za definiranjem minimalne duljine hash vrijednosti. Nakon toga, detaljno je opisana Merkle-D˚amgard konstrukcija hash funkcije. Naveli smo primjer koji prati sve korake konstrukcije. Nadalje, opisali smo MD4 hash funkciju, definirali njene korake konstrukcije te raspisali algoritam. Kroz primjer je objašnjena MD4 funkcija i njene specifičnosti. Nakon MD4 funkcije, opisali smo njenu nasljednu MD5 funkciju. Na kraju smo opisali SHA-1 funkciju, njenu konstrukciju te smo naveli primjer hashiranja pomoću SHA-1 funkcije. Opisano je trenutno sigurnosno stanje SHA-1 funkcije i izvršavanje prvog napada kolizijom u praksi.
Abstract (english)
In this paper we described functions which takes very important place in cryptography because of their properties, and we call them hash functions. We defined one way function since one-way property is an essential feature of hash functions. We have specified the properties of hash functions as well as relationships between them. With the birthday paradox and the birthday attack we have explained the need to define the minimum length of hash values. After that, the Merkle-D˚amgard construction has been described in detail. We have mentioned an example that follows all constuction steps. Furthemore, we described the MD4 has function, indicated its construction steps, and wrote down algorithm. Through the example, MD4 function and its specifics are explained. After the MD4 function, we described its successor, MD5 function. Finally, we described the SHA-1 function, its construction, and we provided an example of the hashing using the SHA-1 function. The current state of the SHA-1 function and te first collision attack in practice are described.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:126:866940
Study programmeTitle: Mathematics; specializations in: Financial and Statistical Mathematics, Mathematics and Computer Science, Industrial and Applied Mathematics
Course: Financial and Statistical Mathematics
Study programme type: university
Study level: graduate
Academic / professional title: magistar/magistra matematike (magistar/magistra matematike)
Type of resourceText
File originBorn digital
Access conditionsOpen access
Terms of useLicence In copyright icon
Created on2019-03-21 07:12:50