A design for a number theory package with an optimized trial division routine

Authors:
M. C. Wunderlich;J. L. Selfridge
Affiliations:
Northern Illinois Univ., DeKalb;Northern Illinois Univ., DeKalb
Venue:
Communications of the ACM
Year:
1974

Citing 2
Cited 3

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

An integrated parallel GNFS algorithm for integer factorization based on Linbox Montgomery block Lanczos method over GF(2)

Computers & Mathematics with Applications
A parallel GNFS algorithm based on a reliable look-ahead block lanczos method for integer factorization

EUC'06 Proceedings of the 2006 international conference on Embedded and Ubiquitous Computing
A parallel GNFS algorithm with the biorthogonal block lanczos method for integer factorization

ATC'06 Proceedings of the Third international conference on Autonomic and Trusted Computing

Quantified Score

Hi-index	48.22

Visualization

Abstract

A number theory package is described which uses doubly linked list structures for storing multiprecise integers. The package has been coded in IBM's Basic Assembly Language and makes heavy use of the macro language and conditional assembly. An optimally coded trial division routine is also described which can be used to determine the unique factorization of large integers.