Scribd
Upload
35 views

HW 1

This document provides the details for Homework #1 of the course CS 259C/Math 250 on elliptic curves in cryptography. It includes 10 problems covering topics like: 1) Plotting elliptic curves over different fields and finding their group structures. 2) Computing points addition on elliptic curves. 3) Showing properties of elliptic curve group laws. 4) Finding isomorphisms between elliptic curves over finite fields. 5) Showing that the automorphism group of a particular elliptic curve over a finite field is non-abelian.

Uploaded by

Andrei Mogage
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
35 views

HW 1

This document provides the details for Homework #1 of the course CS 259C/Math 250 on elliptic curves in cryptography. It includes 10 problems covering topics like: 1) Plotting elliptic curves over different fields and finding their group structures. 2) Computing points addition on elliptic curves. 3) Showing properties of elliptic curve group laws. 4) Finding isomorphisms between elliptic curves over finite fields. 5) Showing that the automorphism group of a particular elliptic curve over a finite field is non-abelian.

Uploaded by

Andrei Mogage
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

CS 259C/Math 250: Elliptic Curves in Cryptography

Homework #1

Due October 10

Answers must be handed in in class or to Mark (494 Gates) by 4pm on the due date. Use
of SAGE is allowed on any problem; however, if you do use SAGE you must show your work by
printing out your computations and attaching it to the homework you turn in. Use of LaTeX is
encouraged but not required.

1. (2 points, due Monday, October 3, 11.59 pm.) Go to http://www.surveymonkey.com/s/


JKPS8MY and fill out the survey there.

2. (2 points1 ) Sign up for a SAGE account at http://www.sagenb.org. Click “Help” and then
“Tutorial” and work through the sections “Introduction,” “A guided tour,” and “Program-
ming.” Work through any further sections you feel would be helpful for your use of SAGE.

3. (5 points) Practice computing on elliptic curves. For all of the following, let E be the elliptic
curve y 2 = x3 − 4x. Use of SAGE is highly recommended!

(a) Plot (on separate graphs) E(R) and E(F31 ).


(b) List all of the points of E(F31 ). (You can use projective coordinates if that happens to
be more convenient.)
(c) What is the group structure of E(F31 )? (Specifically, determine k and r1 , . . . , rk > 1
such that E(F31 ) is isomorphic to Zr1 × · · · × Zrk .)
(d) Let P = (1, 11) and Q = (25, 5) on E(F31 ). Find an integer a such that Q = [a]P .
(e) Let p be the smallest prime larger than 2259 . Compute #E(Fp ) (i.e., the order of the
group E(Fp )). Do you notice anything surprising about the group order?

4. (3 points) Let E : y 2 = x3 + Ax + B be an elliptic curve over a field K.

(a) Show that any point on E with y-coordinate equal to zero has order 2.
(b) Suppose A = 0. Show that any point on E with x-coordinate equal to zero has order 3.

5. (6 points) In this exercise we show that it is not so easy to define a group law on an elliptic
curve. Let E be a curve of the form y 2 = x3 + Ax + B defined over a field K. Let O be the
point at infinity on E.
1
Since there’s no way to check that you did this problem, you will get these points no matter what. However, the
things you learn in the tutorial will probably come in handy later.

1
Consider the operation  defined on E(K) as follows: given points P and Q in E(K), neither
equal to O, let L be the line through P and Q (or the tangent line to E at P if P = Q).
Define P  Q to be the third point of L ∩ E, or O if the line L is vertical. Define P  O to
be P for all points P .

(a) Assume (for now) that  does define a group law on E(K). By considering a line that
intersects E at P , Q, and R, show that every point P in E(K) has order at most 2.
(b) Use the previous fact to show that the operation  does not (in general) have a unique
identity element. (What happens when you try to compute P  P for different values
of P ?)
(c) Use the associativity of the real group law on E to show that  is not (in general)
associative.
(d) (Bonus, 2 points) Give an example of an elliptic curve E over a finite field Fq such that
 does define a group law on E(Fq ).

6. (3 points) Washington exercise 2.9.

7. (3 points) Washington exercise 2.16. (You may assume that d 6= 0.)

8. (3 points) Washington exercise 2.17.

9. (4 points) Let E1 : y 2 + y = x3 , E2 : y 2 + y = x3 + 1 and E3 : y 2 + y = x3 + x be elliptic


curves over F2 . Since j(E1 ) = j(E2 ) = j(E3 ) = 0 it follows that there are isomorphisms over
F2 from E1 to E2 and from E1 to E3 . Write down such isomorphisms.

10. (8 points) Consider E : y 2 + y = x3 over F2 . Let u ∈ F2 satisfy u3 = 1, s ∈ F2 satisfy


s4 + s = 0 and t ∈ F2 satisfy t2 + t = s6 .

(a) Show that


φ(x, y) = (u2 x + s2 , y + u2 sx + t)
is an automorphism of E.
(b) Show that every automorphism arises this way and so #Aut(E) = 24.2
(c) Show that if φ ∈ Aut(E) then either φ2 = ±1 or φ3 = ±1.
(d) Show that Aut(E) is non-abelian.

2
If the powers of u and s come out differently in your calculations, you may need to replace u with u2 and/or s
with s2 , which you can do because squaring permutes the solutions to the defining equations for u and s.

You might also like