Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Elliptic Pairs
Results
The End
Elliptic Pairs
Results
The End
Acknowledgements
Thanks go to Dr. Liljana Babinkostova, for being the mentor for this project and to both the Idaho STEP program and the Department of Mathematics at Boise State University for partially funding this project.
Elliptic Pairs
Results
The End
Elliptic Curve
Denition Elliptic Curves: a curve dened by the equation y 2 = x 3 + Ax + B which also meets the requirement that 4A3 + 27B 2 is nonzero
Elliptic Pairs
Results
The End
A given elliptic curve denes a group E (Fp ) when an additional point called the point at innity is added to it. The reasons for will be explained later.
Elliptic Pairs
Results
The End
A given elliptic curve denes a group E (Fp ) when an additional point called the point at innity is added to it. The reasons for will be explained later. An elliptic curve group over the eld Fp , is dened as the set: E (Fp ) = {(x, y ) : y 2 = x 3 + Ax + B (mod p)} {} with the operation modular addition.
Elliptic Pairs
Results
The End
Elliptic Pairs
Results
The End
Elliptic Pairs
Results
The End
Elliptic Pairs
Results
The End
Elliptic Pairs
Results
The End
Elliptic Pairs
Results
The End
It is now necessary to add another point to the group. This is where , the point at innity, comes in.
Suzanne Craig Elliptic Pairs of Primes Boise State University Department of Mathematics
Elliptic Pairs
Results
The End
K + = K = + K for all K E (Fp ) K + (K ) = for all K E (Fp ) K + (L + P) = (K + L) + P for all K,L,P E (Fp ) P + Q = Q + P for all P,Q E (Fp )
Elliptic Pairs
Results
The End
Elliptic Pairs
Denition Two primes p and q are called an elliptic pair1 if for two curves E (Fp ) and E (Fq ), the following is true |E (Fp )| = q |E (Fq )| = p
1 J. Silverman and K. Stange, Amicable Pairs and Aliquot Cycles in Elliptic Curves, Experimental Mathematics vol. 20, no. 3 (2011), pp. 329-357 Suzanne Craig Elliptic Pairs of Primes Boise State University Department of Mathematics
Elliptic Pairs
Results
The End
Motivation
Elliptic curves are used in cryptography and these systems security is aected by the order of the group. We are interested in seeing if using curves with these primes will aect security.
Elliptic Pairs
Results
The End
Motivation
Elliptic curves are used in cryptography and these systems security is aected by the order of the group. We are interested in seeing if using curves with these primes will aect security. Questions:
Elliptic Pairs
Results
The End
Motivation
Elliptic curves are used in cryptography and these systems security is aected by the order of the group. We are interested in seeing if using curves with these primes will aect security. Questions: Can properties of these pairs aect the security of the cryptosystems?
Elliptic Pairs
Results
The End
Motivation
Elliptic curves are used in cryptography and these systems security is aected by the order of the group. We are interested in seeing if using curves with these primes will aect security. Questions: Can properties of these pairs aect the security of the cryptosystems? What properties do these pairs have?
Elliptic Pairs
Results
The End
Motivation
Elliptic curves are used in cryptography and these systems security is aected by the order of the group. We are interested in seeing if using curves with these primes will aect security. Questions: Can properties of these pairs aect the security of the cryptosystems? What properties do these pairs have? What is the distribution of these elliptic pairs?
Elliptic Pairs
Results
The End
Project Methods
Created MAPLE software to collect information on E (Fp ) for curves of the form y2 = x3 + B
Elliptic Pairs
Results
The End
Project Methods
Created MAPLE software to collect information on E (Fp ) for curves of the form y2 = x3 + B We collected over 120,000 such pairs.
Elliptic Pairs
Results
The End
Project Methods
Created MAPLE software to collect information on E (Fp ) for curves of the form y2 = x3 + B We collected over 120,000 such pairs. There were two types of pairs we collected
1 2
Elliptic Pairs
Results
The End
Elliptic Pairs
Results
The End
Elliptic Pairs
Results
The End
Denitions
Denition The totient function, (n) = {m : gcd(m, n) = 1 and m n where m, n Z}
Elliptic Pairs
Results
The End
Denitions
Denition The totient function, (n) = {m : gcd(m, n) = 1 and m n where m, n Z} Denition An integer r is said to be the order of a modulo n if it is the smallest positive integer where ar = 1 mod n is true.
Elliptic Pairs
Results
The End
Denitions
Denition The totient function, (n) = {m : gcd(m, n) = 1 and m n where m, n Z} Denition An integer r is said to be the order of a modulo n if it is the smallest positive integer where ar = 1 mod n is true. Denition An integer a is a primitive root modulo n if the order of a mod n = (n).
Elliptic Pairs
Results
The End
Conjectures
Conjecture If each integer B < p which produces a prime order is a primitive root of p, then exactly two such prime orders are produced for the prime p.
Elliptic Pairs
Results
The End
Conjectures
Conjecture If each integer B < p which produces a prime order is a primitive root of p, then exactly two such prime orders are produced for the prime p. Conjecture If (p, q) is an elliptic pair of prime numbers, then p q mod 4.
Elliptic Pairs
Results
The End
Background
Theorem Suppose q is odd and q 2 mod 3. Let B Fq . Then the curve given by y 2 = x 3 + B is supersingular
Elliptic Pairs
Results
The End
Background
Theorem Suppose q is odd and q 2 mod 3. Let B Fq . Then the curve given by y 2 = x 3 + B is supersingular Theorem Suppose p 5 is prime and E (Fp ) exists. Then E (Fp ) is supersingular if and only if |E (Fp )| = p + 1.
Elliptic Pairs
Results
The End
Theorem 1
Elliptic Pairs
Results
The End
Theorem 2
Theorem For every prime number p with p mod 3 1 there exist unique integers x, y > 0 such that p = x 2 + xy + y 2 .
Elliptic Pairs
Results
The End
Further Questions
Is there a discernable pattern for the pairs of primes which are congruent to 1 or 3 modulo 4? Is there an explicit way of representing the distribution of elliptic pairs?
Elliptic Pairs
Results
The End
Current Work
Currently our research is focused on: Proving the conjectures Gathering and analyzing more data to support these conjectures and possibly develop more Seeing if our data supports others conclusions regarding elliptic pairs
Elliptic Pairs
Results
The End
References
Neal Koblitz, Elliptic Curve Cryptosystems, Mathematics of Computation, Vol. 48, No. 177 (1987), pp. 203-209 Neal Koblitz, Introduction to Elliptic Curves and Modular Forms, 2nd ed. Springer-Verlag, (1993). V. Miller, Use of elliptic curves in cryptography, Advances in CryptologyCRYPTO 85, Springer-Verlag, (1986), pp. 417-426. J. Silverman and K. Stange, Amicable Pairs and Aliquot Cycles in Elliptic Curves, Experimental Mathematics, Vol. 20, No. 3 (2011), pp. 329-357. Lawrence C. Washington, Elliptic Curves: Number Theory and Cryptography, 2nd ed. Chapman & Hall, (2008).
Elliptic Pairs
Results
The End
Thank you!