Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 58 for “"Discrete Logarithm Problem"”.
-
Algorithms for Solving the Discrete Logarithm Problem
… often many procedures to solve or prove the same problem. The discrete logarithm is one of these problems. The baby step, giant step algorithm and Pollard's kangaroo algorithm are two algorithms that attempt to solve discrete logarithm problems. Explanations on what these two algorithms are will …
-
The Discrete Logarithm Problem in Finite Fields of Small Characteristic
Computing discrete logarithms is a long-standing algorithmic problem, whose hardness forms the basis for numerous current public-key cryptosystems. In the case of finite fields of small characteristic, however, there has been tremendous progress recently, by which the complexity of the discrete …
-
Application of sieve methods to factorization and the discrete logarithm problem
Factoring large numbers and computing discrete logarithms are presumed to be hard problems. No polynomial time solution for those problem has yet been found. Those problems have many significant applications, particularly in cryptography. Several cryptosystems base their security on their supposed …
-
Algorithms for the Elliptic Curve Discrete Logarithm Problem and the Approximate Common Divisor Problem
… integers are based on the assumption that the Discrete Logarithm Problem (DLP) and the Approximate Common Divisor (ACD) problem are hard respectively. These computational assumptions can be tested by developing improved algorithms to solve them. The DLP for elliptic curves defined over certain …
-
Combinatorial and Stochastic Approach to Parallelization of the Kangaroo Method of Solving the Discrete Logarithm Problem
… rho algorithm provides a powerful way to solve discrete log problems. There exist parameters for it that allow it to be optimized in such a way as to prevent what are known as "useless collisions" in exchange for the limitation that the number of parallel resources used must be both finite and …
-
Studies on Deep Holes and Discrete Logarithms
… codes and cryptosystems based on the discrete logarithm problem are important representatives of these two fields, respectively. For a linear code, deep holes are defined to be vectors that are further away from codewords than all other vectors. The problem of deciding whether a …
-
Public key cryptography based on tropical algebra
… is public key cryptography, which is based on discrete logarithm problem. The Dilfie-Helman public key and Stickel’s key ex-change protocol are the examples of the application of discrete logarithm problem in public key cryptography. This thesis will examine the possibilities of public key …
-
Triviality and Nontriviality of Tate-Lichtenbaum Self Pairings
… subset E(F_q). For attacking the elliptic curve discrete logarithm problem it is useful to know when points pair with themselves nontrivially under the Tate-Lichtenbaum pairing. In this thesis we characterize when all points in E[n] have trivial self pairings. This result is expressed in terms of …
-
Analysis and Applications of Two Group-Theoretic Problems in Post-Quantum Cryptography
… to the analysis of two computational problems arising from a cryptosystem in group-based, post-quantum cryptography, and proposes a novel application of the underlying mathematical structure. After an introductory Chapter 1 setting the historical context in which our research appears, …
-
Key management protocols in hybrid wireless sensor networks
… hoc network layer, we propose two elliptic curve discrete logarithm problem (ECDLP) based schemes for secure group communication (SGC). Unlike the vast majority of secure group communication protocols using the discrete logarithm problem (DLP) based Diffie-Hellman as the basic key agreement …
-
Elliptic curves and their applications in cryptography
… of elliptic curves on cryptography and basic problems involving implementation and security of some elliptic curve cryptosystems. Some of the aspects we are concerned with include: Methods to determine the number of points on an elliptic curve over a finite field; Implementation of …
-
A New Public-Key Cryptosystem
… of integer factorization (or the related discrete logarithm problem). Advances in quantum computing threaten to render such systems useless. In addition, public-key systems tend to be slower than symmetric systems because of their use of number-theoretic algorithms. I propose a new public …
-
Spread codes and more general network codes
… Codes in Verbindung mit dem sogenannten “Rank Discrete Logarithm Problem”. Desweiteren erläutern wir ein Zugehörigkeitskriterium, welches erkennt, ob ein empfangener Vektorraum ein Element des Codes ist oder nicht. Dieses steht in Verbindung mit dem diskreten Logarithmus über einem endlichen …
-
Racionalieji taškai ant elipsinių kreivių /
… acceleration hardware. The elliptic curve discrete logarithm problem is very hard and that fact allows for the usage of smaller curves while still retaining similar levels of security when compared to other cyphers (RSA).
-
Number Theoretic Algorithms For Elliptic Curves
… it directly relates to recent attacks on the discrete logarithm problem on the p-torsion subgroup of an elliptic curve over a finite field of characteristic p. We also present a new attack on the discrete logarithm problem on anomalous curves using a lift of E over the dual numbers of the …
-
The Elgamal Cryptosystem is better than Th RSA Cryptosystem for Mental Poker
… among the players and the debate between the discrete logarithm problem (DLP) and the factoring problem (FP) for the encryption/decryption schemes. Under these criteria, the comparison results demonstrate that the Elgamal Cryptosystem has better efficiency and effectiveness than RSA for mental …
-
Vulnerabilities of some semidirect products in Diffie-Hellman key exchanges
… product creating a modified version of a Discrete Logarithm problem to provide security for Alice and Bob. Regardless of choosing a tropical semiring or a free nilpotent p-group, these protocols prove not only vulnerable to quantum attacks, but they can be attacked by a classical computer. …
-
Verified commitment schemes and reduction proofs in the lean proof assistant
… and computational binding via reduction to the discrete logarithm problem; for ElGamal, we prove perfect binding and computational hiding via reduction to the decisional Diffie–Hellman assumption. This work contributes both concrete formalizations and reusable abstractions for cryptographic …
Page 1 of 3