Efficient Quasigroup Block Cipher for Sensor Networks

Abstract

We present a new quasigroup based block encryption system with and without cipher-block-chaining. We compare its performance against Advanced Encryption Standard-256 (AES256) bit algorithm using the NIST statistical test suite (NIST-STS) that tests for randomness of a sequence. Since it is well known that a good encryption algorithm must destroy any statistical properties of the input sequence and produce an output close to a true random sequence, the NIST-STS suite results provide a good test bench. In almost all tests from the suite the proposed algorithm performs better than AES256.

Hardware Implementation of Quasigroup Encryption for SCADA Networks

“…Also, the Latin square has been researched previously with respect to encryption, where they are referred to by their quasigroup name [3], [4], [8]. Stream ciphers using quasigroups, as well as public key implementations with quasigroups, were investigated by Gligoroski and others [9], [10], [11], [12].…”

“…Our quasigroup block cipher [4] was designed based upon the ideas of confusion and diffusion. In order to make the block cipher design consistent with existing encryption practices we used a 256-bit key with a 128-bit block size.…”

“…Previously we have reported on the software implementation of the algorithm [3], [4]; in this paper we report on our work in progress towards a single-chip quasigroup device based on Field Programmable Gate Arrays (FPGAs). This design will be a drop-in design for a computer hardware engineer wanting a reasonable throughput but low cost solution for transporting data securely.…”

An acceleration of quasigroup operations by residue arithmetic

“…19,20 It is build around an order 2 8 quasigroup and designed with respect to the usually low processing power of sensor nodes. 19,20 It is build around an order 2 8 quasigroup and designed with respect to the usually low processing power of sensor nodes.…”

“…5 The operations of quasigroup-based cryptographic algorithms are simple and concurrent in nature. 11,16,17,34,38 They can be easily implemented on highly parallel 11,14,[21][22][23]39 and resource constrained (embedded) 5,13,[17][18][19][20]34,37,38,40 platforms. That is useful for addressing certain weak spots of traditional cryptosystems based on integer factorization and the discrete logarithm problem.…”