20.500.12556/DKUM-37701 Algoritem RSA RSA Algorithm 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. 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. algoritem RSA kriptografija šifriranje dešifriranje praštevila faktorizacija kongruence diskretni logaritem. RSA algorithm cryptography encryption decryption prime numbers factorization congruence discrete logarithm true true false [N. Veček] Slovenski jezik Angleški jezik Diplomsko delo 2012-09-07 07:22:54 2012-09-20 13:03:37 2022-04-25 23:00:10 2021-04-18 03:40:52 2012 0 Maribor 0 0000-00-00 NiDoloceno NiDoloceno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 51(043.2) 19346952 URN:SI:UM:DK:3VXADVBY UNI_Vecek_Niki_2012.pdf UNI_Vecek_Niki_2012.pdf 1 885A10BFBC769FAB82E46408AE8E527E d0612366bd13d90cacab750a91c77a8e6cf94ba3f0d717e34276c0418319a94c 4f7907e5-7c08-11eb-bb7a-00155d0001ca 20.500.12556/dkum/95061fe7-17f1-4925-8a81-20f211aa470d https://dk.um.si/Dokument.php?lang=slv&id=49827 Fakulteta za naravoslovje in matematiko 0 0 0