Discrete Weighted Transforms and Large-Integer Arithmetic
From MaRDI portal
Publication:4286602
Recommendations
Cites work
- scientific article; zbMATH DE number 3880785 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- A Stochastic Roundoff Error Analysis for the Fast Fourier Transform
- Computational Complexity of Fourier Transforms Over Finite Fields
- FIR filtering by the modified Fermat number transform
- Fast Fourier transform and convolution algorithms
- Fast multiplication of large numbers
- Irregular Primes to One Million
- Large integer multiplication on hypercubes
- Parameter Determination for Complex Number-Theoretic Transforms Using Cyclotomic Polynomials
- Roundoff Error Analysis of the Fast Fourier Transform
- Speeding the Pollard and Elliptic Curve Methods of Factorization
- The Fast Fourier Transform in a Finite Field
- The Twentieth Fermat Number is Composite
- The use of finite fields to compute convolutions
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
- Parallel implementation of multiple-precision arithmetic and 2,576,980,370,000 decimal digits of calculation
- Distribution of generalized Fermat prime numbers
- Fast convolutions meet Montgomery
- Faster integer multiplication using short lattice vectors
- The twenty-fourth Fermat number is composite
- Even faster integer multiplication
- High-performance ideal lattice-based cryptography on 8-bit ATxmega microcontrollers
- Balanced non-adjacent forms
- 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
- Regular estimates for the complexity of polynomial multiplication and truncated Fourier transform
- Generalised Mersenne numbers revisited
- Multiplication
- \(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)
