An improvement of the Barrett modular reduction algorithm

DOI10.1080/00207160.2013.862237MaRDI QIDQ2931932zbMATH OpenOpenAlexFDO

Authors Zhengjun Cao, Xiangjia Wu

Publication date 28 November 2014

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160.2013.862237

zbMATH Keywords

Barrett reduction algorithmdata expansionmodular reduction

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Data encryption (aspects in computer science) (68P25) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Double-speed Barrett moduli
• Efficient modular reduction algorithm without correction phase
• scientific article; zbMATH DE number 1024055
• Multiplication on large simple modules based on Barrett's minimally redundant modular scheme
• Efficient modular reduction algorithm in \(\mathbb F_q[x]\) and its application to ``left to right modular multiplication in \(\mathbb F_2[x]\).

Cited in

(3)

• Double-speed Barrett moduli
• Multiplication on large simple modules based on Barrett's minimally redundant modular scheme
• Efficient modular reduction algorithm without correction phase

This page was built for publication: An improvement of the Barrett modular reduction algorithm

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