Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
In this paper, we show efficient implementations of binary field multiplication over ARMv8. We exploit an advanced 64-bit… 
2013
2013
This paper presents a low complexity digit-serial GF(2m) multiplier. The proposed architecture use digit-serial combination… 
2013
2013
This thesis proposes the Cyclic Vector Multiplication Algorithm (CVMA) for Gauss period Normal Basis (GNB). It is an e cient… 
2010
2010
In this paper, we present a new method for multiplying polynomials in Chebyshev form. Our approach has two steps. First, the well… 
2010
2010
A Karatsuba-based 64b Galois field multiplier for on-die acceleration of public-key encryption is fabricated in 1.1V, 45nm CMOS… 
2007
2007
Aims. The role of longitudinal structuring of the surrounding corona on the modes of oscillation of a coronal magnetic flux tube… 
2006
2006
Karatsuba discovered the first algorithm that accomplishes multiprecision integer multiplication with complexity below that of… 
2005
2005
The divide-and-conquer method is efficiently used in parallel multiplier over finite field GF(2n). Leone proposed optimal stop… 
2003
2003
Multiplication of long integers is a cornerstone primitive in most cryptosystems. Multiplication for big numbers can be performed…