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 8 of 8 for “"embedding degree"”.
-
Embedding degree of freedom, integrable charges and extended phase space
Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2026-08-01
-
Genus 2 curves in pairing-based cryptography and the minimal embedding field
… has size divisible by a large prime and whose embedding degree is small enough for computations to be feasible but large enough for the discrete logarithm problem in the embedding field to be difficult. We give a sequence of Fq-isogeny classes for a family of Jacobians of curves of genus 2 over …
-
Constructing suitable ordinary pairing-friendly curves: A case of elliptic curves and genus two hyperelliptic curves
… of the protocols. These curves have small embedding degree and large prime order subgroup. Random curves are likely to have large embedding degree and hence are not practical for implementation of pairing-based protocols. In this thesis we review some mathematical background on elliptic and …
-
Constructing suitable parameters for pairing-based cryptography
… it is required that they have a small embedding degree and a large prime order subgroup. Such abelian varieties are called “pairing-friendly”.This dissertation is dedicated to the problem of constructing pairing-friendly g-dimensional abelian varieties over finite fields. We start with …
-
Supersingular Curves in Cryptography
… to a definite quaternion algebra over ℚ. The low embedding degree of such curves makes them unsuitable for elliptic curve cryptography that relies on the group structure of points on an elliptic curve over a finite field. However, their pairing friendliness and rich endomorphism ring structure …
-
On Prime-Order Elliptic Curves with Embedding Degrees 3, 4 and 6
… The prime-order pairing friendly curves with embedding degrees k=3,4 and 6 were characterized by Miyaji, Nakabayashi and Takano. We study this characterization of MNT curves in details. We present explicit algorithms to obtain suitable curve parameters and to construct the corresponding …
-
Crytographic applications of bilinear maps
… logarithm problem on elliptic curves of small embedding degree. In 1984, Shamir developed the first identity based signature scheme, and posed the construction of an identity based encryption scheme as an open problem [118]. Subsequently identity based identification and identity based key …
-
Efficient Cryptographic Algorithms and Protocols for Mobile Ad Hoc Networks
… a non-supersingular genus 2 curve with the same embedding degree of k = 4 is investigated. Combining the new algorithm with known optimization techniques, we show that pairing computations on non-supersingular genus 2 curves over prime fields use up to 55.8% fewer field operations and run about …