Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 232,793,514 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
Binary field multiplication on ARMv8
Hwajeong Seo
,
Zhe Liu
,
Y. Nogami
,
Jongseok Choi
,
Howon Kim
Secur. Commun. Networks
2016
Corpus ID: 26266806
In this paper, we show efficient implementations of binary field multiplication over ARMv8. We exploit an advanced 64-bit…
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
2010
2010
A Karatsuba-Based Algorithm for Polynomial Multiplication in Chebyshev Form
Juliano B. Lima
,
D. Panario
,
Qiang Wang
IEEE transactions on computers
2010
Corpus ID: 13267509
In this paper, we present a new method for multiplying polynomials in Chebyshev form. Our approach has two steps. First, the well…
Expand
2010
2010
Dynamic Programming Addition Optimization approach for large size multipliers in FPGAs
Shuli Gao
,
N. Chabini
,
D. Al-Khalili
53rd IEEE International Midwest Symposium on…
2010
Corpus ID: 6384242
In this paper, Dynamic Programming Addition Optimization (DPAO) approach is proposed to realize large size multipliers targeting…
Expand
2010
2010
High Performance GHASH Function for Long Messages
N. Méloni
,
C. Nègre
,
M. A. Hasan
International Conference on Applied Cryptography…
2010
Corpus ID: 15735706
This work presents a new method to compute the GHASH function involved in the Galois/Counter Mode of operation for block ciphers…
Expand
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
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
2006
2006
Reversible Karatsuba's Algorithm
L. Kowada
,
R. Portugal
,
C. Figueiredo
Journal of universal computer science (Online)
2006
Corpus ID: 240565
Karatsuba discovered the first algorithm that accomplishes multiprecision integer multiplication with complexity below that of…
Expand
2005
2005
A Non-redundant and Efficient Architecture for Karatsuba-Ofman Algorithm
N. Chang
,
Chang Han Kim
,
Young-Ho Park
,
Jongin Lim
Information Security Conference
2005
Corpus ID: 5380737
The divide-and-conquer method is efficiently used in parallel multiplier over finite field GF(2n). Leone proposed optimal stop…
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