Karatsuba algorithm

Known as: Karatsuba multiplication, Karatsuba's algorithm, The Karatsuba multiplication 
The Karatsuba algorithm is a fast multiplication algorithm. It was discovered by Anatoly Karatsuba in 1960 and published in 1962. It reduces the… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Binary multiplication is an important operation in many high power computing applications and floating point multiplier designs… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Is this relevant?
2013
2013
High speed modular multiplier is a primary requirement of multi-core processors because of critical applications such as security… (More)
  • table I
  • figure 3
  • figure 2
  • figure 5
  • figure 4
Is this relevant?
2013
2013
This paper presents an efficient floating point multiplier using Karatsuba algorithm. Digital signal processing algorithms and… (More)
  • figure 1
  • figure 4
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
2010
2010
Modular multiplication of long integers is an important building block for cryptographic algorithms. Although several FPGA… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • table I
Is this relevant?
2008
2008
The paper presents an architecture to implement Karatsuba Multiplier on an FPGA platform. Detailed analysis has been carried out… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
2007
2007
Algorithms in cryptosystem such as RSA and Diffie-Hellman require the large integer multiplication. This paper introduces… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
In this work we generalize the classical Karatsuba Algorithm (KA) for polynomial multiplication to (i) polynomials of arbitrary… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
2006
2006
Karatsuba discovered the first algorithm that accomplishes multiprecision integer multiplication with complexity below that of… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
2005
Highly Cited
2005
The Karatsuba-Ofman algorithm starts with a way to multiply two 2-term (i.e., linear) polynomials using three scalar… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Elliptic curves are the basis for a relative new class of public-key schemes. It is predicted that elliptic curves will replace… (More)
Is this relevant?