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 2001-45

Entry type

techreport

Abstract

This paper deals with variations of the quadratic sieve integer factoring algorithm. We describe what we believe is the first implementation of the hypercube multiple polynomial quadratic sieve with two large primes. We have used this program to factor many integers with up to 116 digits. Our program appears to be many times faster than the (non-hypercube) multiple polynomial quadratic sieve with two large primes.

Download

PDF

URL

https://www.cerias.purdue.edu/papers/archive/2001-45.ps

Institution

Purdue University

Key alpha

Quadratic Sieve

Affiliation

CS and CERIAS

Publication Date

1900-01-01

Contents

1 Introduction 2 Overview 3 Implementation details 4 Results 5 Conclusion References

Keywords

Quadratic sieve, Hypercube quadratic sieve, self-initializing quadratic sieve, multiple polynomial quadratic sieve, two large primes

Language

English

Subject

none

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.