System Optimization of Solving a Set of Linear Congruencies

Kód výsledku v 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>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

System Optimization of Solving a Set of Linear Congruencies

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

System Optimization of Solving a Set of Linear Congruencies

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

JC - Počítačový hardware a software

OECD FORD obor

—

Projekt

—

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2008

Kód důvěrnosti údajů

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

Název statě ve sborníku

Proceedings of CSE 2008 International Scientific Conference on Computer Science and Engineering

ISBN

978-80-8086-092-9

ISSN

—

e-ISSN

—

Počet stran výsledku

7

Strana od-do

—

Název nakladatele

Department of Computers and Informatics of FEI, Technical University Košice

Místo vydání

Košice

Místo konání akce

High Tatras - Stará Lesná

Datum konání akce

24. 9. 2008

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—