An acceleration of quasigroup operations by residue arithmetic

Abstract

SummaryQuasigroup 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.