The Center for Education and Research in Information Assurance and Security (CERIAS)

The Center for Education and Research in
Information Assurance and Security (CERIAS)
Center for Education and Research in Information Assurance and Security

Implementing the Hypercube Quadratic Sieve with Two Large Primes

Download

Download PDF Document
PDF

Author

Brian Carrier and Samuel S. Wagstaff, Jr.

Tech report number

CERIAS TR 2004-01

Entry type

techreport

Abstract

An implementation of the title program is described. It was used to factor many integers with up to 135 digits. Our program is much faster than the (non-hypercube) multiple polynomial quadratic sieve with two large primes.

Download

PDF

URL

http://www.cerias.purdue.edu/homes/ssw/qs4.{ps,pdf}

Institution

Purdue CS

Key alpha

Wagstaff

Note

The new Tech Report in 2004 updates, amplifies and replaces an earlier CERIAS Tech Report with the same title and authors, TR 2001-45.

Affiliation

CERIAS

Publication Date

1900-01-01

Subject

Hypercube multiple polynomial quadraticsieve integer factoring algorithm

BibTex-formatted data

To refer to this entry, you may select and copy the text below and paste it into your BibTex document. Note that the text may not contain all macros that BibTex supports.