Discrete weighted transforms and large-integer arithmetic

@article{Crandall1994DiscreteWT,
  title={Discrete weighted transforms and large-integer arithmetic},
  author={R. Crandall and B. Fagin},
  journal={Mathematics of Computation},
  year={1994},
  volume={62},
  pages={305-324}
}
It is well known that Discrete Fourier Transform (DFT) techniques may be used to multiply large integers. We introduce the concept of Discrete Weighted Transforms (DWTs) which, in certain situations, substantially improve the speed of multiplication by obviating costly zero-padding of digits. In particular, when arithmetic is to be performed modulo Fermât Numbers 22"1 + 1 , or Mersenne Numbers 29 1 , weighted transforms effectively reduce FFT run lengths. We indicate how these ideas can be… Expand
86 Citations
Rapid multiplication modulo the sum and difference of highly composite numbers
  • 24
  • PDF
Some Parallel Algorithms for Integer Factorisation
  • 30
  • PDF
Spectral arithmetic in Montgomery modular multiplication
  • Highly Influenced
Fast convolutions meet Montgomery
  • 6
  • PDF
Recent Progress and Prospects for Integer Factorisation Algorithms
  • 59
  • PDF
Area-Time Efficient Architecture of FFT-Based Montgomery Multiplication
  • 12
  • Highly Influenced
  • PDF
Parallel implementation of multiple-precision arithmetic and 2, 576, 980, 370, 000 decimal digits of pi calculation
  • 9
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 18 REFERENCES
Large Integer Multiplication on Hypercubes
  • B. Fagin
  • Computer Science
  • J. Parallel Distributed Comput.
  • 1992
  • 9
The use of finite fields to compute convolutions
  • 171
Real-valued fast Fourier transform algorithms
  • 439
Parameter determination for complex number-theoretic transforms using cyclotomic polynomials
  • 15
  • PDF
The fast Fourier transform in a finite field
  • 380
  • PDF
IRREGULAR PRIMES TO ONE MILLION
  • 25
  • PDF
Speeding the Pollard and elliptic curve methods of factorization
  • 1,148
  • Highly Influential
  • PDF
A Stochastic Roundoff Error Analysis for the Fast Fourier Transform
  • 25
  • PDF
FIR filtering by the modified Fermat number transform
  • W. Li, A. Peterson
  • Mathematics, Computer Science
  • IEEE Trans. Acoust. Speech Signal Process.
  • 1990
  • 19
...
1
2
...