Faster Interleaved Modular Multiplication Based on Barrett and Montgomery Reduction Methods

DOI10.1109/TC.2010.93MaRDI QIDQ5280668zbMATH OpenFDO

Authors Miroslav Knežević, Frederik Vercauteren, Ingrid Verbauwhede

Publication date 27 July 2017

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

Full work available at URL https://doi.org/10.1109/TC.2010.93

Mathematics Subject Classification ID

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

Cited in

(4)

• Efficient modular reduction algorithm without correction phase
• Faster Montgomery modular multiplication without pre-computational phase for some classes of finite fields
• ECM and the Elliott-Halberstam conjecture for quadratic fields
• Implementing Montgomery multiplication to speed-up the computation of modular exponentiation of multi-bit numbers

This page was built for publication: Faster Interleaved Modular Multiplication Based on Barrett and Montgomery Reduction Methods

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