A Note on the Quasigroup of Lai–Massey Structures
Abstract
:1. Introduction
- 1.
- In the majority of scientific reports and papers, authors often depict their results as if they were achieved seamlessly, without acknowledging the intricacies and challenges encountered during the process. This tendency contributes to a skewed perception of scientific research [22,23,24,25] and fosters the misconception that failure, serendipity, and unexpected outcomes are not integral aspects of scientific endeavors [23,26]. Consequently, our report aims to provide readers with insight into the authentic processes involved in the design phase of a cryptographic primitive.
- 2.
- Negative results and misguided directions are frequently under-reported in the scientific literature [23,27], leading to the risk of repeated errors. By sharing our findings, we aspire to prevent others from traversing similar unproductive paths, thereby contributing to a collective learning process. This approach aligns with the recommendation in [28], where the author advises documenting mistakes to avoid their recurrence in the future.
Structure of the Paper
2. Preliminaries
2.1. Notations
2.2. Quasigroups
2.3. Group Differential Cryptanalysis
3. Lai–Massey Structure
3.1. Description
3.2. Symmetric Structure Analysis
- 1.
- Let and . Then,
- 2.
- Let and . Then,
- 3.
- Let and . Then,
- 4.
- Let and . Then,
- 1.
- Let and . Then,
- 2.
- Let and . Then,
- 3.
- Let and . Then,
- 4.
- Let and . Then,
3.3. Asymmetric Structure Analysis
- 1.
- Let , and . Then,
- 2.
- Let , and . Then,
- 3.
- Let , and . Then,
- 4.
- Let , and . Then,
- 1.
- Let , , and . Then,
- 2.
- Let , , and . Then,
- 3.
- Let , , and . Then,
- 4.
- Let , , and . Then,
4. Conclusions
Future Work
Funding
Data Availability Statement
Conflicts of Interest
References
- Vaudenay, S. A Classical Introduction to Cryptography: Applications for Communications Security; Springer Science & Business Media: Berlin/Heidelberg, Germany, 2005. [Google Scholar]
- Biham, E.; Shamir, A. Differential Cryptanalysis of DES-like Cryptosystems. J. Cryptol. 1991, 4, 3–72. [Google Scholar] [CrossRef]
- Knudsen, L.R.; Robshaw, M. The Block Cipher Companion; Springer Science & Business Media: Berlin/Heidelberg, Germany, 2011. [Google Scholar]
- Mouha, N. On Proving Security against Differential Cryptanalysis. In Proceedings of the CFAIL 2019, Columbia, MO, USA, 31 May–2 June 2019. [Google Scholar]
- Dénes, J.; Keedwell, A.D. Latin Squares: New Developments in the Theory and Applications; Elsevier: Amsterdam, The Netherlands, 1991; Volume 46. [Google Scholar]
- Lai, X.; Massey, J.L. A Proposal for a New Block Encryption Standard. In Advances in Cryptology—EUROCRYPT’90: Workshop on the Theory and Application of Cryptographic Techniques Aarhus, Denmark, 21–24 May 1990; Proceedings 9; Springer: Berlin/Heidelberg, Germany, 1991; Volume 473, pp. 389–404. [Google Scholar]
- Gligoroski, D.; Markovski, S.; Kocarev, L. Edon-R, An Infinite Family of Cryptographic Hash Functions. Int. J. Netw. Secur. 2009, 8, 293–300. [Google Scholar]
- Gligoroski, D.; Markovski, S.; Knapskog, S.J. The Stream Cipher Edon80. In New Stream Cipher Designs; Springer: Berlin/Heidelberg, Germany, 2008; Volume 4986, pp. 152–169. [Google Scholar]
- Bakhtiari, S.; Safavi-Naini, R.; Pieprzyk, J. A Message Authentication Code Based on Latin Squares. In Australasian Conference on Information Security and Privacy; Springer: Berlin/Heidelberg, Germany, 1997; Volume 1270, pp. 194–203. [Google Scholar]
- Dénes, J.; Keedwell, A.D. A New Authentication Scheme Based on Latin Squares. Discret. Math. 1992, 106, 157–161. [Google Scholar] [CrossRef]
- Kościelny, C. A Method of Constructing Quasigroup-Based Stream-Ciphers. Appl. Math. Comput. Sci. 1996, 6, 109–122. [Google Scholar]
- Chauhan, D.; Gupta, I.; Verma, R. Quasigroups and Their Applications in Cryptography. Cryptologia 2021, 45, 227–265. [Google Scholar] [CrossRef]
- Chauhan, D.; Gupta, I.; Verma, R. Construction of Cryptographically Strong S-boxes from Ternary Quasigroups of Order 4. Cryptologia 2021, 569, 658–680. [Google Scholar] [CrossRef]
- Bakeva, V.; Popovska-Mitrovikj, A.; Mechkaroska, D.; Dimitrova, V.; Jakimovski, B.; Ilievski, V. Gaussian Channel Transmission of Images and Audio Files Using Cryptcoding. IET Commun. 2019, 13, 1625–1632. [Google Scholar] [CrossRef]
- Brunetta, C.; Calderini, M.; Sala, M. On Hidden Sums Compatible with a Given Block Cipher Diffusion Layer. Discret. Math. 2019, 342, 373–386. [Google Scholar] [CrossRef]
- Calderini, M.; Sala, M. On Differential Uniformity of Maps that May Hide an Algebraic Trapdoor. In International Conference on Algebraic Informatics; Springer: Cham, Switzerland, 2015; Volume 9270, pp. 70–78. [Google Scholar]
- Calderini, M.; Civino, R.; Sala, M. On Properties of Translation Groups in the Affine General Linear Group with Applications to Cryptography. J. Algebra 2021, 569, 658–680. [Google Scholar] [CrossRef]
- Civino, R.; Blondeau, C.; Sala, M. Differential attacks: Using alternative operations. Des. Codes Cryptogr. 2019, 87, 225–247. [Google Scholar] [CrossRef]
- Teşeleanu, G. Quasigroups and Substitution Permutation Networks: A Failed Experiment. Cryptologia 2021, 45, 266–281. [Google Scholar] [CrossRef]
- Teşeleanu, G. Cryptographic Symmetric Structures Based on Quasigroups. Cryptologia 2023, 47, 365–392. [Google Scholar] [CrossRef]
- Teşeleanu, G. The Security of Quasigroups Based Substitution Permutation Networks. In International Conference on Information Technology and Communications Security; Springer: Cham, Switzerland, 2022; Volume 13809, pp. 306–319. [Google Scholar]
- Medawar, P. Is the Scientific Paper a Fraud? List 1963, 70, 377–378. [Google Scholar]
- Howitt, S.M.; Wilson, A.N. Revisiting “Is the Scientific Paper a Fraud?”. EMBO Rep. 2014, 15, 481–484. [Google Scholar] [CrossRef] [PubMed]
- Tao, T. Ask Yourself Dumb Questions—And Answer Them! Available online: https://terrytao.wordpress.com/career-advice/ask-yourself-dumb-questions-and-answer-them/ (accessed on 2 August 2024).
- Weidman, D.R. Emotional Perils of Mathematics. Science 1965, 149, 1048. [Google Scholar] [CrossRef] [PubMed]
- Schwartz, M.A. The Importance of Stupidity in Scientific Research. J. Cell Sci. 2008, 121, 1771. [Google Scholar] [CrossRef] [PubMed]
- Truran, P. Practical Applications of the Philosophy of Science: Thinking about Research; Springer Science & Business Media: Berlin/Heidelberg, Germany, 2013. [Google Scholar]
- Tao, T. Use the Wastebasket. Available online: https://terrytao.wordpress.com/career-advice/use-the-wastebasket/ (accessed on 2 August 2024).
- Smith, J.D. Four Lectures on Quasigroup Representations. Quasigroups Relat. Syst. 2007, 15, 109–140. [Google Scholar]
- Vojvoda, M.; Sỳs, M.; Jókay, M. A Note on Algebraic Properties of Quasigroups in Edon80. Technical Report, eSTREAM report 2007/005, 2007. Available online: https://www.academia.edu/71592476/A_Note_on_Algebraic_Properties_of_Quasigroups (accessed on 2 August 2024).
- Hulpke, A.; Kaski, P.; Östergård, P. The Number of Latin Squares of Order 11. Math. Comput. 2011, 80, 1197–1219. [Google Scholar] [CrossRef]
- McKay, B.D.; Wanless, I.M. On the Number of Latin Squares. Ann. Comb. 2005, 9, 335–344. [Google Scholar] [CrossRef]
- McKay, B.D.; Meynert, A.; Myrvold, W. Small Latin Squares, Quasigroups, and Loops. J. Comb. Des. 2007, 15, 98–119. [Google Scholar] [CrossRef]
- Lai, X.; Massey, J.L.; Murphy, S. Markov Ciphers and Differential Cryptanalysis. In Advances in Cryptology—EUROCRYPT’91: Workshop on the Theory and Application of Cryptographic Techniques Brighton, UK, 8–11 April 1991; Proceedings 10; Springer: Berlin/Heidelberg, Germany, 1991; Volume 547, pp. 17–38. [Google Scholar]
- O’Connor, L. On the Distribution of Characteristics in Bijective Mappings. In Advances in Cryptology—EUROCRYPT’93: Workshop on the Theory and Application of Cryptographic Techniques, Lofthus, Norway, 23–27 May 1993; Proceedings 12; Springer: Berlin/Heidelberg, Germany, 1994; Volume 765, pp. 360–370. [Google Scholar]
- O’Connor, L. On the Distribution of Characteristics in Bijective Mappings. J. Cryptol. 1995, 8, 67–86. [Google Scholar] [CrossRef]
- Hawkes, P.; O’Connor, L. XOR and Non-XOR Differential Probabilities. In Advances in Cryptology—EUROCRYPT’99: International Conference on the Theory and Application of Cryptographic Techniques, Prague, Czech Republic, 2–6 May 1999; Proceedings 18; Springer: Berlin/Heidelberg, Germany, 1999; Volume 1592, pp. 272–285. [Google Scholar]
- Nyberg, K. Perfect Nonlinear S-boxes. In Workshop on the Theory and Application of of Cryptographic Techniques; Springer: Berlin/Heidelberg, Germany, 1991; Volume 547, pp. 378–386. [Google Scholar]
- Canteaut, A.; Charpin, P.; Dobbertin, H. Weight Divisibility of Cyclic Codes, Highly Nonlinear Functions on F2m, and Crosscorrelation of Maximum-Length Sequences. SIAM J. Discret. Math. 2000, 13, 105–138. [Google Scholar] [CrossRef]
- Dobbertin, H. One-to-One Highly Nonlinear Power Functions on GF(2n). Appl. Algebra Eng. Commun. Comput. 1998, 9, 139–152. [Google Scholar] [CrossRef]
- Dudek, W. Parastrophes of Quasigroups. Quasigroups Relat. Syst. 2015, 23, 221–230. [Google Scholar]
- Falcón, R.M.; Falcón, Ó.J.; Núñez, J. A Historical Perspective of the Theory of Isotopisms. Symmetry 2018, 10, 322. [Google Scholar] [CrossRef]
⊗ | 0 | 1 | 2 | 3 | 0 | 1 | 2 | 3 | 0 | 1 | 2 | 3 | ||
0 | 2 | 0 | 1 | 3 | 0 | 1 | 2 | 0 | 3 | 0 | 3 | 0 | 1 | 2 |
1 | 3 | 1 | 0 | 2 | 1 | 2 | 1 | 3 | 0 | 1 | 2 | 1 | 0 | 3 |
2 | 1 | 3 | 2 | 0 | 2 | 3 | 0 | 2 | 1 | 2 | 0 | 3 | 2 | 1 |
3 | 0 | 2 | 3 | 1 | 3 | 0 | 3 | 1 | 2 | 3 | 1 | 2 | 3 | 0 |
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2024 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).
Share and Cite
Teşeleanu, G. A Note on the Quasigroup of Lai–Massey Structures. Cryptography 2024, 8, 35. https://doi.org/10.3390/cryptography8030035
Teşeleanu G. A Note on the Quasigroup of Lai–Massey Structures. Cryptography. 2024; 8(3):35. https://doi.org/10.3390/cryptography8030035
Chicago/Turabian StyleTeşeleanu, George. 2024. "A Note on the Quasigroup of Lai–Massey Structures" Cryptography 8, no. 3: 35. https://doi.org/10.3390/cryptography8030035
APA StyleTeşeleanu, G. (2024). A Note on the Quasigroup of Lai–Massey Structures. Cryptography, 8(3), 35. https://doi.org/10.3390/cryptography8030035