Subtraction-free Almost Montgomery Inverse algorithm
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F05%3A03109991" target="_blank" >RIV/68407700:21230/05:03109991 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Subtraction-free Almost Montgomery Inverse algorithm
Original language description
A new modification of Kaliski's algorithm for computing the Almost Montgomery Inverse, optimized for implementation in hardware, is presented. The algorithm and the corresponding portion of the hardware architecture overcome certain drawbacks of the currently used methods. In particular, the "less than/greater than" tests that represent subtractions are avoided
Czech name
Algoritmus pro výpočet Téměř Montgomeryho Inverze bez použití odečítání
Czech description
Článek popisuje novou modifikaci Kaliského algoritmu pro výpočet Téměř Montgomeryho Inverze.Tato modifiikace je optimalizovaná pro hardwarovu implementaci. Algoritmus nevyžaduje operaci odečítání.
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2005
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Information Processing Letters
ISSN
0020-0190
e-ISSN
—
Volume of the periodical
94
Issue of the periodical within the volume
1
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
4
Pages from-to
11-14
UT code for WoS article
—
EID of the result in the Scopus database
—