Montgomery multiplication over rings

DOI10.1016/J.JFRANKLIN.2008.06.002zbMATH Open1298.68037OpenAlexW2016424687MaRDI QIDQ468150FDOQ468150

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

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

zbMATH Keywords

finite fieldsfinite ringsmultiplierarithmeticMontgomery multiplication

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Montgomery multiplication in \(\text{GF}(2^ k)\)
• Parallel multipliers based on special irreducible pentanomials
• Title not available (Why is that?)
• Montgomery multiplier and squarer for a class of finite fields

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)