prikaz prve stranice dokumenta Kriptografski algoritmi za uređaje s ograničenim resursima
  Download
PDF 2.35 MB
master's thesis
Kriptografski algoritmi za uređaje s ograničenim resursima
Zagreb: University of Zagreb, Faculty of Science, 2025. urn:nbn:hr:217:857265
Rusan, Brigita
University of Zagreb
Faculty of Science
Department of Mathematics

Institutional repository: Repository of the Faculty of Science

Cite this document

Rusan, B. (2025). Kriptografski algoritmi za uređaje s ograničenim resursima (Master's thesis). Zagreb: University of Zagreb, Faculty of Science. Retrieved from https://urn.nsk.hr/urn:nbn:hr:217:857265

Rusan, Brigita. "Kriptografski algoritmi za uređaje s ograničenim resursima." Master's thesis, University of Zagreb, Faculty of Science, 2025. https://urn.nsk.hr/urn:nbn:hr:217:857265

Rusan, Brigita. "Kriptografski algoritmi za uređaje s ograničenim resursima." Master's thesis, University of Zagreb, Faculty of Science, 2025. https://urn.nsk.hr/urn:nbn:hr:217:857265

Rusan, B. (2025). 'Kriptografski algoritmi za uređaje s ograničenim resursima', Master's thesis, University of Zagreb, Faculty of Science, accessed 22 March 2025, https://urn.nsk.hr/urn:nbn:hr:217:857265

Rusan B. Kriptografski algoritmi za uređaje s ograničenim resursima [Master's thesis]. Zagreb: University of Zagreb, Faculty of Science; 2025 [cited 2025 March 22] Available at: https://urn.nsk.hr/urn:nbn:hr:217:857265

B. Rusan, "Kriptografski algoritmi za uređaje s ograničenim resursima", Master's thesis, University of Zagreb, Faculty of Science, Zagreb, 2025. Available at: https://urn.nsk.hr/urn:nbn:hr:217:857265

Metadata
TitleKriptografski algoritmi za uređaje s ograničenim resursima
Title (english)Cryptographic algorithms for resource-constrained devices
AuthorBrigita Rusan
MentorAndrej Dujella (mentor)
Committee memberAndrej Dujella (predsjednik povjerenstva)
Committee memberMarko Horvat (član povjerenstva)
Committee memberRudi Mrazović (član povjerenstva)
Committee memberMladen Jurak (član povjerenstva)
GranterUniversity of Zagreb
Faculty of Science
(Department of Mathematics)
Zagreb
Defense date and country2025-02-27, Croatia
Scientific / art field,
discipline and subdiscipline		NATURAL SCIENCES
Mathematics
Mathematical Logic and Accounting
Abstract
Ovaj rad proučava kriptografske algoritme namijenjene uređajima s ograničenim resursima, s posebnim naglaskom na algoritme prikladne za korištenje u kontekstu Interneta stvari (IoT). Kroz analizu kriptografskih algoritama poput Present, Simon, Speck, Twine, Prince i Rectangle, može se zaključiti da svaki od njih ima svoje prednosti i nedostatke za uređaje s ograničenim resursima, posebno u IoT okruženju. Algoritmi kao što su Present i Speck, zbog svoje jednostavne strukture i optimiziranih... More tablica, idealni su za uređaje s ograničenim procesorskim kapacitetom i memorijom, nudeći dobar balans između sigurnosti i performansi. Algoritmi poput Simona i Twinea također pružaju dobar kompromis, no njihova implementacija može biti složenija, što može utjecati na učinkovitost u IoT uređajima s ograničenim resursima. Algoritmi Prince i Rectangle, koji naglašavaju energetsku učinkovitost, prikladni su za IoT uređaje koji zahtijevaju visoku energetsku učinkovitost, ali njihova složenost može otežati implementaciju. Pseudokodovi analiziranih algoritama omogućuju fleksibilnost u primjeni i prilagodbi za specifične IoT scenarije, a algoritmi poput Specka omogućuju prilagodbu ključeva i broja operacija, što ih čini prilagodljivima različitim sigurnosnim zahtjevima. Zaključno, izbor kriptografskog algoritma za IoT sustave ovisi o specifičnim sigurnosnim zahtjevima, performansama uređaja i energetskim potrebama, a rezultati istraživanja pomažu u boljem odabiru algoritama za konkretne primjene. Less
Abstract (english)
This paper studies cryptographic algorithms intended for resource-constrained devices, with a particular focus on algorithms suitable for use in the context of the Internet of Things (IoT). Through the analysis of cryptographic algorithms such as Present, Simon, Speck, Twine, Prince, and Rectangle, it can be concluded that each of them has its advantages and disadvantages for devices with limited resources, especially in IoT environments. Algorithms such as Present and Speck, due to... More their simple structure and optimized tables, are ideal for devices with limited processing power and memory, offering a good balance between security and performance. Algorithms like Simon and Twine also provide a good compromise, but their implementation may be more complex, which can affect efficiency in IoT devices with limited resources. Algorithms like Prince and Rectangle, which emphasize energy efficiency, are suitable for IoT devices that require high energy efficiency, but their complexity may make implementation more difficult. The pseudocodes of the analyzed algorithms provide flexibility in application and adaptation to specific IoT scenarios, and algorithms like Speck allow for the adjustment of key lengths and the number of operations, making them adaptable to different security requirements. In conclusion, the choice of cryptographic algorithm for IoT systems depends on specific security requirements, device performance, and energy needs, and the results of this research help in better selecting algorithms for specific applications. Less
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:217:857265
Study programmeTitle: Computer science and mathematics
Study programme type: university
Study level: graduate
Academic / professional title: sveučilišni magistar računarstva i matematike (sveučilišni magistar računarstva i matematike)
Type of resourceText
File originBorn digital
Access conditionsOpen access
Terms of useLicence In copyright icon
Created on2025-02-10 18:30:54
accessibility

closeAccessibilityrefresh

If you wish to permanently save changes, click on Save, if not - your settings will be reset when you restart the browser.