New efficient structure for a modular multiplier for RNS

DOI10.1109/12.833113MaRDI QIDQ4571352zbMATH OpenOpenAlexFDO

Authors Ahmad A. Hiasat

Publication date 9 July 2018

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/12.833113

Mathematics Subject Classification ID

Numerical algorithms for computer arithmetic, etc. (65Y04) Mathematical problems of computer architecture (68M07)

Cited in

(6)

• How to fake an RSA signature by encoding modular root finding as a SAT problem
• Single base modular multiplication for efficient hardware RNS implementations of ECC
• RNS architectures for the implementation of the `diagonal function'
• A low-complexity combinatorial RNS multiplier
• A Low-Complexity High-Radix RNS Multiplier
• An iterative modular multiplication algorithm in RNS

This page was built for publication: New efficient structure for a modular multiplier for RNS

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