The Elliptic Curve Method and Other Integer Factorization Algorithms Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/m326m241m

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • The goal of this paper is to describe the Elliptic Curve Method(ECM), an integer factorization algorithm first proposed by Lenstra. Before describing this algorithm, we first discuss some preliminaries. In Chapter 2, we prove some elementary results from number theory and explicitly describe the RSA algorithm. In Chapter 3, we describe several factorization algorithms, including Pollard's Rho algorithm and the Quadratic Sieve. In Chapter 4, we discuss the algebraic properties of elliptic curves and the ECM. In Chapter 5, we discuss how performing the ECM with a curve in Montgomery form reduces computations. We conclude Chapter 5 by discussing some recent developments of the ECM.
Resource Type
Date Available
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Academic Affiliation
Rights Statement
Language
Replaces
Additional Information
  • description.provenance : Approved for entry into archive by Sue Kunda(sue.kunda@oregonstate.edu) on 2012-05-02T05:01:29Z (GMT) No. of bitstreams: 1WrightJohnM2012.PDF: 344780 bytes, checksum: 2650ed2976d7c270b3074b44480881e5 (MD5)
  • description.provenance : Submitted by John Wright (wrightjo@onid.orst.edu) on 2012-04-26T08:25:25ZNo. of bitstreams: 1WrightJohnM2012.PDF: 344780 bytes, checksum: 2650ed2976d7c270b3074b44480881e5 (MD5)
  • description.provenance : Made available in DSpace on 2012-05-02T05:01:29Z (GMT). No. of bitstreams: 1WrightJohnM2012.PDF: 344780 bytes, checksum: 2650ed2976d7c270b3074b44480881e5 (MD5)

Relationships

Parents:

This work has no parents.

Last modified

Downloadable Content

Download PDF

Items