Cryptographic Primitives with Quasigroup Transformations

Mileva, Aleksandra. "Cryptographic Primitives with Quasigroup Transformations." Mathematica Balkanica New Series 24.3-4 (2010): 207-216. <http://eudml.org/doc/11342>.

@article{Mileva2010,
abstract = {AMS Subj. Classification: Primary 20N05, Secondary 94A60The intention of this research is to justify deployment of quasigroups in cryptography, especially with new quasigroup based cryptographic hash function NaSHA as a runner in the First round of the ongoing NIST SHA-3 competition. We present new method for fast generation of huge quasigroup operations, based on the so-called extended Feistel networks and modification of the Sade’s diagonal method. We give new design of quasigroup based family of cryptographic hash functions - NaSHA, which deploy the new method and with a novel approach - different quasigroups for every application of component quasigroup transformations in every iteration of the compression function and, much more, the used quasigroups are functions of the processed message block.},
author = {Mileva, Aleksandra},
journal = {Mathematica Balkanica New Series},
keywords = {Cryptographic Hash Function; NaSHA; Quasigroup Transformations; cryptographic hash function; quasigroup transformations},
language = {eng},
number = {3-4},
pages = {207-216},
publisher = {Bulgarian Academy of Sciences - National Committee for Mathematics},
title = {Cryptographic Primitives with Quasigroup Transformations},
url = {http://eudml.org/doc/11342},
volume = {24},
year = {2010},
}

TY - JOUR
AU - Mileva, Aleksandra
TI - Cryptographic Primitives with Quasigroup Transformations
JO - Mathematica Balkanica New Series
PY - 2010
PB - Bulgarian Academy of Sciences - National Committee for Mathematics
VL - 24
IS - 3-4
SP - 207
EP - 216
AB - AMS Subj. Classification: Primary 20N05, Secondary 94A60The intention of this research is to justify deployment of quasigroups in cryptography, especially with new quasigroup based cryptographic hash function NaSHA as a runner in the First round of the ongoing NIST SHA-3 competition. We present new method for fast generation of huge quasigroup operations, based on the so-called extended Feistel networks and modification of the Sade’s diagonal method. We give new design of quasigroup based family of cryptographic hash functions - NaSHA, which deploy the new method and with a novel approach - different quasigroups for every application of component quasigroup transformations in every iteration of the compression function and, much more, the used quasigroups are functions of the processed message block.
LA - eng
KW - Cryptographic Hash Function; NaSHA; Quasigroup Transformations; cryptographic hash function; quasigroup transformations
UR - http://eudml.org/doc/11342
ER -