Efficient Quasigroup Block Cipher for Sensor Networks
Matthew Battey, Abhishek Parakh

TL;DR
This paper introduces a new quasigroup-based block cipher designed for sensor networks, demonstrating superior statistical randomness performance compared to AES-256 through NIST tests.
Contribution
The paper proposes a novel quasigroup encryption method optimized for sensor networks, with performance surpassing AES-256 in statistical randomness tests.
Findings
Proposed cipher outperforms AES-256 in NIST statistical tests
Encryption destroys input statistical properties effectively
Suitable for resource-constrained 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Coding theory and cryptography · Cryptographic Implementations and Security
