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… 
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… 
2007
2007
LFSR multipliers over GF(2m) defined by all-one polynomial
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
Exploring the design-space for FPGA-based implementation of RSA
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… 
1999
1999
Computing Composed Products of Polynomials
If f(x) and g(x) are polynomials in Fqx] of degrees m and n respectively, then the composed sum of f and g, denoted f g, is the… 
1981
1981
First General-Purpose Electronic Computer
The conception, development, and design of the ENIAC are presented in the context of a causal history. Early influences… 
1972
1972
Computation of Powers of Multivariate Polynomials over the Integers
  • L. E. Heindel
  • Journal of computer and system sciences (Print)
  • 1972
  • Corpus ID: 29658954
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)