Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Institution
- Publication
- Publication Type
Articles 1 - 6 of 6
Full-Text Articles in Number Theory
Cryptography Through The Lens Of Group Theory, Dawson M. Shores
Cryptography Through The Lens Of Group Theory, Dawson M. Shores
Electronic Theses and Dissertations
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 cryptosystem, both of which use the specific field of mathematics known as group theory.
The Conditional Probability That An Elliptic Curve Has A Rational Subgroup Of Order 5 Or 7, Meagan Kenney
The Conditional Probability That An Elliptic Curve Has A Rational Subgroup Of Order 5 Or 7, Meagan Kenney
Senior Projects Spring 2019
Let E be an elliptic curve over the rationals. There are two different ways in which the set of rational points on E can be said to be divisible by a prime p. We will call one of these types of divisibility local and the other global. Global divisibility will imply local divisibility; however, the converse is not guaranteed. In this project we focus on the cases where p=5 and p=7 to determine the probability that E has global divisibility by p, given that E has local divisibility by p.
Irreducibility And Galois Properties Of Lifts Of Supersingular Polynomials, Rylan Jacob Gajek-Leonard
Irreducibility And Galois Properties Of Lifts Of Supersingular Polynomials, Rylan Jacob Gajek-Leonard
Senior Projects Spring 2015
It has recently been shown that a rational specialization of Jacobi polynomials, when reduced modulo a prime number p, has roots which coincide with the supersingular j- invariants of elliptic curves in characteristic p. These supersingular lifts are conjectured to be irreducible with maximal Galois groups. Using the theory of p-adic Newton Polygons, we provide a new infinite class of irreducibility and, assuming a conjecture of Hardy and Littlewood, give strong evidence for their Galois groups being as large as possible.
Galois Representations From Non-Torsion Points On Elliptic Curves, Matthew Phillip Hughes
Galois Representations From Non-Torsion Points On Elliptic Curves, Matthew Phillip Hughes
Senior Projects Spring 2013
Working from well-known results regarding l-adic Galois representations attached to elliptic curves arising from successive preimages of the identity, we consider a natural deformation. Given a non-zero point P on a curve, we investigate the Galois action on the splitting fields of preimages of P under multiplication-by-l maps. We give a group-theoretic structure theorem for the corresponding Galois group, and state a conjecture regarding composita of two such splitting fields.
Factoring The Duplication Map On Elliptic Curves For Use In Rank Computations, Tracy Layden
Factoring The Duplication Map On Elliptic Curves For Use In Rank Computations, Tracy Layden
Scripps Senior Theses
This thesis examines the rank of elliptic curves. We first examine the correspondences between projective space and affine space, and use the projective point at infinity to establish the group law on elliptic curves. We prove a section of Mordell’s Theorem to establish that the abelian group of rational points on an elliptic curve is finitely generated. We then use homomorphisms established in our proof to find a formula for the rank, and then provide examples of computations.
The Elliptic Curve Discrete Logarithm And Functional Graphs, Christopher J. Evans
The Elliptic Curve Discrete Logarithm And Functional Graphs, Christopher J. Evans
Mathematical Sciences Technical Reports (MSTR)
The discrete logarithm problem, and its adaptation to elliptic curves, called the elliptic curve discrete logarithm problem (ECDLP) is an open problem in the field of number theory, and its applications to modern cryptographic algorithms are numerous. This paper focuses on a statistical analysis of a modification to the ECDLP, called the x-ECDLP, where one is only given the xcoordinate of a point, instead of the entire point. Focusing only on elliptic curves whose field of definition is smaller than the number of points, this paper attempts to find a statistical indication of underlying structure (or lack thereof) in the …