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
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

A parallel residue-to-binary conversion algorithm without trial division

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

DOI10.1016/J.COMPELECENG.2006.01.024zbMath1110.68162OpenAlexW2071051992MaRDI QIDQ861245

Yeu-Pong Lai, Chin-Chen Chang

Publication date: 9 January 2007

Published in: Computers and Electrical Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.compeleceng.2006.01.024


zbMATH Keywords

Euclidean algorithmChinese remainder theoremresidue number systemMontgomery algorithmdivision-free


Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Number-theoretic algorithms; complexity (11Y16)








This page was built for publication: A parallel residue-to-binary conversion algorithm without trial division

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