Skip to search formSkip to main contentSkip to account menu

Toom–Cook multiplication

Known as: Toom-Cook, Toom-Cook algorithm, Toom3 
Toom–Cook, sometimes known as Toom-3, named after Andrei Toom, who introduced the new algorithm with its low complexity, and Stephen Cook, who… 
Wikipedia

Related topics

Related topics

13 relations
Andrei ToomArbitrary-precision arithmeticBinary splittingComputational complexity of mathematical operations

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Time-memory trade-off in Toom-Cook multiplication: an application to module-lattice based cryptography
Since the introduction of the ring-learning with errors problem, the number theoretic transform (NTT) based polynomial… 
2019
2019
High-Speed ECC Processor Over NIST Prime Fields Applied With Toom–Cook Multiplication
In this paper, a high-speed elliptic curve cryptography (ECC) processor specialized for primes recommended by the National… 
2018
2018
Quantum Circuits for Toom-Cook Multiplication
In this paper, we report efficient quantum circuits for integer multiplication using Toom-Cook algorithm. By analysing the… 
2016
2016
Toom-Cook Multiplication: Some Theoretical and Practical Aspects
Toom-Cook multiprecision multiplication is a well-known multiprecision multiplication method, which can make use of… 
2012
2012
Tripartite Modular Multiplication using Toom-Cook Multiplication
Modular multiplication is the fundamental operation in most public-key cryptosystem. Therefore, the efficiency of modular… 
2011
2011
Tripartite modular multiplication
Highly Cited
2009
Highly Cited
2009
Efficient Acceleration of Asymmetric Cryptography on Graphics Hardware
Graphics processing units (GPU) are increasingly being used for general purpose computing. We present implementations of large… 
Highly Cited
2008
Highly Cited
2008
A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
We improve our proposal of a new variant of the McEliece cryptosystem based on QC-LDPC codes. The original McEliece cryptosystem… 
Highly Cited
2007
Highly Cited
2007
Towards Optimal Toom-Cook Multiplication for Univariate and Multivariate Polynomials in Characteristic 2 and 0
Toom-Cook strategy is a well-known method for building algorithms to efficiently multiply dense univariate polynomials… 
Highly Cited
2007
Highly Cited
2007
Integer and polynomial multiplication: towards optimal toom-cook matrices
Karatsuba and Toom-Cook are well-known methods used to multiply efficiently long integers. There have been different proposal… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License