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 51 for “"isogenies"”.

  1. Isogenies and cryptography

    This thesis explores the notion of isogenies and its applications to cryptography. Elliptic curve cryptography (ECC) is an efficient public cryptosystem with a short key size. For this reason it is suitable for implementing on memory-constraint devices such as smart cards, mobile devices, etc. …

    concordia Download PDF for Isogenies and cryptography (opens in a new tab)

  2. Isogenies of Abelian Varieties in Cryptography

    Isogenies of abelian varieties have been used in cryptography to create post-quantum cryptosystems. In particular, supersingular elliptic curve isogenies have been used to construct key exchange, encryption and signature protocols and hash functions. This thesis concerns itself with results …

    auckland-ms Repository record for Isogenies of Abelian Varieties in Cryptography (opens in a new tab)

  3. Evaluating Large Degree Isogenies between Elliptic Curves

    … in cryptography require evaluating large degree isogenies between elliptic curves efficiently. For ordinary curves of the same endomorphism ring, the previous fastest algorithm known has a worst case running time which is exponential in the length of the input. In this thesis we solve this …

    waterloo Repository record for Evaluating Large Degree Isogenies between Elliptic Curves (opens in a new tab)

  4. Quantum Cost Models for Cryptanalysis of Isogenies

    Isogeny-based cryptography uses keys large enough to resist a far-future attack from Tani’s algorithm, a quantum random walk on Johnson graphs. The key size is based on an analysis in the query model. Queries do not reflect the full cost of an algorithm, and this thesis considers other cost models. …

    waterloo Repository record for Quantum Cost Models for Cryptanalysis of Isogenies (opens in a new tab)

  5. Factoring Isogenies in Higher Dimension and Applications

    … on the computational<br/>difficulty of finding isogenies between certain elliptic curves.<br/>In cryptography, isogenies typically appear as chains of prime-degree maps. Much<br/>like prime numbers, prime-degree isogenies can be considered “atomic entities”. This<br/>raises a natural question: …

    bristol Repository record for Factoring Isogenies in Higher Dimension and Applications (opens in a new tab) Download PDF for Factoring Isogenies in Higher Dimension and Applications (opens in a new tab)

  6. Constructing Secure Protocols from Proofs of Knowledge and Isogenies

    … They require computing large degree coprime N′-isogenies, which means they must either work over larger field extensions or choose a prime large enough to have rational N′-torsion. Further, they suffer from poor performance due to their small challenge space, resulting in many parallel …

    auckland-ms Repository record for Constructing Secure Protocols from Proofs of Knowledge and Isogenies (opens in a new tab)

  7. A post-quantum digital signature scheme based on supersingular isogenies

    … scheme based on supersingular elliptic curve isogenies secure against quantum adversaries in the quantum random oracle model with small key sizes. This scheme is an application of Unruh’s construction of non-interactive zero-knowledge proofs to an interactive zero-knowledge proof proposed by …

    waterloo Repository record for A post-quantum digital signature scheme based on supersingular isogenies (opens in a new tab)

  8. Selmer groups for elliptic curves with isogenies of prime degree

    The Mordell-Weil theorem states that the points of an elliptic curve defined over a number field form a finitely generated, abelian group. The rank of this group, generally referred to as the rank of the elliptic curve, is hard to study. The Selmer group, defined via Galois cohomology, gives a way …

    washington Repository record for Selmer groups for elliptic curves with isogenies of prime degree (opens in a new tab)

  9. Key Exchange and Zero-Knowledge Proofs from Isogenies and Hyperelliptic Curves

    … first is post-quantum secure key exchange from isogenies. Key exchange protocols are critical for setting up secure communication over the internet. We construct a new initial key agreement protocol to replace the classical extended triple Diffie-Hellman (X3DH) scheme in the Signal Protocol, …

    auckland-ms Repository record for Key Exchange and Zero-Knowledge Proofs from Isogenies and Hyperelliptic Curves (opens in a new tab)

  10. Post-Quantum Elliptic Curve Cryptography

    … schemes for post-quantum cryptography based on isogenies over elliptic curves. First we show that ordinary elliptic curves are have less than exponential security against quantum computers. These results were used as the motivation for De Feo, Jao and Pl\^ut's construction of public key …

    waterloo Repository record for Post-Quantum Elliptic Curve Cryptography (opens in a new tab)

  11. Distribution of Selmer Groups of Quadratic Twists of a Family of Elliptic Curves

    … the six Selmer groups arising from the three 2-isogenies and their dual 2-isogenies. We also describe explicit formulas on the size of the six Selmer groups.

    uiuc Repository record for Distribution of Selmer Groups of Quadratic Twists of a Family of Elliptic Curves (opens in a new tab)

  12. Implementing the Castryck-Decru attack on SIDH with general primes

    … SIDH protocol extra information on the secret isogenies is transmitted. In July 2022, Castryck and Decru found a way to exploit this information to completely break the scheme. They gave an implementation of their attack which allows to recover Bob’s secret key in a few seconds on a laptop. …

    waterloo Repository record for Implementing the Castryck-Decru attack on SIDH with general primes (opens in a new tab)

  13. Computing the trace of an endomorphism of a supersingular elliptic curve

    … curve which is given by a chain of small-degree isogenies. We analyze its complexity, determining that if the length of the chain, the degree of the isogenies, and the log of the field-size are all O(n), the trace of the endomorphism can be computed in O(n⁶) bit operations. This makes explicit a …

    vt Repository record for Computing the trace of an endomorphism of a supersingular elliptic curve (opens in a new tab)

  14. An Elliptic Curve over Q has an Isogenous Quadratic Twist if and Only if it has complex Multiplication

    … result of Faltings comparing local and global isogenies of elliptic curves over number fields, and a famous theorem proven by Serre on the density of supersingular primes for elliptic curves over the rational numbers. While the result of this thesis is certainly known to experts, a proof seems …

    calgary Repository record for An Elliptic Curve over Q has an Isogenous Quadratic Twist if and Only if it has complex Multiplication (opens in a new tab)

  15. Design, Analysis, and Optimization of Isogeny-Based Key Establishment Protocols

    … including improved field arithmetic, Splitting Isogenies into Multiple Batches (SIMBA), and the two-point method. We apply our optimizations to the CSIDH-512 parameter set and give experimental results. Fault Attacks. We consider physical attacks on static/ephemeral CSIDH in which limited …

    waterloo Repository record for Design, Analysis, and Optimization of Isogeny-Based Key Establishment Protocols (opens in a new tab)

  16. Isolated Curves for Hyperelliptic Curve Cryptography

    … efficient algorithm to explicitly construct isogenies between two genus two curves with large conductor gap. Thus there is no known way of transporting the discrete log problem (DLP) from an isolated curve to a large set of isogenous curves by constructing isogenies. Isolated genus two curves …

    washington Repository record for Isolated Curves for Hyperelliptic Curve Cryptography (opens in a new tab)

  17. Lattice based and isogeny based post-quantum cryptography

    … This kind of cryptography relies on isogenies of elliptic curves as well as lattices and works by each communicating party taking random walks on isogeny graphs. In this report we explain in detail how to find isogenies of elliptic curves, how we can compute isogeny graphs from …

    texas Repository record for Lattice based and isogeny based post-quantum cryptography (opens in a new tab)

Page 1 of 3