Efficient Prime Number Generation Techniques for Cryptographic Applications

dc.contributor.advisorHannusch, Carolin
dc.contributor.authorMuogilim, Onyinyechukwu Joy
dc.contributor.departmentDE--Informatikai Kar
dc.date.accessioned2025-02-22T21:16:43Z
dc.date.available2025-02-22T21:16:43Z
dc.date.created2024
dc.description.abstractThis thesis examines the role of prime numbers in cryptography and information security through prime number generation methods and the cryptographic algorithms that utilise them. It presents a detailed evaluation of various prime number generation methods, such as prime sieves and primality tests, as well as cryptographic protocols such as the RSA, AES, and DES. It also analyses the performance of these algorithms in terms of speed and computational efficiency when used in securing today's technology, as well as the emerging quantum technology. Furthermore, it also goes over their practical applications in securing digital communication and data protection. The aim of this study is to investigate how these cryptographic protocols influence the efficiency of information and network security and how that will change with the rise in quantum computing.
dc.description.courseProgramtervező informatikus
dc.description.degreeBSc/BA
dc.format.extent43
dc.identifier.urihttps://hdl.handle.net/2437/387395
dc.language.isoen
dc.rights.accessHozzáférhető a 2022 decemberi felsőoktatási törvénymódosítás értelmében.
dc.subjectcryptography
dc.subjectprime
dc.subjectnumbers
dc.subject.dspaceInformatics
dc.titleEfficient Prime Number Generation Techniques for Cryptographic Applications
Fájlok
Eredeti köteg (ORIGINAL bundle)
Megjelenítve 1 - 1 (Összesen 1)
Nincs kép
Név:
thesis.pdf
Méret:
2.16 MB
Formátum:
Adobe Portable Document Format
Leírás:
thesis
Engedélyek köteg
Megjelenítve 1 - 1 (Összesen 1)
Nincs kép
Név:
license.txt
Méret:
1.95 KB
Formátum:
Item-specific license agreed upon to submission
Leírás:
Gyűjtemények