Fast multiplication and its applications
From MaRDI portal
Number-theoretic algorithms; complexity (11Y16) Computation of special functions and constants, construction of tables (65D20) Numerical methods for discrete and fast Fourier transforms (65T50) Complexity and performance of numerical algorithms (65Y20) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Symbolic computation and algebraic computation (68W30)
Recommendations
Cited in
(40)- FFT-like multiplication of linear differential operators
- On the computation of the HNF of a module over the ring of integers of a number field
- Primality testing with Gaussian periods
- Linear differential equations as a data structure
- Rigorous high-precision computation of the Hurwitz zeta function and its derivatives
- Counting points on hyperelliptic curves in average polynomial time
- Fast multiplication of large numbers
- A long note on Mulders' short product
- Fast computation of the \(N\)-th term of a \(q\)-holonomic sequence and applications
- Fast evaluation of iterated multiplication of very large polynomials: an application to Chinese remainder theory
- Computing Igusa class polynomials
- Partial key exposure attack on CRT-RSA
- List Decoding for Binary Goppa Codes
- Faster algorithms for the square root and reciprocal of power series
- Wild McEliece
- Simplified High-Speed High-Distance List Decoding for Alternant Codes
- A search for Wilson primes
- Bad directions in cryptographic hash functions
- Modular exponentiation via the explicit Chinese remainder theorem
- Faster relaxed multiplication
- scientific article; zbMATH DE number 24466 (Why is no real title available?)
- scientific article; zbMATH DE number 1249165 (Why is no real title available?)
- scientific article; zbMATH DE number 1504642 (Why is no real title available?)
- Short addition sequences for theta functions
- The J.C.P. miller recurrence for exponentiating a polynomial, and its q- analog
- ECM using Edwards curves
- Evaluation of rational functions
- Multiplication
- Regular estimates for the complexity of polynomial multiplication and truncated Fourier transform
- Architecture-aware classical Taylor shift by 1
- Fast convolutions meet Montgomery
- A fast algorithm for reversion of power series
- Efficient Generic Quotients Using Exact Arithmetic
- Fast norm computation in smooth-degree abelian number fields
- Hypergeometric L-functions in average polynomial time. II
- Optimizing the half-gcd algorithm
- Understanding binary-Goppa decoding
- A survey of polynomial multiplications for lattice-based cryptosystems
- Point counting in families of hyperelliptic curves
- On the multiplication of scalar and matrix power series with integer coefficients
This page was built for publication: Fast multiplication and its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3615926)
