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 24 for “"Curves, Elliptic."”.
-
Exploring the Existence of Rational Points on Elliptic Curves: What is the Point?
… an answer at all. It is especially the case for elliptic curves. Elliptic curves of the Weierstrass form are equations of the form 𝑦𝑦2=𝑓𝑓(𝑥𝑥)=𝑥𝑥3+𝐴𝐴𝐴 +𝐵𝐵, where 𝐴𝐴,𝐵𝐵∈ℤ. Although solutions to cubic equations are well-understood with real numbers, the challenge appears when we try to find integers …
-
Genus 2 curves in pairing-based cryptography and the minimal embedding field
A pairing-friendly hyperelliptic curve over a finite field Fq is one whose group of Fq-rational points of its Jacobian 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 …
-
Integral solutions in arithmetic progression for elliptic curves.
Integral solutions to y² = X³ + k, where either the x's or the y's, or both, are in arithmetic progression are studied. When both the x's and the y's are in arithmetic progression, then this situation is completely solved. One set of solutions where the y's formed an arithmetic progression of …
-
Prime torsion in the Brauer group of an elliptic curve
… different from 2 or 3, and let E be an elliptic curve over k. The Brauer group of E is a torsion abelian group with elements given by Morita equivalence classes of central simple algebras over the function field k(E). The Merkurjev-Suslin theorem implies that any such element can be …
-
Elliptic curves and their applications in cryptography
In 1985, Koblitz and Miller proposed elliptic curves to be used for public key cryptosystems. This present thesis examines the role of elliptic curves on cryptography and basic problems involving implementation and security of some elliptic curve cryptosystems. Some of the aspects we are concerned …
-
On some property of elliptic nets
[Please see thesis for abstract]
-
Secure architectures for pairing based public key cryptography
… security, must be considered by the designer. Elliptic curves, since their introduction to public key cryptography in 1985 have challenged established public key and signature generation schemes such as RSA, offering more security per bit. Amongst Elliptic curve based systems, pairing based …
-
FPGA Implementations of Elliptic Curve Cryptography and Tate Pairing over Binary Field
Elliptic curve cryptography (ECC) is an alternative to traditional techniques for public key cryptography. It offers smaller key size without sacrificing security level. Tate pairing is a bilinear map used in identity based cryptography schemes. In a typical elliptic curve cryptosystem, elliptic …
-
Reconfigurable and compact modular polynomial multiplier in Galois field for the security of IoT
… adaptability, and cryptographic robustness for Elliptic Curve Cryptography (ECC) applications. The proposed multipliers were synthesized and validated on multiple FPGA platforms including Spartan-7, Zynq UltraScale+, and Artix-7 using the AMD Xilinx Vivado toolchain. The Karatsuba reconfigurable …
-
A locus construction in the hyperbolic plane for elliptic curves with cross-ratio on the unit circle
This project demonstrates how an elliptic curve f defined by invariance under two involutions can be represented by the locus of circumcenters of isosceles triangles in the hyperbolic plane, using inversive model.
-
A locus construction in the hyperbolic plane for elliptic curves with cross-ratio on the unit circle
This project demonstrates how an elliptic curve f defined by invariance under two involutions can be represented by the locus of circumcenters of isosceles triangles in the hyperbolic plane, using inversive model.
-
Mordell-Weil theorem and the rank of elliptical curves
… theorem, a formula for the rank of the elliptical curves in certain cases over algebraic number fields can be obtained and computable.
-
Mordell-Weil theorem and the rank of elliptical curves
… theorem, a formula for the rank of the elliptical curves in certain cases over algebraic number fields can be obtained and computable.
-
Elliptic curves and their cryptographic applications
"This thesis is a basic overview of elliptic curves and their applications to Cryptography. We begin with basic definitions and a demonstration that, given an elliptic curve addition, the points of an elliptic curve form a mathematical group. We then proceed to delve further into the mathematics, …
Page 1 of 2