Discrete Weighted Transforms and Large-Integer Arithmetic
From MaRDI portal
Publication:4286602
DOI10.2307/2153411zbMATH Open0839.11065OpenAlexW2045826589WikidataQ59445435 ScholiaQ59445435MaRDI QIDQ4286602FDOQ4286602
Authors: Barry S. Fagin, Richard Crandall 
Publication date: 19 June 1996
Full work available at URL: https://doi.org/10.2307/2153411
Recommendations
Congruences; primitive roots; residue systems (11A07) Factorization (11Y05) Numerical methods for discrete and fast Fourier transforms (65T50) Factorization; primality (11A51) Primality (11Y11)
Cites Work
- Title not available (Why is that?)
- Fast multiplication of large numbers
- Computational Complexity of Fourier Transforms Over Finite Fields
- Speeding the Pollard and Elliptic Curve Methods of Factorization
- Parameter Determination for Complex Number-Theoretic Transforms Using Cyclotomic Polynomials
- The use of finite fields to compute convolutions
- The Fast Fourier Transform in a Finite Field
- Title not available (Why is that?)
- Fast Fourier transform and convolution algorithms
- Irregular Primes to One Million
- FIR filtering by the modified Fermat number transform
- A Stochastic Roundoff Error Analysis for the Fast Fourier Transform
- Large integer multiplication on hypercubes
- Roundoff Error Analysis of the Fast Fourier Transform
- The Twentieth Fermat Number is Composite
Cited In (26)
- Three new factors of Fermat numbers
- Complexity analysis of algorithm for multiplication of superlarge numbers based on Walsh coefficients
- Rapid multiplication modulo the sum and difference of highly composite numbers
- Fast convolutions meet Montgomery
- Faster integer multiplication using short lattice vectors
- Distribution of generalized Fermat prime numbers
- Parallel implementation of multiple-precision arithmetic and 2,576,980,370,000 decimal digits of \(\pi \) calculation
- Title not available (Why is that?)
- Title not available (Why is that?)
- The twenty-fourth Fermat number is composite
- Balanced non-adjacent forms
- Even faster integer multiplication
- Recent developments in primality proving
- Irregular Primes and Cyclotomic Invariants to Four Million
- Integer multiplication in time \(O(n\log n)\)
- Improved Stage 2 to P ± 1 Factoring Algorithms
- New frameworks for Montgomery’s modular multiplication method
- Factorization of the tenth Fermat number
- A search for Wieferich and Wilson primes
- Faster integer multiplication using plain vanilla FFT primes
- High-Performance Ideal Lattice-Based Cryptography on 8-Bit ATxmega Microcontrollers
- Generalised Mersenne numbers revisited
- \(2^n\) in scientific computation and beyond
- Multidimensional Divide-and-Conquer and Weighted Digital Sums (Extended Abstract)
- The Twenty-Second Fermat Number is Composite
- A note on factors of generalized Fermat numbers
This page was built for publication: Discrete Weighted Transforms and Large-Integer Arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4286602)
