{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T19:11:57Z","timestamp":1762197117026,"version":"build-2065373602"},"reference-count":48,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T00:00:00Z","timestamp":1761868800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cryptography"],"abstract":"<jats:p>Symmetric cryptography is essential for secure communication as it ensures confidentiality by using shared secret keys. This paper proposes a novel substitution-permutation network (SPN) that integrates Latin squares, permutations, and Reed-Muller (RM) codes to achieve robust security and resilience. As an adaptive design using binary representation with base-n Latin square mappings for non-linear substitutions, it supports any n (Codeword length and Latin square order), k (RM code dimension), d (RM code minimum distance) parameters aligned with the Latin square and RM(n,k,d) codes. The scheme employs 2log2n-round transformations using log2n permutations \u03c1z, where in the additional log2n rounds, row and column pairs are swapped for each pair of rounds, with key-dependent \u03c0z permutations for round outputs and fixed \u03c1z permutations for codeword shuffling, ensuring strong diffusion. The scheme leverages dynamic Latin square substitutions for confusion and a vast key space, with permutations ensuring strong diffusion and RM(n,k,d) codes correcting transmission errors and enhancing robustness against fault-based attacks. Precomputed components optimize deployment efficiency. The paper presents mathematical foundations, security primitives, and experimental results, including avalanche effect analysis, demonstrating flexibility and balancing enhanced security with computational and storage overhead.<\/jats:p>","DOI":"10.3390\/cryptography9040070","type":"journal-article","created":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T18:21:46Z","timestamp":1762194106000},"page":"70","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Scalable Symmetric Cryptographic Scheme Based on Latin Square, Permutations, and Reed-Muller Codes for Resilient Encryption"],"prefix":"10.3390","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6959-8352","authenticated-orcid":false,"given":"Hussain","family":"Ahmad","sequence":"first","affiliation":[{"name":"Department of Computer Science, Faculty of Informatics, University of Debrecen, 4028 Debrecen, Hungary"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0098-7293","authenticated-orcid":false,"given":"Carolin","family":"Hannusch","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Faculty of Informatics, University of Debrecen, 4028 Debrecen, Hungary"}]}],"member":"1968","published-online":{"date-parts":[[2025,10,31]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Daemen, J., and Rijmen, V. (2020). The Design of Rijndael: AES\u2014The Advanced Encryption Standard, Springer.","DOI":"10.1007\/978-3-662-60769-5"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Bogdanov, A., Knudsen, L.R., Leander, G., Paar, C., Poschmann, A., Robshaw, M.J., Seurin, Y., and Vikkelsoe, C. (2007). PRESENT: An ultra-lightweight block cipher. Cryptographic Hardware and Embedded Systems\u2014CHES 2007, Springer.","DOI":"10.1007\/978-3-540-74735-2_31"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Prouff, E., Renault, G., Rivain, M., and O\u2019Flynn, C. (2025). Fault Attacks on Symmetric Cryptography. Embedded Cryptography 1, Wiley.","DOI":"10.1002\/9781394351879"},{"key":"ref_4","first-page":"86","article-title":"A survey on fault attacks on symmetric key cryptosystems","volume":"55","author":"Baksi","year":"2022","journal-title":"ACM Comput. Surv."},{"key":"ref_5","first-page":"585","article-title":"Towards the construction of reed-muller code based symmetric key FHE","volume":"26","author":"Challa","year":"2021","journal-title":"Ing. Syst. Inf."},{"key":"ref_6","first-page":"7939","article-title":"LSIE: A fast and secure Latin square-based image encryption scheme","volume":"23","author":"Abdali","year":"2024","journal-title":"Multimed. Tools Appl."},{"key":"ref_7","first-page":"103039","article-title":"An efficient multimedia compression-encryption scheme using latin squares for securing Internet-of-things networks","volume":"63","author":"Mesrega","year":"2022","journal-title":"J. Inf. Secur. Appl."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/j.ins.2013.11.027","article-title":"Design of image cipher using latin squares","volume":"264","author":"Wu","year":"2014","journal-title":"Inf. Sci."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"203","DOI":"10.58496\/MJCS\/2024\/023","article-title":"Development of Robust and Efficient Symmetric Random Keys Model Based on the Latin Square Matrix","volume":"4","author":"Ali","year":"2024","journal-title":"Mesopotamian J. Cybersecur."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Repka, M., and Cayrel, P.L. (2014). Cryptography based on error correcting codes: A survey. Multidisciplinary Perspectives in Cryptology and Information Security, IGI Global.","DOI":"10.4018\/978-1-4666-5808-0.ch005"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1016\/j.scs.2018.01.036","article-title":"LCPC error correction code for IoT applications","volume":"42","author":"Alabady","year":"2018","journal-title":"Sustain. Cities Soc."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/s001450010016","article-title":"On the importance of eliminating errors in cryptographic computations","volume":"14","author":"Boneh","year":"2001","journal-title":"J. Cryptol."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Carlet, C. (2010). Boolean functions for cryptography and error correcting codes. Boolean Models and Methods in Mathematics, Computer Science, and Engineering, Cambridge University Press.","DOI":"10.1017\/CBO9780511780448.011"},{"key":"ref_14","unstructured":"MacWilliams, F.J., and Sloane, N.J.A. (1977). The Theory of Error-Correcting Codes, Elsevier."},{"key":"ref_15","unstructured":"Vaudenay, S. (2005). A Classical Introduction to Cryptography: Applications for Communications Security, Springer. [1st ed.]."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Colbourn, C.J., and Dinitz, J.H. (2006). Handbook of Combinatorial Designs, Chapman and Hall\/CRC. [2nd ed.].","DOI":"10.1201\/9781420010541"},{"key":"ref_17","unstructured":"Thomas, B., Yi, L., Vaudenay, S., Junod, P., and Monnerat, J. (2007). A Classical Introduction to Cryptography Exercise Book, Springer. [1st ed.]."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"50","DOI":"10.2307\/2369433","article-title":"Desiderata and suggestions: No. 1. The theory of groups","volume":"1","author":"Cayley","year":"1878","journal-title":"Am. J. Math."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"174","DOI":"10.2307\/2369306","article-title":"Desiderata and suggestions: No. 2. The theory of groups: Graphical representation","volume":"1","author":"Cayley","year":"1878","journal-title":"Am. J. Math."},{"key":"ref_20","unstructured":"Humphreys, J.F. (1996). A Course in Group Theory, Oxford University Press. [1st ed.]."},{"key":"ref_21","unstructured":"Glaisher, J.W.L. (1890). On Latin squares. Messenger of Math, Macmillan and Co."},{"key":"ref_22","unstructured":"Cameron, P.J. (2025, October 17). Notes on Cryptography. University of London 2003. Available online: https:\/\/cameroncounts.wordpress.com\/wp-content\/uploads\/2013\/11\/crypt.pdf."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Keedwell, A.D., and D\u00e9nes, J. (2015). Elementary properties. Latin Squares and Their Applications, North-Holland. [2nd ed.].","DOI":"10.1016\/B978-0-444-63555-6.50001-5"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Singh, B., Athithan, G., and Pillai, R. (2021). On extensions of the one-time-pad. AIP Conf. Proc., 298, Available online: https:\/\/eprint.iacr.org\/2021\/298.","DOI":"10.1017\/mag.2021.62"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1002\/csc2.20673","article-title":"Use of a Latin square design to assess experimental errors in field evaluation of cotton for resistance to Fusarium wilt race 4","volume":"62","author":"Zhang","year":"2022","journal-title":"Crop Sci."},{"key":"ref_26","first-page":"4","article-title":"A survey of compiler testing","volume":"53","author":"Chen","year":"2020","journal-title":"ACM Comput. Surv."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1615\/TelecomRadEng.2021036647","article-title":"New method for designing non-equidistant plane antenna arrays with full coverage of spatial frequencies based on Latin squares and their triangular matrix","volume":"80","author":"Luo","year":"2021","journal-title":"Telecommun. Radio Eng."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Zolfaghari, B., and Bibak, K. (2022). Combinatorial cryptography and Latin squares. Perfect Secrecy in IoT: A Hybrid Combinatorial-Boolean Approach, Springer.","DOI":"10.1007\/978-3-031-13191-2"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1080\/01611194.2020.1721615","article-title":"Quasigroups and their applications in cryptography","volume":"45","author":"Chauhan","year":"2021","journal-title":"Cryptologia"},{"key":"ref_30","first-page":"510","article-title":"Cryptosystems using an improving hiding technique based on Latin square and magic square","volume":"20","author":"Mohammed","year":"2020","journal-title":"Indones. J. Electr. Eng. Comput. Sci."},{"key":"ref_31","unstructured":"Schmidt, N.O. (2016). Latin Squares and Their Applications in Cryptography. [Master\u2019s Thesis, Boise State University]."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1007\/s11071-021-06308-3","article-title":"Design and application of an S-box using complete Latin square","volume":"104","author":"Hua","year":"2021","journal-title":"Nonlinear Dyn."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Kumar, U., and Venkaiah, V.C. (2022). A new modified MD5-224 bits hash function and an efficient message authentication code based on quasigroups. Cyber Security, Privacy and Networking: Proceedings of ICSPN 2021, Springer Nature Singapore.","DOI":"10.1007\/978-981-16-8664-1_1"},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Ahmad, H., and Hannusch, C. (2023, January 29\u201331). A new keyed hash function based on Latin squares and error-correcting codes to authenticate users in smart home environments. Proceedings of the Codes, Cryptology and Information Security, Rabat, Morocco.","DOI":"10.1007\/978-3-031-33017-9_8"},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"3831","DOI":"10.1007\/s11071-022-07990-7","article-title":"Cryptanalysis and improvement of an image encryption algorithm based on chaotic and Latin square","volume":"111","author":"Wu","year":"2023","journal-title":"Nonlinear Dyn."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1109\/TSUSC.2022.3221125","article-title":"A novel key agreement protocol applying Latin square for cloud data sharing","volume":"8","author":"Shen","year":"2022","journal-title":"IEEE Trans. Sustain. Comput."},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Dixon, J.D., and Mortimer, B. (1996). Permutation Groups, Springer. [1st ed.].","DOI":"10.1007\/978-1-4612-0731-3"},{"key":"ref_38","first-page":"226","article-title":"A cryptosystem based on the symmetric group Sn","volume":"8","author":"Doliskani","year":"2008","journal-title":"Int. J. Comput. Sci. Netw. Secur."},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Stinson, D.R., and Paterson, M.B. (2019). Block ciphers and stream ciphers. Cryptography: Theory and Practice, Chapman and Hall\/CRC. [4th ed.].","DOI":"10.1201\/9781315282497-4"},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Roth, R. (2006). Introduction to Coding Theory, Cambridge University Press. [1st ed.].","DOI":"10.1017\/CBO9780511808968"},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"3251","DOI":"10.1109\/TIT.2020.3004749","article-title":"Reed\u2013Muller codes: Theory and algorithms","volume":"67","author":"Abbe","year":"2021","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"795292","DOI":"10.1155\/2014\/795292","article-title":"Two-key dependent permutation for use in symmetric cryptographic system","volume":"2014","author":"Kuppusamy","year":"2014","journal-title":"Math. Probl. Eng."},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Scharinger, J. (2005, January 7\u201311). An excellent permutation operator for cryptographic applications. Proceedings of the Computer Aided Systems Theory\u2014EUROCAST 2005, Las Palmas de Gran Canaria, Spain. Lecture Notes in Computer Science.","DOI":"10.1007\/11556985_42"},{"key":"ref_44","doi-asserted-by":"crossref","unstructured":"Chou, Y.C., Lin, C.H., Li, P.C., and Li, Y.C. (2010, January 15\u201317). A (2,3) threshold secret sharing scheme using Sudoku. Proceedings of the 6th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, Darmstadt, Germany.","DOI":"10.1109\/IIHMSP.2010.18"},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1080\/09720529.2010.10698290","article-title":"Design of strong cryptographic schemes based on Latin squares","volume":"13","author":"Pal","year":"2010","journal-title":"J. Discret. Math. Sci. Cryptogr."},{"key":"ref_46","doi-asserted-by":"crossref","unstructured":"Van Lint, J.H., and Wilson, R.M. (2001). A Course in Combinatorics, Cambridge University Press. [2nd ed.].","DOI":"10.1017\/CBO9780511987045"},{"key":"ref_47","unstructured":"(2025, May 27). Sequence A002860 in the On-Line Encyclopedia of Integer Sequences. Available online: https:\/\/oeis.org\/A002860."},{"key":"ref_48","doi-asserted-by":"crossref","unstructured":"Huffman, W.C., and Pless, V. (2003). Fundamentals of Error-Correcting Codes, Cambridge University Press. [1st ed.].","DOI":"10.1017\/CBO9780511807077"}],"container-title":["Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2410-387X\/9\/4\/70\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T18:46:25Z","timestamp":1762195585000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2410-387X\/9\/4\/70"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,31]]},"references-count":48,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["cryptography9040070"],"URL":"https:\/\/doi.org\/10.3390\/cryptography9040070","relation":{},"ISSN":["2410-387X"],"issn-type":[{"value":"2410-387X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,31]]}}}