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%2F09%3A00158542" target="_blank" >RIV/68407700:21230/09:00158542 - isvavai.cz</a>

Alternative codes found

RIV/68407700:21240/09:00158542

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 effective solving algorithmsare needed. All algorithms solving this task have their bottlenecks in calculating modular reduction as they need to divide. The problem with division or floating point remainder 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 multiplication in integer and floating point arithmetic and its purpose is to offer a highly system optimized algorithm for modular multiplication with reduction using SIMD processor extensions.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

JC - Computer hardware and software

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2009

Confidentiality

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

Name of the periodical

Acta Electrotechnica et Informatica

ISSN

1335-8243

e-ISSN

—

Volume of the periodical

9

Issue of the periodical within the volume

3

Country of publishing house

SK - SLOVAKIA

Number of pages

5

Pages from-to

—

UT code for WoS article

—

EID of the result in the Scopus database

—