Cryptology ePrint Archive: Report 2020/357

Quasigroups and Substitution Permutation Networks: A Failed Experiment

George Teseleanu

Abstract: We introduce a generalization of substitution permutation networks using quasigroups. Then, we prove that for quasigroups isotopic with a group $\mathbb{G}$, the complexity of mounting a differential attack against our generalization is the same as attacking a substitution permutation network based on $\mathbb{G}$. Although the result is negative, we believe that the design can be instructional for teaching students that failure is a natural part of research. Also, we hope to prevent others from making the same mistake by showing where such a path leads.

Category / Keywords: secret-key cryptography / quasigroups, substitution permutation networks, teaching

Original Publication (in the same form): Cryptologia

Date: received 26 Mar 2020, last revised 26 Mar 2020

Contact author: george teseleanu at yahoo com

Available format(s): PDF | BibTeX Citation

Version: 20200328:150055 (All versions of this report)

Short URL: ia.cr/2020/357


[ Cryptology ePrint archive ]