Revisiting sum of residues modular multiplication

DOI10.1155/2010/657076zbMath1229.94046OpenAlexW1971111579WikidataQ58651992 ScholiaQ58651992MaRDI QIDQ543014

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

Mathematics Subject Classification ID

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

Cites Work

• A fast modular multiplication algorithm for calculating the product \(AB\) modulo \(N\)
• Modular Multiplication Without Trial Division
• A Computer Algorithm for Calculating the Product AB Modulo M
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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