Algorithm and circuit design for secondary Booth encoded multiplier

MaRDI QIDQ3500764zbMATH OpenFDO

Authors Xiao-Dong Yan, S. G. Li

Publication date 3 June 2008

zbMATH Keywords

multipliermodule multiplicationRivest Shamir and Adleman (RSA) algorithmsecondary Booth recoding

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• A design of low latency multiplier/mac unit for public-key cryptography
• A new algorithm for design of the Booth-based multiplier unit
• A fully-pipeline linear systolic architecture for modular multiplier in public-key crypto-systems
• Systolic multiplier for Montgomery’s algorithm
• Digit-serial-in-serial-out systolic multiplier for Montgomery algorithm

Cited in

(3)

• To Booth or not to Booth
• A design of low latency multiplier/mac unit for public-key cryptography
• A new algorithm for design of the Booth-based multiplier unit

This page was built for publication: Algorithm and circuit design for secondary Booth encoded multiplier

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