| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:DISKRETNI LOGARITEM
Authors:ID Petelinek, Barbara (Author)
ID Pagon, Dušan (Mentor) More about this mentor... New window
Files:.pdf UNI_Petelinek_Barbara_2010.pdf (378,11 KB)
MD5: 25F979B74CC62B77041CD0449F5A1808
PID: 20.500.12556/dkum/41f199d1-b8ae-4280-8a1a-14f98a81ac95
 
Language:Slovenian
Work type:Undergraduate thesis
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract:V diplomskem delu obravnavamo problem diskretnega logaritma. Problem diskretnega logaritma je matematično-računski problem, ki služi kot osnova kriptografskim protokolom. Pri diskretnih logaritmih operiramo znotraj multiplikativne grupe G. Problem od nas zahteva, da za dani g,h je element G najdemo x je elemen G, za katerega je g^x=h. Povedano drugače iščemo logaritem x=log_g h, ker pa logaritem operira v končni multiplikativni grupi, mu pravimo diskretni. Ta problem diskretnega logaritma je domnevno težko rešljiv, ker zanj ne poznamo splošne rešitve. Dolgotrajno in neuspešno iskanje učinkovitih algoritmov pa nas utrjuje v domnevi,da je diskretni logaritem v splošnem težko izračunati v naslednjih multiplikativnih grupah: - Z^*_p, kjer je p praštevilo; - multiplikativna grupa reda p^k, kjer je p praštevilo; - grupa točk eliptične krivulje, definirane nad končnim poljem. V diplomskem delu je poudarek na metodah za izračun vrednosti diskretne logaritemske funkcije (številskih rešetih. Le-te pa so v marsičem podobne tistim za razcep naravnega števila na prafaktorje.
Keywords:Diskretni logaritem, grupa, algoritem, kriptografija, rešeto številskega polja.
Place of publishing:Maribor
Publisher:[B. Petelinek]
Year of publishing:2010
PID:20.500.12556/DKUM-14056 New window
UDC:51(043.2)
COBISS.SI-ID:17739784 New window
NUK URN:URN:SI:UM:DK:KDEHFHEM
Publication date in DKUM:08.07.2010
Views:3406
Downloads:302
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:Discrete logarithm
Abstract:In this diploma work we have presented the discrete logarithm problem. Discrete logarithm is mathematic-computational problem, which serves as basis for cryptographic protocols. Discrete logarithms are operated only inside multiplicated group G. The main problem is finding a solution x, of the equation g^x=h, where g and h are elements of a finite cyclic group G. In other words we are searching for logarithm x=log_g h and because logarithm operates on finite multiplicated group, x is called a discrete logarithm to the base g of h in the group G. The problem of discrete logarithm is not very easy to solve, because there is no general solution for the problem. Lasting and unsuccessful search of efficient algorithms show us that computation of discrete logarithm is in general very hard to solve in next multiplicative groups: - Z^*_p, where p is prime number; - multiplicated group of order p^k, where p is prime number; - group of points on ecliptic curve, defined over finite field. The emphasis in this diploma work is on methods that compute values for discrete logaritm function (number field sieve). These sieves are very familiar to those that are used for splitting of natural number to prime numbers.
Keywords:Discrete logarithm, group, algorithm, cryptography, number field sieve.


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