Integer and polynomial multiplication: towards optimal Toom-Cook matrices

zbMATH Open1190.68084MaRDI QIDQ5301645FDOQ5301645

Authors: Marco Bodrato, Alberto Zanoni 

Publication date: 20 January 2009

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

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cited In (11)

• The I/O complexity of Toom-Cook integer multiplication
• Code Generation for Polynomial Multiplication
• Fast NEON-based multiplication for lattice-based NIST post-quantum cryptography finalists
• The Karatsuba integer middle product
• Multiplication of polynomials modulo \(x^n\)
• A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
• A strategy to optimize the complexity of Chudnovsky-type algorithms over the projective line
• Iterative Toom-Cook methods for very unbalanced long integer multiplication
• Towards Optimal Toom-Cook Multiplication for Univariate and Multivariate Polynomials in Characteristic 2 and 0
• Saber on ESP32
• A Why3 proof of GMP algorithms

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)