Factorization of Integers

Honors College Thesis

Public Deposited

Citeable URL: https://ir.library.oregonstate.edu/concern/honors_college_theses/hx11xh31c

Descriptions

Attribute Name	Values
Creator	Simshaw, James
Abstract	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.
License	All rights reserved
Resource Type	Honors College Thesis
Date Available	2008-06-19T18:18:37+00:00
Date Issued	2008-05-30
Degree Level	Bachelor's
Degree Name	Honors Bachelor of Science (H.B.S.)
Degree Field	Mathematics Computer Science
Degree Grantor	Oregon State University
Commencement Year	2008
Advisor	Burton, Robert M., Jr.
Non-Academic Affiliation	Oregon State University. Honors College
Rights Statement	In Copyright
Publisher	Oregon State University
Peer Reviewed	No
Language	English [eng]
Replaces	http://hdl.handle.net/1957/8824

Parents:

This work has no parents.

In Collection:

Thumbnail	Title	Date Uploaded	Visibility	Actions
	Thesis_-Simshaw.pdf	2017-07-29	Public	Download