Efficient quasigroup block cipher for sensor networks

Matthew Battey, Abhishek Parakh

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Scopus citations

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.

Original languageEnglish (US)
Title of host publication2012 21st International Conference on Computer Communications and Networks, ICCCN 2012 - Proceedings
DOIs
StatePublished - 2012
Event2012 21st International Conference on Computer Communications and Networks, ICCCN 2012 - Munich, Germany
Duration: Jul 30 2012Aug 2 2012

Publication series

Name2012 21st International Conference on Computer Communications and Networks, ICCCN 2012 - Proceedings

Conference

Conference2012 21st International Conference on Computer Communications and Networks, ICCCN 2012
CountryGermany
CityMunich
Period7/30/128/2/12

ASJC Scopus subject areas

  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Efficient quasigroup block cipher for sensor networks'. Together they form a unique fingerprint.

Cite this