Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Algorithm and circuit design for secondary Booth encoded multiplier

From MaRDI portal
Publication:3500764
Jump to:navigation, search

zbMATH Open1150.94326MaRDI QIDQ3500764FDOQ3500764


Authors: Xiao-Dong Yan, S. G. Li Edit this on Wikidata


Publication date: 3 June 2008





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


zbMATH Keywords

multipliermodule multiplicationRivest Shamir and Adleman (RSA) algorithmsecondary Booth recoding


Mathematics Subject Classification ID

Cryptography (94A60)



Cited In (3)

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





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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3500764&oldid=16850139"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 4 February 2024, at 22:42. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki