Low-Weight Polynomial Form Integers for Efficient Modular Multiplication

DOI10.1109/TC.2007.250622MaRDI QIDQ4564099zbMATH OpenOpenAlexFDO

Authors Jaewook Chung, M. Anwar Hasan

Publication date 12 June 2018

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.2007.250622

Mathematics Subject Classification ID

Numerical algorithms for computer arithmetic, etc. (65Y04) Cryptography (94A60)

Recommendations

• A new approach for finding low-weight polynomial multiples
• Computing modular polynomials in quasi-linear time
• Efficient Modular Arithmetic
• Fast polynomial factorization and modular composition
• Efficient and formally proven reduction of large integers by small moduli
• Fast integer multiplication using modular arithmetic
• Faster polynomial multiplication over finite fields
• A discrete logarithm-based approach to compute low-weight multiples of binary polynomials
• Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x]\) and some cryptographic applications
• Space- and time-efficient polynomial multiplication

Cited in

(4)

• A new approach for finding low-weight polynomial multiples
• \(2S3\) transformation for dyadic fractions in the interval \((0,1)\)
• Faster integer multiplication using short lattice vectors
• On the optimization of Pippenger's bucket method with precomputation

This page was built for publication: Low-Weight Polynomial Form Integers for Efficient Modular Multiplication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4564099)