An acceleration of quasigroup operations by residue arithmetic
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F18%3A10241712" target="_blank" >RIV/61989100:27240/18:10241712 - isvavai.cz</a>
Result on the web
<a href="https://onlinelibrary.wiley.com/doi/epdf/10.1002/cpe.4239" target="_blank" >https://onlinelibrary.wiley.com/doi/epdf/10.1002/cpe.4239</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1002/cpe.4239" target="_blank" >10.1002/cpe.4239</a>
Alternative languages
Result language
angličtina
Original language name
An acceleration of quasigroup operations by residue arithmetic
Original language description
Quasigroup operations are essential for a wide range of cryptographic procedures that includes cryptographic hash functions, electronic signatures, pseudorandom number generators, and stream and block ciphers. Quasigroup cryptography achieves high levels of security at low memory and computational costs by an iterative application of quasigroup operations to streams and blocks of data. The use of large quasigroups can further improve the strength of cryptographic operations. However, the order of used quasigroups is the main factor affecting the memory requirements of quasigroup cryptographic schemes. Alternative quasigroup representations that do not store their multiplication tables in computer memory yield increased computational costs. In any case, an efficient implementation of quasigroup operations is critical for practical applications of quasigroup cryptography. Residue number systems allow a fast, concurrent realization of addition and multiplication. In this work, residue arithmetic is used to accelerate quasigroup operations, and an efficient computational approach to their implementation, designed with respect to the extended instruction sets of modern processors, is proposed.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GJ16-25694Y" target="_blank" >GJ16-25694Y: Multi-paradigm data mining algorithms based on information retrieval, fuzzy, and bio-inspired methods</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2018
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
Concurrency Computation Practice and Experience
ISSN
1532-0626
e-ISSN
—
Volume of the periodical
30
Issue of the periodical within the volume
2
Country of publishing house
US - UNITED STATES
Number of pages
14
Pages from-to
1-14
UT code for WoS article
000418402600003
EID of the result in the Scopus database
2-s2.0-85026415445