Factoring very large numbers using a massively parallel computer
Conference
·
OSTI ID:6308089
A good many words have been spoken and written (some by the present authors) about factoring very large numbers. Therefore, the thrust of this paper is a discussion of how the quadratic sieve algorithm has been adapted to work on a 1024-processor hypercube at Sandia National Laboratories. A brief description of the hypercube, an NCUBE/ten, its idiosyncrasies and its power, as well as some comparisons of timings between numbers factored on the CRAY and on the hypercube, are included. 6 refs., 1 tab.
- Research Organization:
- Sandia National Labs., Albuquerque, NM (USA)
- DOE Contract Number:
- AC04-76DP00789
- OSTI ID:
- 6308089
- Report Number(s):
- SAND-89-0581C; CONF-890372-1; ON: DE89008198
- Country of Publication:
- United States
- Language:
- English
Similar Records
Factorization of large integers on a massively parallel computer
Structural analysis on massively parallel computers
Factoring very large numbers using a massively parallel computer
Conference
·
Thu Dec 31 23:00:00 EST 1987
·
OSTI ID:6984916
Structural analysis on massively parallel computers
Conference
·
Wed Jul 30 00:00:00 EDT 2003
· Computing Systems in Engineering
·
OSTI ID:6193022
Factoring very large numbers using a massively parallel computer
Conference
·
Thu Dec 31 23:00:00 EST 1987
·
OSTI ID:7122867