| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Algoritem RSA
Authors:ID Veček, Niki (Author)
ID Milutinović, Uroš (Mentor) More about this mentor... New window
Files:.pdf UNI_Vecek_Niki_2012.pdf (531,03 KB)
MD5: 885A10BFBC769FAB82E46408AE8E527E
PID: 20.500.12556/dkum/95061fe7-17f1-4925-8a81-20f211aa470d
 
Language:Slovenian
Work type:Undergraduate thesis
Typology:2.11 - Undergraduate Thesis
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract:Komuniciranje je velik del našega vsakdana, s tem pa se pokaže tudi potreba po varnem komuniciranju. Ljudje vsakodnevno uporabljamo bankomate, trgovske kartice popustov, pošiljamo elektronsko pošto, plačujemo račune preko spletnega bančništva, preverjamo in urejamo osebne podatke preko spletnih strani državnih uprav in podobno, pri tem pa se ne sprašujemo kam in kako pošiljamo naše osebne podatke. Vsak tak sistem temelji na svojem kriptosistmu, ki omogoča varno komunikacijo, brez, da bi njegovi uporabniki morali za karkoli skrbeti. Eden najbolj zanesljivih je RSA kriptosistem, ki je podrobneje predstavljen v diplomskem delu. Teorija števil, ki stoji za RSA kriptosistemom, obravnava področja praštevil, deljivosti in kongruenc, ki jih predstavimo v uvodu diplomskega dela. Sledijo jim drugi matematični pojmi, ki so tesno povezani z RSA: testi praštevilskosti, generiranje velikih praštevil, faktorizacija števil in diskretni logaritmi. Za konec so predstavljeni nekateri bolj znani napadi na RSA kriptosistem, v okviru katerih preverimo kdaj je RSA ranljiv in kaj so njegove šibke točke.
Keywords:algoritem RSA, kriptografija, šifriranje, dešifriranje, praštevila, faktorizacija, kongruence, diskretni logaritem.
Place of publishing:Maribor
Publisher:[N. Veček]
Year of publishing:2012
PID:20.500.12556/DKUM-37701 New window
UDC:51(043.2)
COBISS.SI-ID:19346952 New window
NUK URN:URN:SI:UM:DK:3VXADVBY
Publication date in DKUM:20.09.2012
Views:3058
Downloads:254
Metadata:XML DC-XML DC-RDF
Categories:FNM
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Secondary language

Language:English
Title:RSA Algorithm
Abstract:Communication is a big part of our everyday lives, and we can clearly see the need for secure communication. We daily use ATMs, discount cards and e-mails, we pay bills via online banking systems, and manage personal information through the national administration websites, but we don’t ask ourselves where and how we send our personal data. Each above mentioned system is based on its own cryptosystem that allows secure communication, and users don’t have to worry about anything. One of the most reliable cryptosystems is RSA cryptosystem which is described in the following thesis. Number theory behind the RSA cryptosystem discuses the areas of prime numbers, divisibility and congruences, and it’s presented in the introduction of the thesis. Other mathematical concepts follow which are closely related to the RSA: primality tests, generation of large prime numbers, factorization and discrete logarithms. In conclusion we present some of the more famous attacks on the RSA cryptosystem, under which we see when is the RSA most vulnerable and what are its weaknesses.
Keywords:RSA algorithm, cryptography, encryption, decryption, prime numbers, factorization, congruence, discrete logarithm


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica