Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,650,976 papers from all fields of science
Search
Sign In
Create Free Account
Toom–Cook multiplication
Known as:
Toom-Cook
, Toom-Cook algorithm
, Toom3
Expand
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
Create Alert
Alert
Related topics
Related topics
13 relations
Andrei Toom
Arbitrary-precision arithmetic
Binary splitting
Computational 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
J. Mera
,
A. Karmakar
,
I. Verbauwhede
IACR Cryptol. ePrint Arch.
2020
Corpus ID: 212423365
Since the introduction of the ring-learning with errors problem, the number theoretic transform (NTT) based polynomial…
Expand
2019
2019
High-Speed ECC Processor Over NIST Prime Fields Applied With Toom–Cook Multiplication
Jinnan Ding
,
Shuguo Li
,
Zhen Gu
IEEE Transactions on Circuits and Systems I…
2019
Corpus ID: 59620394
In this paper, a high-speed elliptic curve cryptography (ECC) processor specialized for primes recommended by the National…
Expand
2018
2018
Quantum Circuits for Toom-Cook Multiplication
Srijit Dutta
,
Debjyoti Bhattacharjee
,
A. Chattopadhyay
Physical Review A
2018
Corpus ID: 19218492
In this paper, we report efficient quantum circuits for integer multiplication using Toom-Cook algorithm. By analysing the…
Expand
2016
2016
Toom-Cook Multiplication: Some Theoretical and Practical Aspects
M. Kronenburg
ArXiv
2016
Corpus ID: 15154847
Toom-Cook multiprecision multiplication is a well-known multiprecision multiplication method, which can make use of…
Expand
2012
2012
Tripartite Modular Multiplication using Toom-Cook Multiplication
Amar Mandal
,
Rupali Syal
2012
Corpus ID: 14676036
Modular multiplication is the fundamental operation in most public-key cryptosystem. Therefore, the efficiency of modular…
Expand
2011
2011
Tripartite modular multiplication
K. Sakiyama
,
Miroslav Knezevic
,
Junfeng Fan
,
B. Preneel
,
I. Verbauwhede
Integr.
2011
Corpus ID: 3754261
Highly Cited
2009
Highly Cited
2009
Efficient Acceleration of Asymmetric Cryptography on Graphics Hardware
Owen Harrison
,
J. Waldron
AFRICACRYPT
2009
Corpus ID: 11956316
Graphics processing units (GPU) are increasingly being used for general purpose computing. We present implementations of large…
Expand
Highly Cited
2008
Highly Cited
2008
A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
M. Baldi
,
Marco Bodrato
,
F. Chiaraluce
SCN
2008
Corpus ID: 6514505
We improve our proposal of a new variant of the McEliece cryptosystem based on QC-LDPC codes. The original McEliece cryptosystem…
Expand
Highly Cited
2007
Highly Cited
2007
Towards Optimal Toom-Cook Multiplication for Univariate and Multivariate Polynomials in Characteristic 2 and 0
Marco Bodrato
WAIFI
2007
Corpus ID: 8366552
Toom-Cook strategy is a well-known method for building algorithms to efficiently multiply dense univariate polynomials…
Expand
Highly Cited
2007
Highly Cited
2007
Integer and polynomial multiplication: towards optimal toom-cook matrices
Marco Bodrato
,
A. Zanoni
ISSAC '07
2007
Corpus ID: 11810198
Karatsuba and Toom-Cook are well-known methods used to multiply efficiently long integers. There have been different proposal…
Expand
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