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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Since the introduction of the ring-learning with errors problem, the number theoretic transform (NTT) based polynomial… 
2019
2019
In this paper, a high-speed elliptic curve cryptography (ECC) processor specialized for primes recommended by the National… 
2018
2018
In this paper, we report efficient quantum circuits for integer multiplication using Toom-Cook algorithm. By analysing the… 
2016
2016
Toom-Cook multiprecision multiplication is a well-known multiprecision multiplication method, which can make use of… 
2012
2012
Modular multiplication is the fundamental operation in most public-key cryptosystem. Therefore, the efficiency of modular… 
Highly Cited
2009
Highly Cited
2009
Graphics processing units (GPU) are increasingly being used for general purpose computing. We present implementations of large… 
Highly Cited
2008
Highly Cited
2008
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
Toom-Cook strategy is a well-known method for building algorithms to efficiently multiply dense univariate polynomials… 
Highly Cited
2007
Highly Cited
2007
Karatsuba and Toom-Cook are well-known methods used to multiply efficiently long integers. There have been different proposal…