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 15 of 15 for “"Discrete Logarithms"”.

  1. 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 …

    oklahoma-thes Repository record for Studies on Deep Holes and Discrete Logarithms (opens in a new tab)

  2. An analysis of algorithms for solving discrete logarithms in fixed groups

    … Security rely on the assumption that finding discrete logarithms is hard. The protocols specify fixed groups for Diffie-Hellman key exchange that must be supported. Although the protocols allow flexibility in the choice of group, it is highly likely that the specific groups required by the …

    nps Repository record for An analysis of algorithms for solving discrete logarithms in fixed groups (opens in a new tab)

  3. 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 …

    concordia Download PDF for Application of sieve methods to factorization and the discrete logarithm problem (opens in a new tab)

  4. 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 …

    qucosa-diss

  5. On the effectiveness of isogeny walks for extending cover attacks on elliptic curves

    Cryptographic systems based on the elliptic curve discrete logarithm problem (ECDLP) are widely deployed in the world today. In order for such a system to guarantee a particular security level, the elliptic curve selected must be such that it avoids a number of well-known attacks. Beyond this, one …

    waterloo Repository record for On the effectiveness of isogeny walks for extending cover attacks on elliptic curves (opens in a new tab)

  6. Cyclic Codes: Low-Weight Codewords and Locators

    … thesis I show an alternative approach based on discrete logarithms which has - in some cases relevant for applications - much lower memory complexity requirements and a comparable time complexity. The second part of the thesis is devoted to some results concerning efficient bounded-distance …

    trento Repository record for Cyclic Codes: Low-Weight Codewords and Locators (opens in a new tab)

  7. Techniques for Quantum Computing

    … of Shor's quantum algorithm for computing discrete logarithms. This algorithm is particularly significant because it threatens to undermine the security of widely used elliptic curve cryptosystems. I give a strategy for implementing Shor's algorithm for finding discrete logarithms in groups …

    waterloo Repository record for Techniques for Quantum Computing (opens in a new tab)

  8. New Directions in Multivariate Public Key Cryptography

    … practice are based on integer factorization or discrete logarithms (in finite fields or elliptic curves). However, these systems suffer from two potential drawbacks. First, they must use large keys to maintain security, resulting in decreased efficiency. Second, if large enough quantum computers …

    clemson Repository record for New Directions in Multivariate Public Key Cryptography (opens in a new tab)

  9. Correlations of multiplicative functions and factoring algorithms

    … algorithms for factoring integers and computing discrete logarithms that use fewer gates than Shor's algorithm.

    oxford Repository record for Correlations of multiplicative functions and factoring algorithms (opens in a new tab)

  10. STPA-Sec Applied to Path Planning: Quantum-Safe Autonomous Vehicles

    … ability to factor large numbers and find discrete logarithms efficiently [23]. According to existing mathematical theory, classical computers cannot factor large numbers or find discrete logarithms efficiently. The critical insight derived from this thesis is that an adversary can defeat …

    waterloo Repository record for STPA-Sec Applied to Path Planning: Quantum-Safe Autonomous Vehicles (opens in a new tab)

  11. Secure and efficient post-quantum cryptographic digital signature algorithms

    … schemes that rely on the hardness of finding discrete logarithms and factoring in finite groups. Given the recent advances in physics which point towards the eventual construction of large scale quantum computers, these hard problems will be solved in polynomial time using Shor’s algorithm. …

    uvic Repository record for Secure and efficient post-quantum cryptographic digital signature algorithms (opens in a new tab)

  12. A study of cryptographic systems based on Rank metric codes

    … the difficulty of factoring integers or solving discrete logarithms were efficiently solvable. As the most ubiquitous asymmetric cryptosystems in modern use are based on these problems, new cryptosystems had to be considered for post-quantum cryptography. In 1978, McEliece proposed a cryptosystem …

    zurich

  13. Quantum Algorithms for Clustering and Covert Factoring

    … protocols based on integer factorization and discrete logarithms. Even with Post-Quantum Cryptography, attacks of the “save now, decrypt later” type can compromise the security of critical systems. Keeping this mind, we would like to develop quantum systems that are designed specifically for …

    waterloo Repository record for Quantum Algorithms for Clustering and Covert Factoring (opens in a new tab)

  14. Delegation of quantum computation using a random oracle

    … (Shor,97) for integer factorization and discrete logarithms. Our second protocol requires interaction---one quantum message from the client to the server, and many rounds of classical computation---but supports arbitrary quantum computation (instead of a specific circuit family), and is …

    bu Repository record for Delegation of quantum computation using a random oracle (opens in a new tab)

  15. Cryptography Through the Lens of Group Theory

    Cryptography has been around for many years, and mathematics has been around even longer. When the two subjects were combined, however, both the improvements and attacks on cryptography were prevalent. This paper introduces and performs a comparative analysis of two versions of the ElGamal …

    gsu Repository record for Cryptography Through the Lens of Group Theory (opens in a new tab)