Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

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

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… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
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… Expand
  • figure 1
  • figure 2
  • table II
  • figure 3
  • figure 4
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… Expand
  • table 1
  • table 2
  • figure 1
  • figure 2
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… Expand
2011
2011
Tripartite modular multiplication
This paper presents a new modular multiplication algorithm that allows one to implement modular multiplications efficiently. It… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2009
2009
Notes on Low Degree Toom-Cook Multiplication with Small Characteristic
The use of Toom-Cook sub-quadratic polynomial multiplication was recently shown to be possible also when the coefficient field… Expand
  • figure 4
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… Expand
  • table 1
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… Expand
2007
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… Expand
  • table 1
  • figure 1
2007
2007
Applications of Fast Truncated Multiplication in Cryptography
  • L. Hars
  • EURASIP J. Embed. Syst.
  • 2007
    • Corpus ID: 9164846
Truncated multiplications compute truncated products, contiguous subsequences of the digits of integer products. For an n-digit… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
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
ACCEPT & CONTINUE