[go: up one dir, main page]

Cavallar, 2000 - Google Patents

Strategies in filtering in the number field sieve

Cavallar, 2000

View PDF
Document ID
1233069999598218823
Author
Cavallar S
Publication year
Publication venue
International Algorithmic Number Theory Symposium

External Links

Snippet

A critical step when factoring large integers by the Number Field Sieve [8] consists of finding dependencies in a huge sparse matrix over the field, using a Block Lanczos algorithm. Both size and weight (the number of non-zero elements) of the matrix critically affect the running …
Continue reading at ir.cwi.nl (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/22—Arrangements for sorting or merging computer data on continuous record carriers, e.g. tape, drum, disc
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
    • G06F7/72—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers using residue arithmetic
    • G06F7/724—Finite field arithmetic
    • G06F7/726—Inversion; Reciprocal calculation; Division of elements of a finite field

Similar Documents

Publication Publication Date Title
Cavallar Strategies in filtering in the number field sieve
Anderson et al. An experimental study of data migration algorithms
Hendrickson et al. Improving the run time and quality of nested dissection ordering
Cantor et al. A new algorithm for factoring polynomials over finite fields
Albers et al. Self-organizing data structures
Indyk A sublinear time approximation scheme for clustering in metric spaces
Pomerance The quadratic sieve factoring algorithm
Achlioptas et al. The asymptotic order of the random k-SAT threshold
Lenstra et al. Factoring with two large primes
Cavallar et al. Factorization of RSA-140 using the number field sieve
JP4669067B2 (en) Dynamic fragment mapping
Wegener BOTTOM-UP-HEAPSORT, a new variant of HEAPSORT beating, on an average, QUICKSORT (if n is not very small)
JP3992495B2 (en) Functional memory based on tree structure
Lenstra et al. Factoring with two large primes
Franke et al. SHARK: A realizable special hardware sieving device for factoring 1024-bit integers
Brodal Fast meldable priority queues
Hightower et al. Implementations of randomized sorting on large parallel machines
Han Improved fast integer sorting in linear space
Al Aswad et al. Individual discrete logarithm with sublattice reduction
Zhang et al. OBMA: Minimizing bitmap data structure with fast and uninterrupted update processing
Kurz LinCode--computer classification of linear codes
Obead et al. On the capacity of private nonlinear computation for replicated databases
Gao et al. FT-INDEX: A distributed indexing scheme for switch-centric cloud storage system
Cavallar MAS-R0012 May 31, 2000
Liskovets et al. Counting circulant graphs of prime-power order by decomposing into orbit enumeration problems