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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

Systemic as well as adipose tissue inflammation contributes to the development of obesity-associated diseases. This thesis…

2016

We study the question of securely multiplying N -bit integers that are stored in binary representation, in the context of…

2014

In this paper, we investigate the Single Instruction Multiple Data (SIMD) extensions of the Intel Xeon Phi, and we analyze the…

2014

Paper proposes optimization of calculation of frequency masking of speech signal for use in real time applications. The…

2014

We consider precise rational-fractional calculations for distributed computing environments with an MPI interface for the…

2012

Modular multiplication is the fundamental operation in most public-key cryptosystem. Therefore, the efficiency of modular…

2012

Since the 1980s, teacher education has undergone major reforms in most developed societies, often directly connected to a process…

2011

Some hints and tricks to automatically obtain high degree Toom-Cook implementations, i.e. functions for integer or polynomial…

2009

The use of Toom-Cook sub-quadratic polynomial multiplication was recently shown to be possible also when the coefficient field…

2007

This paper focuses on Reed-Solomon (RS) codes, which are the most widespread classical error correcting codes. Recently, we have…