A GMP-based implementation of Schönhage-Strassen's large integer multiplication algorithm
From MaRDI portal
Publication:5301666
zbMATH Open1190.68088MaRDI QIDQ5301666FDOQ5301666
Authors: Pierrick Gaudry, Alexander Kruppa, Paul Zimmermann 
Publication date: 20 January 2009
Recommendations
- Research on large integer multiplication Schönhage-Strassen algorithm's multi-core parallelization
- A rigorous extension of the Schönhage-Strassen integer multiplication algorithm using complex interval arithmetic
- Large integer multiplication on hypercubes
- More on squaring and multiplying large integers
- Integer multiplication in time \(O(n\log n)\)
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16)
Cited In (12)
- Faster Multiplication in GF(2)[x]
- Schönhage-Strassen algorithm with MapReduce for multiplying terabit integers
- Research on large integer multiplication Schönhage-Strassen algorithm's multi-core parallelization
- Large integer multiplication on hypercubes
- Integer multiplication in time \(O(n\log n)\)
- Practical cryptanalysis of ISO 9796-2 and EMV signatures
- A multimodular algorithm for computing Bernoulli numbers
- Implementation of the DKSS algorithm for multiplication of large numbers
- A rigorous extension of the Schönhage-Strassen integer multiplication algorithm using complex interval arithmetic
- Fast integer multiplication using generalized Fermat primes
- Complexity of computation in finite fields
- Efficient Multiplication of Somewhat Small Integers Using Number-Theoretic Transforms
Uses Software
This page was built for publication: A GMP-based implementation of Schönhage-Strassen's large integer multiplication algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301666)
