Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

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

2018

2018

In this paper, we report efficient quantum circuits for integer multiplication using Toom-Cook algorithm. By analysing the… Expand

2016

2016

Toom-Cook multiprecision multiplication is a well-known multiprecision multiplication method, which can make use of… Expand

2012

2012

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

2011

2011

This paper presents a new modular multiplication algorithm that allows one to implement modular multiplications efficiently. It… Expand

2009

2009

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

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

Highly Cited

2007

Highly Cited

2007

Toom-Cook strategy is a well-known method for building algorithms to efficiently multiply dense univariate polynomials… Expand

2007

2007

Karatsuba and Toom-Cook are well-known methods used to multiply efficiently long integers. There have been different proposal… Expand

2007

2007

Truncated multiplications compute truncated products, contiguous subsequences of the digits of integer products. For an n-digit… Expand