prikaz prve stranice dokumenta Alogoritmi za faktorizaciju prirodnih brojeva
Access restricted to students and staff of home institution
master's thesis
Alogoritmi za faktorizaciju prirodnih brojeva
2020. urn:nbn:hr:166:109361
Landikušić, Cvita
University of Split
Faculty of Science
Department of Mathematics

Cite this document

Landikušić, C. (2020). Alogoritmi za faktorizaciju prirodnih brojeva (Master's thesis). Retrieved from https://urn.nsk.hr/urn:nbn:hr:166:109361

Landikušić, Cvita. "Alogoritmi za faktorizaciju prirodnih brojeva." Master's thesis, University of Split, Faculty of Science, 2020. https://urn.nsk.hr/urn:nbn:hr:166:109361

Landikušić, Cvita. "Alogoritmi za faktorizaciju prirodnih brojeva." Master's thesis, University of Split, Faculty of Science, 2020. https://urn.nsk.hr/urn:nbn:hr:166:109361

Landikušić, C. (2020). 'Alogoritmi za faktorizaciju prirodnih brojeva', Master's thesis, University of Split, Faculty of Science, accessed 24 March 2023, https://urn.nsk.hr/urn:nbn:hr:166:109361

Landikušić C. Alogoritmi za faktorizaciju prirodnih brojeva [Master's thesis]. Split: University of Split, Faculty of Science; 2020 [cited 2023 March 24] Available at: https://urn.nsk.hr/urn:nbn:hr:166:109361

C. Landikušić, "Alogoritmi za faktorizaciju prirodnih brojeva", Master's thesis, University of Split, Faculty of Science, Split, 2020. Available at: https://urn.nsk.hr/urn:nbn:hr:166:109361

Please login to the repository to save this object to your list.
Metadata
TitleAlogoritmi za faktorizaciju prirodnih brojeva
Title (english)Integer factorization algorithms
AuthorCvita Landikušić
MentorJurica Perić (mentor)
Committee memberJurica Perić (predsjednik povjerenstva)
Committee memberGordan Radobolja (član povjerenstva)
Committee memberIvan Jelić (član povjerenstva)
GranterUniversity of Split
Faculty of Science
(Department of Mathematics)
Split
Defense date and country2020-07-30, Croatia
Scientific / art field,
discipline and subdiscipline		NATURAL SCIENCES
Mathematics
Abstract
U ovom diplomskom radu predstavljeni su algoritmi za faktorizaciju prirodnih brojeva, od najjednostavnijeg Femratovog algoritma do naprednijih, kao što je Sito polja brojeva. Prvo poglavlje ukratko navodi osnovne pojmove potrebne za razumijevanje problema. Drugo poglavlje bavi se faktorizacijskim algoritmima eksponencijalne složenosti, a treće algoritmima subeksponencijalne složenosti.
Abstract (english)
This thesis presents integer factorization algorithms, from the simplest Fermat’s factorization algorithm to the advanced ones, such as The Number Field Sieve. The first chapter briefly presents the basic concepts needed to understand the problem. The second chapter presents factorization algorithms with exponential complexity and the third chapter deals with algorithms with subexponential complexity.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:166:109361
Study programmeTitle: Mathematics; specializations in: major in pure mathematics, major in computing, major in teaching, major in statistics and computing
Course: major in computing
Study programme type: university
Study level: graduate
Academic / professional title: magistar/magistra matematike (magistar/magistra matematike)
Type of resourceText
File originBorn digital
Access conditionsAccess restricted to students and staff of home institution
Terms of useLicence In copyright icon
Created on2021-02-02 15:35:11