Revisiting sum of residues modular multiplication

DOI10.1155/2010/657076zbMATH Open1229.94046OpenAlexW1971111579WikidataQ58651992 ScholiaQ58651992MaRDI QIDQ543014FDOQ543014

Authors: Yinan Kong, Braden J. Phillips 

Publication date: 20 June 2011

Published in: Journal of Electrical and Computer Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2010/657076

Recommendations

• Highly parallel modular multiplication in the residue number system using sum of residues reduction
• Four moduli RNS bases for efficient design of modular multiplication
• Highly parallel modular multiplier for elliptic curve cryptography in residue number system
• Parallel Processing and Applied Mathematics
• An iterative modular multiplication algorithm in RNS

Mathematics Subject Classification ID

Cryptography (94A60) Mathematical problems of computer architecture (68M07)

Cites Work

• Modular Multiplication Without Trial Division
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A fast modular multiplication algorithm for calculating the product \(AB\) modulo \(N\)
• Title not available (Why is that?)
• A Computer Algorithm for Calculating the Product AB Modulo M
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• Highly parallel modular multiplication in the residue number system using sum of residues reduction
• A Suggestion for a Fast Residue Multiplier for a Family of Moduli of the Form (2n - (2p   1))

This page was built for publication: Revisiting sum of residues modular multiplication

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