Syllabus ( MATH 662 )
|
Basic information
|
|
Course title: |
Elliptic Curves |
Course code: |
MATH 662 |
Lecturer: |
Assoc. Prof. Dr. Fatma KARAOĞLU CEYHAN
|
ECTS credits: |
7.5 |
GTU credits: |
3 (3+0+0) |
Year, Semester: |
1/2, Fall and Spring |
Level of course: |
Third Cycle (Doctoral) |
Type of course: |
Area Elective
|
Language of instruction: |
English
|
Mode of delivery: |
Face to face , Group study
|
Pre- and co-requisites: |
none |
Professional practice: |
No |
Purpose of the course: |
Elliptic curves are especially important in number theory. They also find applications in elliptic curve cryptography (ECC) and integer factorization. The aim of the course is to introduce the theory of elliptic curves and the application areas of elliptic curves . Moreover, to help student to see the connection between the theory of elliptic curves and some important areas of mathematics such as number theory and cryptography. In this course students will learn the basics of elliptic curves so that they can develop their knowledge on the theory of elliptic curves by themself. |
|
|
|
Learning outcomes
|
|
Upon successful completion of this course, students will be able to:
-
Recognize elliptic curves and explain the equations which define these curves.
Contribution to Program Outcomes
-
Define and manipulate advanced concepts of Mathematics in a specialized way
-
Relate mathematics to other disciplines and develop mathematical models for multidisciplinary problems
-
Understand relevant research methodologies and techniques and their appropriate application within his/her research field,
-
Develop mathematical, communicative, problem-solving, brainstorming skills.
Method of assessment
-
Homework assignment
-
Apply the j-invariant of elliptic curves, Tate modul, endomorphism ring and automorphism group.
Contribution to Program Outcomes
-
Define and manipulate advanced concepts of Mathematics in a specialized way
-
Relate mathematics to other disciplines and develop mathematical models for multidisciplinary problems
-
Understand relevant research methodologies and techniques and their appropriate application within his/her research field,
-
Acquire scientific knowledge and work independently,
-
Work effectively in multi-disciplinary research teams
-
Continuously develop their knowledge and skills in order to adapt to a rapidly developing technological environment
-
Develop mathematical, communicative, problem-solving, brainstorming skills.
Method of assessment
-
Written exam
-
Homework assignment
-
Detect some special transformations between elliptic curves, isogenies, the algorithmic aspects of elliptic curves and elliptic curve cryptography.
Contribution to Program Outcomes
-
Define and manipulate advanced concepts of Mathematics in a specialized way
-
Relate mathematics to other disciplines and develop mathematical models for multidisciplinary problems
-
Understand relevant research methodologies and techniques and their appropriate application within his/her research field,
-
Acquire scientific knowledge and work independently,
-
Work effectively in multi-disciplinary research teams
-
Continuously develop their knowledge and skills in order to adapt to a rapidly developing technological environment
-
Develop mathematical, communicative, problem-solving, brainstorming skills.
Method of assessment
-
Written exam
-
Homework assignment
|
|
Contents
|
|
Week 1: |
Algebraic varieties |
Week 2: |
Algebraic curves |
Week 3: |
Elliptic curves, Weierstrass Equations, the group law |
Week 4: |
Other equations for elliptic curves: Legendre equations, cubic and quartic equations |
Week 5: |
j-invariant and Isomorphisms |
Week 6: |
j-invariant and Isomorphisms (continued) |
Week 7: |
Isogenies, Endomorphism ring, Automorphism group, Torsion points |
Week 8: |
Weil pairing, Elliptic curves over finite fields |
Week 9: |
Elliptic curves over complex numbers |
Week 10: |
Algorithmic aspects of elliptic curves, Double-and -Add Algorithms |
Week 11: |
Counting the number of points on elliptic curves |
Week 12: |
Elliptic curve cryptography |
Week 13: |
Elliptic curve cryptography |
Week 14: |
Elliptic curve cryptography |
Week 15*: |
- |
Week 16*: |
Final Exam. |
Textbooks and materials: |
The Arithmetic of Elliptic Curves, 2nd Edition, Joseph H. Silverman.
|
Recommended readings: |
Elliptic Curves, 2nd Edition, Lawrence C. Washington. |
|
* Between 15th and 16th weeks is there a free week for students to prepare for final exam.
|
|
|
|
Assessment
|
|
|
Method of assessment |
Week number |
Weight (%) |
|
Mid-terms: |
5 |
30 |
Other in-term studies: |
|
0 |
Project: |
|
0 |
Homework: |
2,3,4,6,7,8,9,10,11,12 |
30 |
Quiz: |
|
0 |
Final exam: |
16 |
40 |
|
Total weight: |
(%) |
|
|
|
Workload
|
|
|
Activity |
Duration (Hours per week) |
Total number of weeks |
Total hours in term |
|
Courses (Face-to-face teaching): |
3 |
14 |
|
Own studies outside class: |
4 |
14 |
|
Practice, Recitation: |
0 |
0 |
|
Homework: |
6 |
10 |
|
Term project: |
0 |
0 |
|
Term project presentation: |
0 |
0 |
|
Quiz: |
0 |
0 |
|
Own study for mid-term exam: |
10 |
1 |
|
Mid-term: |
2 |
1 |
|
Personal studies for final exam: |
15 |
1 |
|
Final exam: |
2 |
1 |
|
|
|
Total workload: |
|
|
|
Total ECTS credits: |
* |
|
* ECTS credit is calculated by dividing total workload by 25. (1 ECTS = 25 work hours)
|
|
|
-->