Faster integer multiplication using short lattice vectors
Authors:
- 28 January 2019
- journal article
- Published by Mathematical Sciences Publishers in The Open Book Series
- Vol. 2 (1) , 293-310
Abstract
No abstract availableAll Related Versions
This publication has 21 references indexed in Scilit:
- Generalised Mersenne numbers revisitedMathematics of Computation, 2013
- Fast Integer Multiplication Using Modular ArithmeticSIAM Journal on Computing, 2013
- Faster Integer MultiplicationSIAM Journal on Computing, 2009
- Montgomery Reduction Algorithm for Modular Multiplication Using Low-Weight Polynomial Form Integers2007
- Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin OperatorSIAM Journal on Computing, 2007
- Modular Number Systems: Beyond the Mersenne Family2004
- Implementing the Rivest Shamir and Adleman Public Key Encryption Algorithm on a Standard Digital Signal Processor2000
- Discrete weighted transforms and large-integer arithmeticMathematics of Computation, 1994
- A linear filtering approach to the computation of discrete Fourier transformIEEE Transactions on Audio and Electroacoustics, 1970
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965