Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,715,829 papers from all fields of science
Search
Sign In
Create Free Account
Karatsuba algorithm
Known as:
Karatsuba multiplication
, Karatsuba's algorithm
, The Karatsuba multiplication
Expand
The Karatsuba algorithm is a fast multiplication algorithm. It was discovered by Anatoly Karatsuba in 1960 and published in 1962. It reduces the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
19 relations
Arbitrary-precision arithmetic
Binary logarithm
Carry-save adder
Computational complexity of mathematical operations
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Mastrovito form of Karatsuba Multiplier for All Trinomials
Yin Li
,
Xingpo Ma
,
Yu Zhang
,
Chuanda Qi
IACR Cryptology ePrint Archive
2016
Corpus ID: 18875447
We present a Matrix-vector form of Karatsuba multiplication over GF (2m) generated by an irreducible trinomial. Based on shifted…
Expand
2015
2015
Missing a trick: Karatsuba revisited
Mike Scott
IACR Cryptology ePrint Archive
2015
Corpus ID: 13087295
There are a variety of ways of applying the Karatsuba idea to multi-digit multiplication. These apply particularly well in the…
Expand
2013
2013
Proposals of Multiplication and Inversion Methods in Extension Field for Scalable Asymmetric key and Fast Symmetric key Cryptosystems
K. Nekado
2013
Corpus ID: 17815809
This thesis proposes the Cyclic Vector Multiplication Algorithm (CVMA) for Gauss period Normal Basis (GNB). It is an e cient…
Expand
2013
2013
Design of a High-Speed Matrix Multiplier Based on Balanced Word-Width Decomposition and Karatsuba Multiplication
R. Bhargavi
2013
Corpus ID: 14803124
This paper presents a flexible 2x2 matrix multiplier architecture. The architecture is based on word-width decomposition for…
Expand
2012
2012
Synthesis Comparison of Karatsuba Multiplierusing Polynomial Multiplication, Vedic Multiplier and Classical Multiplier
S. Mishra
,
M. Pradhan
2012
Corpus ID: 817241
In this paper, the authors have compared the efficiency of the Karatsuba multiplier using polynomial multiplication with the…
Expand
2010
2010
Об одной задаче А. А. Карацубы@@@On a Problem of Karatsuba
Сергей Александрович Гриценко
,
Sergey Alexandrovich Gritsenko
2010
Corpus ID: 124303949
2009
2009
Efficient Binary Field Multiplication on a VLIW DSP
Christian Tergino
2009
Corpus ID: 58443666
Modern public-key cryptography relies extensively on modular multiplication with long operands. We investigate the opportunities…
Expand
2009
2009
Fast and Compact ASIC Implementation of SFlash New Signature Scheme
Mohamed M. Abdelhalim
2009
Corpus ID: 11232891
The idea of using multivariate polynomials as public keys has attracted several cryptographers, SFlash signature scheme is a…
Expand
2008
2008
A Technique for Accelerating Characteristic 2 Elliptic Curve Cryptography
S. Gueron
,
M. Kounavis
International Conference on Information…
2008
Corpus ID: 14626560
In this paper we describe a novel approach for speeding up the computations of characteristic 2 elliptic curve cryptography…
Expand
2002
2002
CONCERNING THE KARATSUBA CONJECTURES
M. Garaev
2002
Corpus ID: 117932039
In this note we discuss the Karatsuba conjectures on lower bound estimates for the maximum modulus of the Riemann Zeta-Function…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE