{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T16:41:08Z","timestamp":1772556068585,"version":"3.50.1"},"reference-count":32,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2023,8,16]],"date-time":"2023-08-16T00:00:00Z","timestamp":1692144000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Ministry of Business, Innovation, and Employment","award":["MAUX1912"],"award-info":[{"award-number":["MAUX1912"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cryptography"],"abstract":"<jats:p>In this paper, we propose a new symmetric stream cipher encryption algorithm based on Graph Walks and 2-dimensional matrices, called Matrix Encryption Walks (MEW). We offer example Key Matrices and show the efficiency of the proposed method, which operates in linear complexity with an extremely large key space and low-resource requirements. We also provide the Proof of Concept code for the encryption algorithm and a detailed analysis of the security of our proposed MEW. The MEW algorithm is designed for low-resource environments such as IoT or smart devices and is therefore intended to be simple in operation. The encryption, decryption, and key generation time, along with the bytes required to store the key, are all discussed, and similar proposed algorithms are examined and compared. We further discuss the avalanche effect, key space, frequency analysis, Shannon entropy, and chosen\/known plaintext-ciphertext attacks, and how MEW remains robust against these attacks. We have also discussed the potential for future research into algorithms such as MEW, which make use of alternative structures and graphic methods for improving encryption models.<\/jats:p>","DOI":"10.3390\/cryptography7030041","type":"journal-article","created":{"date-parts":[[2023,8,16]],"date-time":"2023-08-16T10:08:09Z","timestamp":1692180489000},"page":"41","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Matrix Encryption Walks for Lightweight Cryptography"],"prefix":"10.3390","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7113-380X","authenticated-orcid":false,"given":"Aeryn","family":"Dunmore","sequence":"first","affiliation":[{"name":"Cybersecurity Lab, Massey University, SH17, Albany, Auckland 0632, New Zealand"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1606-6584","authenticated-orcid":false,"given":"Juliet","family":"Samandari","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Software Engineering, University of Canterbury, Corner Science and Engineering Roads, Upper Riccarton, Christchurch 8041, New Zealand"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1002-057X","authenticated-orcid":false,"given":"Julian","family":"Jang-Jaccard","sequence":"additional","affiliation":[{"name":"Cybersecurity Lab, Massey University, SH17, Albany, Auckland 0632, New Zealand"}]}],"member":"1968","published-online":{"date-parts":[[2023,8,16]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Hell, M., Johansson, T., Maximov, A., and Meier, W. (2006, January 9\u201314). A Stream Cipher Proposal: Grain-128. Proceedings of the 2006 IEEE International Symposium on Information Theory, Seattle, WA, USA.","DOI":"10.1109\/ISIT.2006.261549"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Singh, S., Sharma, P.K., Moon, S.Y., and Park, J.H. (2017). Advanced lightweight encryption algorithms for IoT devices: Survey, challenges and solutions. J. Ambient. Intell. Humaniz. Comput., 1\u201318.","DOI":"10.1007\/s12652-017-0494-4"},{"key":"ref_3","unstructured":"Duarte, F. (2023, July 29). Number of IOT Devices (2023\u20132030). Exploding Topics. Available online: https:\/\/explodingtopics.com\/blog\/number-of-iot-devices."},{"key":"ref_4","unstructured":"Atkins, D. (2021, January 7\u20139). Requirements for post-quantum cryptography on embedded devices in the IoT. Proceedings of the Third PQC Standardization Conference, Virtual."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1186\/s40537-019-0268-2","article-title":"Internet of Things is a revolutionary approach for future technology enhancement: A review","volume":"6","author":"Kumar","year":"2019","journal-title":"J. Big Data"},{"key":"ref_6","unstructured":"Cusack, B., and Chapman, E. (2016, January 5\u20136). Using graphic methods to challenge cryptographic performance. Proceedings of the 14th Australian Information Security Management Conference, Edith Cowan University, Perth, Australia."},{"key":"ref_7","unstructured":"Chapman, E. (2016). Using Graphic Based Systems to Improve Cryptographic Algorithms. [Ph.D. Thesis, Auckland University of Technology]."},{"key":"ref_8","first-page":"54","article-title":"Fast Mapping Method based on Matrix Approach For Elliptic Curve Cryptography","volume":"1","author":"Kinani","year":"2012","journal-title":"Int. J. Inf. Netw. Secur. (IJINS)"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Balamurugan, R., Kamalakannan, V., Rahul, G.D., and Tamilselvan, S. (2014, January 27\u201329). Enhancing Security in Text Messages Using Matrix Based Mapping and ElGamal Method in Elliptic Curve Cryptography. Proceedings of the 2014 International Conference on Contemporary Computing and Informatics (IC3I), Mysuru, India.","DOI":"10.1109\/IC3I.2014.7019749"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Abu-Faraj, M., Al-Hyari, A., and Alqadi, Z. (2022). A Complex Matrix Private Key to Enhance the Security Level of Image Cryptography. Symmetry, 14.","DOI":"10.3390\/sym14040664"},{"key":"ref_11","first-page":"60","article-title":"Image Cryptography with Matrix Array Symmetric Key using Chaos based Approach","volume":"10","author":"Kumar","year":"2018","journal-title":"Int. J. Comput. Netw. Inf. Secur."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1016\/j.chaos.2006.03.069","article-title":"The \u201cgolden\u201d matrices and a new kind of cryptography","volume":"32","author":"Stakhov","year":"2007","journal-title":"Chaos Solitons Fractals"},{"key":"ref_13","unstructured":"McEliece, R.J. (1978). Coding Thv. Technical Report 42\u201344, National Aeronautics and Space Administration, Jet Propulsion Laboratory, California Institute of Technology."},{"key":"ref_14","first-page":"57","article-title":"Overview of the Mceliece Cryptosystem and its Security","volume":"60","author":"Repka","year":"2014","journal-title":"Tatra Mt. Math. Publ."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"131","DOI":"10.55630\/sjc.2007.1.131-156","article-title":"On Graph-Based Cryptography and Symbolic Computations","volume":"1","author":"Ustimenko","year":"2007","journal-title":"Serdica J. Comput."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Costache, A., Feigon, B., Lauter, K., Massierer, M., and Pusk\u00e1s, A. (2018). Ramanujan graphs in cryptography. arXiv.","DOI":"10.1007\/978-3-030-19478-9_1"},{"key":"ref_17","unstructured":"Ustimenko, V. (2023, July 29). On semigroups of multiplicative Cremona transformations and new solutions of Post Quantum Cryptography. Available online: https:\/\/eprint.iacr.org\/2019\/133."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/s10958-007-0453-2","article-title":"On linguistic dynamical systems, families of graphs of large girth, and cryptography","volume":"140","author":"Ustimenko","year":"2007","journal-title":"J. Math. Sci."},{"key":"ref_19","first-page":"97","article-title":"A Graph Theory Approach on Cryptography","volume":"2","author":"Nandhini","year":"2018","journal-title":"J. Comput. Math."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Usman, M., Ahmed, I., Aslam, M.I., Khan, S., and Shah, U.A. (2017). SIT: A Lightweight Encryption Algorithm for Secure Internet of Things. arXiv.","DOI":"10.14569\/IJACSA.2017.080151"},{"key":"ref_21","unstructured":"Leander, G., Paar, C., Poschmann, A., and Schramm, K. (2007, January 26\u201328). New lightweight DES variants. Proceedings of the Fast Software Encryption: 14th International Workshop, FSE 2007, Luxembourg. Revised Selected Papers 14."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"5773","DOI":"10.1007\/s12652-020-01694-9","article-title":"LRBC: A lightweight block cipher design for resource constrained IoT devices","volume":"14","author":"Biswas","year":"2020","journal-title":"J. Ambient. Intell. Humaniz. Comput."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.future.2021.11.011","article-title":"Lightweight cryptography in IoT networks: A survey","volume":"129","author":"Rana","year":"2022","journal-title":"Future Gener. Comput. Syst."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Turan, M.S., McKay, K., Chang, D., Kang, J., Waller, N., Kelsey, J.M., Bassham, L.E., and Hong, D. (2023, July 29). Status Report on the Final Round of the NIST Lightweight Cryptography Standardization Process, Available online: https:\/\/nvlpubs.nist.gov\/nistpubs\/ir\/2023\/NIST.IR.8454.pdf.","DOI":"10.6028\/NIST.IR.8454"},{"key":"ref_25","unstructured":"Dobraunig, C., Eichlseder, M., Mendel, F., and Schl\u00e4ffer, M. (2023, July 29). Lightweight Authenticated Encryption & Hashing. Available online: https:\/\/ascon.iaik.tugraz.at\/."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Grover, L.K. (1996, January 22\u201324). A fast quantum mechanical algorithm for database search. Proceedings of the 28th Annual ACM Symposium on Theory of Computing\u2014STOC \u201996, Philadelphia, PA, USA.","DOI":"10.1145\/237814.237866"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"108122","DOI":"10.1016\/j.compeleceng.2022.108122","article-title":"Quantum cryptanalytic attacks of symmetric ciphers: A review","volume":"101","author":"Malviya","year":"2022","journal-title":"Comput. Electr. Eng."},{"key":"ref_28","unstructured":"Jozsa, R. (1999). Searching in Grover\u2019s Algorithm. arXiv."},{"key":"ref_29","unstructured":"dCode (2023, August 08). Frequency Analysis on dCode.fr. Available online: https:\/\/www.dcode.fr\/frequency-analysis."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Austen, J. (2001). Pride and Prejudice, Broadview Press.","DOI":"10.1007\/978-1-137-08108-7_4"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Garcia-Alfaro, J., Leneutre, J., Cuppens, N., and Yaich, R. (2021, January 12\u201313). An OWASP Top Ten Driven Survey on Web Application Protection Methods. Proceedings of the Risks and Security of Internet and Systems, Ames, IA, USA.","DOI":"10.1007\/978-3-030-68887-5"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1504\/IJWMC.2007.013798","article-title":"Grain: A stream cipher for constrained environments","volume":"2","author":"Hell","year":"2007","journal-title":"Int. J. Wirel. Mob. Comput."}],"container-title":["Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2410-387X\/7\/3\/41\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T20:35:04Z","timestamp":1760128504000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2410-387X\/7\/3\/41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,16]]},"references-count":32,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2023,9]]}},"alternative-id":["cryptography7030041"],"URL":"https:\/\/doi.org\/10.3390\/cryptography7030041","relation":{},"ISSN":["2410-387X"],"issn-type":[{"value":"2410-387X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,16]]}}}