New iterative algorithms for modular multiplication

DOI10.1016/J.SIGPRO.2004.07.001MaRDI QIDQ956032zbMATH OpenOpenAlexFDO

Authors Omar Nibouche, Mokhtar Nibouche, Ahmed Bouridane

Publication date 25 November 2008

Published in Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.sigpro.2004.07.001

zbMATH Keywords

cryptographycomputer arithmeticmodular multiplicationserial-parallel systems

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• An iterative modular multiplication algorithm in RNS
• scientific article; zbMATH DE number 4191561
• A fast modular multiplication algorithm
• Parallel modular multiplication with table look-up
• New modular multiplication algorithms for fast modular exponentiation

Cited in

(11)

• Exploiting Linearity of Modular Multiplication
• An optimization of tree topology based parallel cryptography
• New algorithms for relaxed multiplication
• New Results on the Most Significant Bit of Integer Multiplication
• An iterative modular multiplication algorithm
• Efficient Modular Arithmetic
• An iterative modular multiplication algorithm in RNS
• Another look at some fast modular arithmetic methods
• A generalisation of Brickell's algorithm for fast modular multiplication
• Fast binary multiplication by performing dot counting and complement recoding
• New frameworks for Montgomery’s modular multiplication method

This page was built for publication: New iterative algorithms for modular multiplication

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