Download
PDF 221.53 KB
undergraduate thesis
119   44
Digitalni potpis
Sanja Novaković (2016)
Josip Juraj Strossmayer University of Osijek
Department of Mathematics
Chair of Pure Mathematics
Algebra and Calculus Research Group
Cite this document

Novaković, S. (2016). Digitalni potpis (Undergraduate thesis). Retrieved from https://urn.nsk.hr/urn:nbn:hr:126:491370

Novaković, Sanja. "Digitalni potpis." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Department of Mathematics, 2016. https://urn.nsk.hr/urn:nbn:hr:126:491370

Novaković, Sanja. "Digitalni potpis." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Department of Mathematics, 2016. https://urn.nsk.hr/urn:nbn:hr:126:491370

Novaković, S. (2016). 'Digitalni potpis', Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Department of Mathematics, accessed 13 October 2019, https://urn.nsk.hr/urn:nbn:hr:126:491370

Novaković S. Digitalni potpis [Undergraduate thesis]. Osijek: Josip Juraj Strossmayer University of Osijek, Department of Mathematics; 2016 [cited 2019 October 13] Available at: https://urn.nsk.hr/urn:nbn:hr:126:491370

S. Novaković, "Digitalni potpis", Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Department of Mathematics, Osijek, 2016. Available at: https://urn.nsk.hr/urn:nbn:hr:126:491370

Metadata
TitleDigitalni potpis
AuthorSanja Novaković
MentorIvan Matić (mentor)
GranterJosip Juraj Strossmayer University of Osijek
Department of Mathematics
(Chair of Pure Mathematics)
(Algebra and Calculus Research Group)
Osijek
Defense date and country2016-07, Croatia
Scientific / art field,
discipline and subdiscipline		NATURAL SCIENCES
Mathematics
Other Mathematical Disciplines
Abstract
U ovom radu proučavamo digitalni potpis te neke od tehnika koje služe za njegovu izradu u teoriji i praksi. Najprije se dotićemo RSA algoritma koji su prvi puta javno opisali Ron Rivest, Adi Shamir i Leonard Adleman 1977. godine. To je prvi algoritam prikladan za potpisivanje i enkripciju podataka te se, pod pretpostavkom korištenja dovoljno dugih ključeva i ažurnih implementacija, smatra sigurnim. Nakon toga ćemo obraditi i Rabinovu shemu potpisa, zasnovanu na težini određživanja kvadratnih korijena modulo fiksni složeni broj. Pokazuje se da je ovaj važan problem ekvivalentan problemu faktorizacije prirodnih brojeva.
Abstract (english)
In this paper we study the digital signature, and some of the techniques serve for the development of the theory and practice. First touches on RSA algorithm for the rst time publicly described by Ron Rivest, Adi Shamir and Leonard Adleman in 1977. It is the rst algorithm suitable for signing and data encryption, assuming the use of suciently long keys and timely implementation, considered safe. We will then process and the Rabin signature scheme, based on the weight determination square root modulo a xed complex number. It turns out that this important problem equivalent to the problem of factorization of natural numbers n.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:126:491370
Study programmeTitle: University undergraduate study programme in mathematics
Study programme type: university
Study level: undergraduate
Academic / professional title: sveučilišni/a prvostupnik/prvostupnica (baccalaureus/baccalaurea) matematike (sveučilišni/a prvostupnik/prvostupnica (baccalaureus/baccalaurea) matematike)
Type of resourceText
File originBorn digital
Access conditionsOpen access
Terms of usehttp://rightsstatements.org/vocab/InC/1.0/
Created on2016-07-18 10:00:54