An Efficient Quasigroup Block Cipher

Authors:
Matthew Battey;Abhishek Parakh
Affiliations:
Department of Computer Science, University of Nebraska at Omaha, Omaha, USA 68168;Nebraska University Center for Information Assurance, University of Nebraska at Omaha, Omaha, USA 68182
Venue:
Wireless Personal Communications: An International Journal
Year:
2013

Citing 5
Cited 0

A Message Authentication Code Based on Latin Squares

ACISP '97 Proceedings of the Second Australasian Conference on Information Security and Privacy
NTRU: A Ring-Based Public Key Cryptosystem

ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
Advances in Elliptic Curve Cryptography (London Mathematical Society Lecture Note Series)

Advances in Elliptic Curve Cryptography (London Mathematical Society Lecture Note Series)
An Application of Quasigroups in All-Or-Nothing Transform

Cryptologia
Online data storage using implicit security

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Low powered devices, such as smart phones, tablets and sensors, present a particular challenge for advanced encryption systems. In this paper, we present a new quasigroup block encryption system that has low memory and computational requirements and hence suitable for low powered devices. We compare its performance against Advanced Encryption Standard-256 (AES-256) bit algorithm using the NIST statistical test suite (NIST-STS). Since it is well known that a good encryption algorithm must destroy any statistical properties of the input sequence and produce output close to a true random sequence, the NIST-STS suite results provide us a good test bench. In almost all tests from the suite, the proposed algorithm performs better than AES-256.