Montgomery multiplication over rings

DOI10.1016/J.JFRANKLIN.2008.06.002MaRDI QIDQ468150zbMATH OpenOpenAlexFDO

Authors Joseph P. Brennan, Rajendra Katti

Publication date 6 November 2014

Published in Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jfranklin.2008.06.002

zbMATH Keywords

arithmeticfinite fieldsfinite ringsMontgomery multiplicationmultiplier

Mathematics Subject Classification ID

Arithmetic theory of polynomial rings over finite fields (11T55) Mathematical problems of computer architecture (68M07) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1759299
• Montgomery multiplication in \(\text{GF}(2^ k)\)
• New frameworks for Montgomery’s modular multiplication method
• Polynomial basis multiplication over \(\text{GF}(2^m)\)
• Faster Montgomery modular multiplication without pre-computational phase for some classes of finite fields

Cites work

• scientific article; zbMATH DE number 3689291 (Why is no real title available?)
• scientific article; zbMATH DE number 1759300 (Why is no real title available?)
• scientific article; zbMATH DE number 195162 (Why is no real title available?)
• Montgomery multiplication in \(\text{GF}(2^ k)\)
• Montgomery multiplier and squarer for a class of finite fields
• Parallel multipliers based on special irreducible pentanomials

Describes a project that uses

Uses Software

• Mathematica

This page was built for publication: Montgomery multiplication over rings

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