System Optimization of Solving a Set of Linear Congruencies

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F08%3A00146129" target="_blank" >RIV/68407700:21230/08:00146129 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
System Optimization of Solving a Set of Linear Congruencies
Original language description
Solving a set of linear equations is a common problem and often it is transformed into a task of solving a set of linear congruencies. Solving a set of linear congruencies also appears frequently in cryptography and therefore an effective solving algorithms are needed. All algorithms solving this task have been observed to have their bottlenecks in calculating modular reduction as they need to divide. The problem with division or floating point re- mainder instruction is that these instructions have high latencies and are not pipelined. This paper compares several approaches that can be used to perform modular reduction after mul- tiplication in integer and floating point arithmetic and its purpose is to offer a highly system optimized algorithm for modular multiplication with reduction using SIMD extensions.
Czech name
—
Czech description
—

Publication year
2008
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Proceedings of CSE 2008 International Scientific Conference on Computer Science and Engineering
ISBN
978-80-8086-092-9
ISSN
—
e-ISSN
—
Number of pages
7
Pages from-to
—
Publisher name
Department of Computers and Informatics of FEI, Technical University Košice
Place of publication
Košice
Event location
High Tatras - Stará Lesná
Event date
Sep 24, 2008
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)