Factorization of Integers Public

http://ir.library.oregonstate.edu/concern/honors_college_theses/hx11xh31c

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • Factorization of integers is an important aspect of cryptography since it can be used as an attack against some of the common cryptographic methods being used. There are numerous methods in existence for factoring integers. Some of these are faster than others for general numbers, while others work best on a specific category of integers. Currently, factorization takes a long time for large numbers, ensures the security of the cryptographic method.
Resource Type
Date Available
Date Issued
Degree Level
Degree Name
Degree Grantor
Advisor
Non-Academic Affiliation
Keyword
Rights Statement
Publisher
Peer Reviewed
Language
Replaces
Additional Information
  • description.provenance : Submitted by Heather Boren (borenh) on 2008-06-19T18:13:12Z No. of bitstreams: 1 Thesis -Simshaw.pdf: 202186 bytes, checksum: 779788a4a9740041f2d905e69c2f5772 (MD5)
  • description.provenance : Made available in DSpace on 2008-06-19T18:18:37Z (GMT). No. of bitstreams: 1 Thesis -Simshaw.pdf: 202186 bytes, checksum: 779788a4a9740041f2d905e69c2f5772 (MD5)

Relationships

Parents:

This work has no parents.

Last modified

Downloadable Content

Download PDF

Items