prikaz prve stranice dokumenta Analiza vjerojatnosnih testova prostosti
No public access
undergraduate thesis
Analiza vjerojatnosnih testova prostosti
2017. urn:nbn:hr:168:586047
Đukić, Daniel
University of Zagreb
Faculty of Electrical Engineering and Computing

Cite this document

Đukić, D. (2017). Analiza vjerojatnosnih testova prostosti (Undergraduate thesis). Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing. Retrieved from https://urn.nsk.hr/urn:nbn:hr:168:586047

Đukić, Daniel. "Analiza vjerojatnosnih testova prostosti." Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2017. https://urn.nsk.hr/urn:nbn:hr:168:586047

Đukić, Daniel. "Analiza vjerojatnosnih testova prostosti." Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2017. https://urn.nsk.hr/urn:nbn:hr:168:586047

Đukić, D. (2017). 'Analiza vjerojatnosnih testova prostosti', Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, accessed 01 January 2025, https://urn.nsk.hr/urn:nbn:hr:168:586047

Đukić D. Analiza vjerojatnosnih testova prostosti [Undergraduate thesis]. Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing; 2017 [cited 2025 January 01] Available at: https://urn.nsk.hr/urn:nbn:hr:168:586047

D. Đukić, "Analiza vjerojatnosnih testova prostosti", Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, Zagreb, 2017. Available at: https://urn.nsk.hr/urn:nbn:hr:168:586047

Please login to the repository to save this object to your list.
Metadata
TitleAnaliza vjerojatnosnih testova prostosti
Title (english)Analysis of Probability Primality Tests
AuthorDaniel Đukić
MentorTomislav Burić (mentor)
Committee memberTomislav Burić (predsjednik povjerenstva)
Committee memberLana Horvat Dmitrović (član povjerenstva)
Committee memberLenka Mihoković (član povjerenstva)
GranterUniversity of Zagreb
Faculty of Electrical Engineering and Computing
Zagreb
Defense date and country2017-07-10, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Abstract
Prosti brojevi su temelj operacije racunalnog kriptiranja javnog klju ˇ ca. Budu ˇ ci da ´ pronalazak takvih velikih brojeva nije trivijalan, razvijeni su testovi pomocu kojih je ´ moguce determinirati prostost brojeva. U radu su prou ´ cavana dva vjerojatnostna testa ˇ prostosti, Miller-Rabinov te Solovay-Strassenov, njihove prednosti i nedostaci. Testovi su implementirani u programskom jeziku Python te je na primjerima velikih prostih brojeva pokazana njihova uspješnost.
Abstract (english)
Prime numbers are the basis of the public-key encryption operation. Since it is very hard to find very large prime numbers, various tests are developed to determine if the nubmer is prime or not. In this thesis are analyzed two probability primality tests, Miller-Rabin and Solovay-Strassen, their advantages and disadvantages. Tests are implemented in programming language Python. On the examples of large prime numbers is shown efficiency of the tests.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:168:586047
Study programmeTitle: Computing
Study programme type: university
Study level: undergraduate
Academic / professional title: sveučilišni/a prvostupnik/ prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka računarstva (sveučilišni/a prvostupnik/ prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka računarstva)
Type of resourceText
File originBorn digital
Access conditionsClosed access
Terms of useLicence In copyright icon
Public note
Created on2019-03-13 20:07:35