Skip to search formSkip to main contentSkip to account menu

Multiplication algorithm

Known as: Multiplication algorithms, FFT multiplication, Shift and add algorithm 
A multiplication algorithm is an algorithm (or method) to multiply two numbers. Depending on the size of the numbers, different algorithms are in use… 
Wikipedia (opens in a new tab)

Related topics

Related topics

46 relations
ACC0ARM Cortex-MAlgorithmAnalog computer

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Faster Software for Fast Endomorphisms
GLV curves Gallant et al. have performance advantages over standard elliptic curves, using half the number of point doublings for… 
2015
2015
Dual-mode double precision / two-parallel single precision floating point multiplier architecture
Floating point multiplication is an integral part of any contemporary computing system. This paper presents a configurable dual… 
Highly Cited
2009
Highly Cited
2009
Arithmetic Circuits of Redundant SUT-RNS
The residue number system (RNS) is suitable for implementing high-speed digital processing devices because it supports parallel… 
2008
2008
Montgomery exponent architecture based on programmable cellular automata
2007
2007
LFSR multipliers over GF(2m) defined by all-one polynomial
2007
2007
Area-efficient high-speed 3D DWT processor architecture
An area-efficient high-throughput architecture based on distributed arithmetic is proposed for 3D discrete wavelet transform (DWT… 
2005
2005
Impulse response analysis for several digital tomosynthesis mammography reconstruction algorithms
Digital tomosynthesis mammography algorithms allow reconstructions of arbitrary planes in the breast from limited-angle series of… 
2004
2004
Defeating Countermeasures Based on Randomized BSD Representations
The recent development of side channel attacks has lead implementers to use increasingly sophisticated countermeasures in… 
Highly Cited
2002
Highly Cited
2002
Parallel scalar multiplication on general elliptic curves over Fp hedged against Non-Differential Side-Channel Attacks
. Abstract. For speeding up elliptic curve scalar multiplication and making it secure against side-channel attacks such as timing… 
1992
1992
Efficient Matrix Multiplication on SIMD Computers
Efficient algorithms are described for matrix multiplication on SIMD computers. SIMD implementations of Winograd’s algorithm are… 
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)