Integer and polynomial multiplication: towards optimal Toom-Cook matrices
From MaRDI portal
(Redirected from Publication:5301645)
Recommendations
- Iterative Toom-Cook methods for very unbalanced long integer multiplication
- scientific article; zbMATH DE number 6520921
- Towards Optimal Toom-Cook Multiplication for Univariate and Multivariate Polynomials in Characteristic 2 and 0
- The I/O complexity of Toom-Cook integer multiplication
- Faster integer multiplication
Cited in
(13)- Fast NEON-based multiplication for lattice-based NIST post-quantum cryptography finalists
- Saber on ESP32
- Iterative Toom-Cook methods for very unbalanced long integer multiplication
- A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
- Code Generation for Polynomial Multiplication
- The Karatsuba integer middle product
- A Why3 proof of GMP algorithms
- The I/O complexity of Toom-Cook integer multiplication
- Towards Optimal Toom-Cook Multiplication for Univariate and Multivariate Polynomials in Characteristic 2 and 0
- Multiplication of polynomials modulo \(x^n\)
- A strategy to optimize the complexity of Chudnovsky-type algorithms over the projective line
- Fast in-place accumulation
- Towards a modern LLL implementation
This page was built for publication: Integer and polynomial multiplication: towards optimal Toom-Cook matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301645)
