18.783 Elliptic Curves, Spring 2019

This graduate-level course is a computationally focused introduction to elliptic curves, with applications to number theory and cryptography.

Bibliographic Details
Main Author: Sutherland, Andrew
Other Authors: Massachusetts Institute of Technology. Department of Mathematics
Format: Learning Object
Language:en-US
Published: 2023
Subjects:
Online Access:https://hdl.handle.net/1721.1/148618
_version_ 1826207178645569536
author Sutherland, Andrew
author2 Massachusetts Institute of Technology. Department of Mathematics
author_facet Massachusetts Institute of Technology. Department of Mathematics
Sutherland, Andrew
author_sort Sutherland, Andrew
collection MIT
description This graduate-level course is a computationally focused introduction to elliptic curves, with applications to number theory and cryptography.
first_indexed 2024-09-23T13:45:16Z
format Learning Object
id mit-1721.1/148618
institution Massachusetts Institute of Technology
language en-US
last_indexed 2025-03-10T11:41:22Z
publishDate 2023
record_format dspace
spelling mit-1721.1/1486182025-02-24T15:02:15Z 18.783 Elliptic Curves, Spring 2019 Elliptic Curves Sutherland, Andrew Massachusetts Institute of Technology. Department of Mathematics elliptic curves number theory cryptography point-counting isogenies pairings theory of complex multiplication integer factorization primality proving elliptic curve cryptography modular curves Fermat's Last Theorem This graduate-level course is a computationally focused introduction to elliptic curves, with applications to number theory and cryptography. 2023-03-20T14:06:44Z 2023-03-20T14:06:44Z 2019-06 2023-03-20T14:06:52Z Learning Object 18.783-Spring2019 18.783 IMSCP-MD5-18d0780ecfcdf4e71ff83c901933e4e8 https://hdl.handle.net/1721.1/148618 en-US This site (c) Massachusetts Institute of Technology 2023. Content within individual courses is (c) by the individual authors unless otherwise noted. The Massachusetts Institute of Technology is providing this Work (as defined below) under the terms of this Creative Commons public license ("CCPL" or "license") unless otherwise noted. The Work is protected by copyright and/or other applicable law. Any use of the work other than as authorized under this license is prohibited. By exercising any of the rights to the Work provided here, You (as defined below) accept and agree to be bound by the terms of this license. The Licensor, the Massachusetts Institute of Technology, grants You the rights contained here in consideration of Your acceptance of such terms and conditions. Attribution-NonCommercial-ShareAlike 3.0 Unported http://creativecommons.org/licenses/by-nc-sa/3.0/ text/plain text/html image/jpeg image/jpeg text/html application/pdf application/pdf application/pdf application/pdf application/pdf application/pdf application/pdf application/pdf application/pdf application/pdf application/pdf application/pdf text/html application/pdf application/pdf application/pdf application/pdf application/pdf application/pdf application/pdf application/pdf application/pdf application/pdf application/pdf application/pdf application/pdf application/pdf application/pdf application/pdf application/pdf application/pdf application/pdf application/pdf application/pdf application/pdf application/pdf application/pdf text/html application/pdf application/pdf text/html text/html text/html image/png image/jpeg image/png text/html text/html application/octet-stream application/octet-stream application/octet-stream application/octet-stream application/octet-stream application/octet-stream application/octet-stream application/octet-stream application/octet-stream application/octet-stream application/octet-stream application/octet-stream application/octet-stream application/octet-stream application/octet-stream application/octet-stream application/octet-stream application/octet-stream application/octet-stream application/octet-stream application/octet-stream application/octet-stream application/octet-stream application/octet-stream application/octet-stream text/css text/css text/css text/css text/css text/css text/css text/css text/css text/css text/css text/css text/css text/css text/css text/css text/html image/png image/png image/png image/png image/gif image/png image/png image/png image/jpeg image/gif image/png image/png image/png image/gif image/png image/png image/png image/png image/png image/png image/gif image/png image/png image/gif image/gif image/png image/png image/png image/png image/png image/png image/png image/png image/png image/gif image/jpeg image/gif image/png image/jpeg image/png image/png image/png image/png image/png image/png image/png image/png image/png image/gif image/png image/png image/jpeg image/gif image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/gif image/gif image/gif image/gif image/gif image/gif image/gif image/gif image/gif image/gif image/gif image/gif image/png image/gif application/octet-stream image/gif image/gif image/png image/gif image/gif image/gif image/png image/png application/octet-stream image/gif image/gif image/gif image/gif image/png image/gif image/gif application/octet-stream image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png image/png application/rdf+xml; charset=utf-8 text/html image/png image/png image/jpeg image/png image/png image/png image/png image/png text/html text/html Spring 2019
spellingShingle elliptic curves
number theory
cryptography
point-counting
isogenies
pairings
theory of complex multiplication
integer factorization
primality proving
elliptic curve cryptography
modular curves
Fermat's Last Theorem
Sutherland, Andrew
18.783 Elliptic Curves, Spring 2019
title 18.783 Elliptic Curves, Spring 2019
title_full 18.783 Elliptic Curves, Spring 2019
title_fullStr 18.783 Elliptic Curves, Spring 2019
title_full_unstemmed 18.783 Elliptic Curves, Spring 2019
title_short 18.783 Elliptic Curves, Spring 2019
title_sort 18 783 elliptic curves spring 2019
topic elliptic curves
number theory
cryptography
point-counting
isogenies
pairings
theory of complex multiplication
integer factorization
primality proving
elliptic curve cryptography
modular curves
Fermat's Last Theorem
url https://hdl.handle.net/1721.1/148618
work_keys_str_mv AT sutherlandandrew 18783ellipticcurvesspring2019
AT sutherlandandrew ellipticcurves