Discrete logarithm problem over finite prime fields
McCulloch, Catherine Margaret (1998) Discrete logarithm problem over finite prime fields. .
Impact and interest:
Citation countsare sourced monthly fromand citation databases.
These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.
Citations counts from theindexing service can be viewed at the linked Google Scholar™ search.
|Item Type:||QUT Thesis (Masters by Research)|
|Additional Information:||Presented to the School of Mathematical Sciences, Queensland University of Technology.|
|Keywords:||Logarithms, Finite fields (Algebra), cryptography, cryptology, digital signatures, discrete logarithm, general number field sieve, key exchange, key exhaustion, index calculus, Pollards rho algorithm, public key cryptology, Shank's baby-step giant-step algorithm, Silver Pohlig Hellman algorithm, thesis, masters|
|Institution:||Queensland University of Technology|
|Copyright Owner:||Copyright Catherine Margaret McCulloch|
|Deposited On:||22 Sep 2010 23:06|
|Last Modified:||09 Feb 2011 23:56|
Repository Staff Only: item control page