Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

New iterative algorithms for modular multiplication

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

DOI10.1016/J.SIGPRO.2004.07.001zbMath1148.94430OpenAlexW1997325633MaRDI QIDQ956032

Omar Nibouche, Ahmed Bouridane, Mokhtar Nibouche

Publication date: 25 November 2008

Published in: Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.sigpro.2004.07.001


zbMATH Keywords

cryptographycomputer arithmeticmodular multiplicationserial-parallel systems


Mathematics Subject Classification ID

Cryptography (94A60)


Related Items (2)

An optimization of tree topology based parallel cryptography ⋮ Fast binary multiplication by performing dot counting and complement recoding







This page was built for publication: New iterative algorithms for modular multiplication

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:956032&oldid=12929976"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 18:37.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki