-
Institution:
-
Massachusetts Institute of Technology
-
Subject:
-
-
Description:
-
Computationally focused introduction to elliptic curves, with applications to number theory and cryptography. Topics include point-counting, isogenies, pairings, and the theory of complex multiplication. Explores how the rich theory of elliptic curves facilitates the design of efficient algorithms that play a key role in practical applications, including integer factorization, primality proving, and, in particular, elliptic curve cryptography. Students should have a working knowledge of standard algebraic structures (groups, rings, and fields) and computational complexity (big-O notation).
-
Credits:
-
4.00
-
Credit Hours:
-
-
Prerequisites:
-
Prereq: None. Coreq: 18.702, 18.703, or permission of instructor
-
Corequisites:
-
-
Exclusions:
-
-
Level:
-
-
Instructional Type:
-
Lecture
-
Notes:
-
-
Additional Information:
-
-
Historical Version(s):
-
-
Institution Website:
-
-
Phone Number:
-
(617) 253-1000
-
Regional Accreditation:
-
New England Association of Schools and Colleges
-
Calendar System:
-
Four-one-four plan
Detail Course Description Information on CollegeTransfer.Net
Copyright 2006 - 2026 AcademyOne, Inc.