{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T07:47:04Z","timestamp":1769068024916,"version":"3.49.0"},"reference-count":15,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T00:00:00Z","timestamp":1560556800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004530","name":"Universiti Putra Malaysia","doi-asserted-by":"publisher","award":["GP\/2018\/959540"],"award-info":[{"award-number":["GP\/2018\/959540"]}],"id":[{"id":"10.13039\/501100004530","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cryptography"],"abstract":"<jats:p>A cryptography system was developed previously based on Cipher Polygraphic Polyfunction transformations,      C  i \u00d7 j   ( t )   \u2261  A  i \u00d7 i  t   P  i \u00d7 j    m o d  N     where     C  i \u00d7 j     ,     P  i \u00d7 j     ,     A  i \u00d7 i      are cipher text, plain text, and encryption key, respectively. Whereas,     ( t )     is the number of transformations of plain text to cipher text. In this system, the parameters (     A  i \u00d7 i   ,  ( t )     ) are kept in secret by a sender of messages. The security of this system, including its combination with the second order linear recurrence Lucas sequence (LUC) and the Ron Rivest, Adi Shamir and Leonard Adleman (RSA) method, until now is being upgraded by some researchers. The studies found that there is some type of self-invertible     A  4 \u00d7 4      should be not chosen before transforming a plain text to cipher text in order to enhance the security of Cipher Tetragraphic Trifunction. This paper also seeks to obtain some patterns of self-invertible keys     A  6 \u00d7 6      and subsequently examine their effect on the system of Cipher Hexagraphic Polyfunction transformation. For that purpose, we need to find some solutions     L  3 \u00d7 3      for      L  3 \u00d7 3  2  \u2261  A  3 \u00d7 3    mod   N     when     A  3 \u00d7 3      are diagonal and symmetric matrices and subsequently implement the key     L  3 \u00d7 3      to get the pattern of     A  6 \u00d7 6     .<\/jats:p>","DOI":"10.3390\/cryptography3020015","type":"journal-article","created":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T03:24:41Z","timestamp":1560741881000},"page":"15","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Effect of Self-Invertible Matrix on Cipher Hexagraphic Polyfunction"],"prefix":"10.3390","volume":"3","author":[{"given":"Sally Lin Pei","family":"Ching","sequence":"first","affiliation":[{"name":"Department of Mathematics, Universiti Putra Malaysia, 43400 Serdang, Selangor, Malaysia"},{"name":"Boon Siew Honda Sdn. Bhd. (676896-A) 721, Persiaran Cassia Selatan 1, Kawasan Perindustrian Batu Kawan, 14100 Simpang Ampat, Penang, Malaysia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1197-0972","authenticated-orcid":false,"given":"Faridah","family":"Yunos","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Universiti Putra Malaysia, 43400 Serdang, Selangor, Malaysia"},{"name":"Institute for Mathematical Research, Universiti Putra Malaysia, 43400 Serdang, Selangor, Malaysia"}]}],"member":"1968","published-online":{"date-parts":[[2019,6,15]]},"reference":[{"key":"ref_1","unstructured":"Panigrahy, K.S., Acharya, B., and Jena, D. (2008, January 21\u201322). Image Encryption Using Self-Invertible Key Matrix of Hill Cipher Algorithm. Proceedings of the International Conference on Advance in Computing, Chikhli, India."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Asbullah, M.A., and Ariffin, M.R.K. (2019). Another Proof of Wiener\u2019s Short Secret Exponent. Malays. J. Sci., 67\u201373.","DOI":"10.22452\/mjs.sp2019no1.6"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","article-title":"A Method for Obtaining Digital Signatures and Public-Key Cryptosystems","volume":"21","author":"Rivest","year":"1978","journal-title":"Commun. ACM"},{"key":"ref_4","unstructured":"Yunos, F. (2001). Beberapa Penggunaan Teori Nombor Dalam Kriptografi. [Ph.D. Thesis, University Putra Malaysia]."},{"key":"ref_5","unstructured":"Yunos, F., Said, M.R.M., and Atan, K.A.M. (2001). Transformasi Polifungsi Saifer Digrafik Bermodulo N1 dalam Sistem Kriptografi. Proceeding Simposium Kebangsaan Sains Matematik ke-9, Institut Statistik Malaysia dan Pusat Pengajian Sains Matematik, Universiti Kebangsaan Malaysia."},{"key":"ref_6","first-page":"21","article-title":"Transformasi Polifungsi LUC dalam Sistem Kriptografi","volume":"37","author":"Yunos","year":"2002","journal-title":"J. Teknol."},{"key":"ref_7","unstructured":"Yunos, F., Chin, L.S., and Said, M.R.M. (2016). Effect of Self-Invertible Matrix on Cipher Tetragraphic Trifunction. AIP Proceeding SKSM25, AIP Publishing."},{"key":"ref_8","first-page":"73","article-title":"A New Modal of Hill Cipher Using Non\u2013Quadratic Residues","volume":"10","author":"Reddy","year":"2012","journal-title":"Int. J. Soft Comput. Eng."},{"key":"ref_9","first-page":"14","article-title":"Novel Methods of Generating Self-invertible Matrix for Hill Cipher Algorithm","volume":"1","author":"Acharya","year":"2007","journal-title":"Int. J. Secur."},{"key":"ref_10","unstructured":"Rosen, K.H. (1987). Elementary Number Theory and Its Applications (Six Edition), Addison-Wesley."},{"key":"ref_11","unstructured":"Kahn, D. (1967). The Codebreakers. The Story of Secret Writing, The Macmillan Company."},{"key":"ref_12","first-page":"44","article-title":"LUC Public Key Encryption: A Secure Alternative to RSA","volume":"18","author":"Smith","year":"1993","journal-title":"Dr. Dobb\u2019S J."},{"key":"ref_13","unstructured":"Mahapatra, A., and Dash, R. (2007). Data Encryption and Decryption by Using Hill Cipher Technique and Self Repetitive Matrix. [Bachelor\u2019s Thesis, National Institute of Technology]."},{"key":"ref_14","first-page":"11","article-title":"Design of a Robust Cryptosystem Algorithm for Non-Invertible Matrices Based on Hill Cipher","volume":"9","author":"Hamamreh","year":"2009","journal-title":"Int. J. Comput. Sci. Netw. Secur."},{"key":"ref_15","first-page":"7232","article-title":"An Encryption Algorithm Based on ASCII Value of Data","volume":"5","author":"Shinge","year":"2014","journal-title":"Int. J. Comput. Sci. Inf. Technol."}],"container-title":["Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2410-387X\/3\/2\/15\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T12:58:47Z","timestamp":1760187527000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2410-387X\/3\/2\/15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,15]]},"references-count":15,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2019,6]]}},"alternative-id":["cryptography3020015"],"URL":"https:\/\/doi.org\/10.3390\/cryptography3020015","relation":{},"ISSN":["2410-387X"],"issn-type":[{"value":"2410-387X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,15]]}}}