{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T07:45:56Z","timestamp":1763451956954,"version":"3.45.0"},"reference-count":22,"publisher":"Wiley","issue":"6","license":[{"start":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T00:00:00Z","timestamp":1760918400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"funder":[{"DOI":"10.13039\/501100004410","name":"T\u00fcrkiye Bilimsel ve Teknolojik Ara\u015ft\u0131rma Kurumu","doi-asserted-by":"publisher","award":["125R211"],"award-info":[{"award-number":["125R211"]}],"id":[{"id":"10.13039\/501100004410","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Security and Privacy"],"published-print":{"date-parts":[[2025,11]]},"abstract":"<jats:title>ABSTRACT<\/jats:title>\n                  <jats:p>Ensuring secure communication in the digital era is of paramount importance. This study introduces a novel encryption model that combines \u2010cyclic codes with the one\u2010time pad (OTP) method over Eisenstein\u2013Jacobi integers, achieving information\u2010theoretic security. The method constructs a finite ring over Eisenstein\u2013Jacobi integers, generates one\u2010time keys from \u2010cyclic codewords, and uses these keys to encrypt messages, guaranteeing each key is used only once. Multiple plausible ciphertexts are produced for each plaintext, making unauthorized decryption infeasible. Key findings show that the scheme provides high computational efficiency and robust resistance to cryptographic attacks, outperforming existing code\u2010based and public\u2010key systems. Security scales with prime selection, as longer codewords and keys increase protection. The algebraic structure of Eisenstein\u2013Jacobi integers enables efficient key generation and encryption operations, making the model suitable for critical security applications. Existing OTP and cyclic code\u2010based encryption systems are typically limited to binary fields or specific rings, constraining key diversity and scalability. By extending OTP to \u2010cyclic codes over Eisenstein\u2013Jacobi integers, the proposed model overcomes these limitations, providing a larger key space and more complex encryption structure. Code\u2010based encryption, including cyclic codes, offers quantum\u2010resistant security. This feature aligns the proposed OTP model with post\u2010quantum cryptography (PQC). This work demonstrates that combining cyclic codes with OTP creates an unbreakable and practical encryption framework, providing resistance against both conventional and quantum attacks.<\/jats:p>","DOI":"10.1002\/spy2.70124","type":"journal-article","created":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T00:16:17Z","timestamp":1761005777000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Secure Encryption Over Eisenstein\u2013Jacobi Integers From w$$ w $$\u2010Cyclic Codes"],"prefix":"10.1002","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2089-5660","authenticated-orcid":false,"given":"Murat","family":"G\u00fczeltepe","sequence":"first","affiliation":[{"name":"Department of Mathematics Sakarya University  Sakarya Turkey"}]},{"given":"Ersel","family":"Alkan","sequence":"additional","affiliation":[{"name":"Department of Mathematics Sakarya University  Sakarya Turkey"}]}],"member":"311","published-online":{"date-parts":[[2025,10,20]]},"reference":[{"volume-title":"Introduction to Modern Cryptography","year":"2008","author":"Katz J.","key":"e_1_2_9_2_1"},{"volume-title":"Introduction to Cryptography With Coding Theory","year":"2002","author":"Trappe W.","key":"e_1_2_9_3_1"},{"key":"e_1_2_9_4_1","unstructured":"Z.Kuklova \u201cCoding Theory Cryptography and Cryptographic Protocols\u2010Exercises With Solutions\u201d(Bachelor thesis Faculty of Informatics 2007)."},{"key":"e_1_2_9_5_1","doi-asserted-by":"publisher","DOI":"10.5121\/ijnsa.2011.3618"},{"key":"e_1_2_9_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICENCO.2017.8289821"},{"key":"e_1_2_9_7_1","first-page":"139","article-title":"Modified One\u2010Time Pad Data Security Scheme: Random Key Generation Approach","volume":"3","author":"Patil S.","year":"2014","journal-title":"International Journal of Computer Science and Security"},{"issue":"2","key":"e_1_2_9_8_1","first-page":"380","article-title":"Secure Encryption From Cyclic Codes","volume":"40","author":"\u00c7alkavur S.","year":"2022","journal-title":"Sigma Journal of Engineering and Natural Sciences"},{"issue":"2","key":"e_1_2_9_9_1","first-page":"529","article-title":"Secure Encryption Over the Ring F2+uF2+vF2+uvF2$$ {\\mathbbm{F}}_2+u{\\mathbbm{F}}_2+v{\\mathbbm{F}}_2+ uv{\\mathbbm{F}}_2 $$","volume":"42","author":"\u015eolt N.","year":"2024","journal-title":"Sigma Journal of Engineering and Natural Sciences"},{"key":"e_1_2_9_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057777"},{"key":"e_1_2_9_11_1","first-page":"17","volume-title":"Proceedings of the International MultiConference of Engineers and Computer Sciences, IMECS","author":"Abualrub T.","year":"2010"},{"key":"e_1_2_9_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-010-9399-3"},{"issue":"3","key":"e_1_2_9_13_1","first-page":"305","article-title":"On 1\u2212u$$ 1-u $$ Cyclic and Cyclic Codes Over F2+uF2+vF2$$ {\\mathbbm{F}}_2+u{\\mathbbm{F}}_2+v{\\mathbbm{F}}_2 $$","volume":"9","author":"Dertli A.","year":"2016","journal-title":"European Journal of Pure and Applied Mathematics"},{"volume-title":"Essential Coding Theory","year":"2023","author":"Gurusvami V.","key":"e_1_2_9_14_1"},{"key":"e_1_2_9_15_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511755279"},{"key":"e_1_2_9_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.923731"},{"issue":"1","key":"e_1_2_9_17_1","first-page":"8","article-title":"On Perfect Codes Over Ap[w]$$ {A}_p\\left[w\\right] $$","volume":"1","author":"G\u00fczeltepe M.","year":"2017","journal-title":"Journal of Applied Mathematics and Computation"},{"key":"e_1_2_9_18_1","doi-asserted-by":"publisher","DOI":"10.2991\/csit-19.2019.34"},{"key":"e_1_2_9_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2804444"},{"key":"e_1_2_9_20_1","unstructured":"V.Weger N.Gassner andJ.Rosenthal \u201cA Survey on Code\u2010Based Cryptography \u201dpreprint arXiv 2022 https:\/\/arxiv.org\/abs\/2201.07119."},{"key":"e_1_2_9_21_1","unstructured":"S.Ritterhoff G.Maringer S.Bitzer et al. \u201cFuLeeca: A Hash\u2010And\u2010Sign Scheme Based on Quasi\u2010Cyclic Codes \u201dIACR ePrint Archive 2023 https:\/\/eprint.iacr.org\/2023\/377."},{"key":"e_1_2_9_22_1","unstructured":"M.Sch\u00f6ffel J.Feldmann andN.Wehn \u201cCode\u2010Based Cryptography in IoT: A HW\/SW Co\u2010Design of HQC \u201dpreprint arXiv 2023 https:\/\/arxiv.org\/abs\/2301.04888."},{"key":"e_1_2_9_23_1","unstructured":"Z.Zheng W.Huang J.Xu andK.Tian \u201cA Generalization of Cyclic Code and Applications to Public Key Cryptosystems \u201dpreprint arXiv 2021 https:\/\/arxiv.org\/abs\/2112.14115."}],"container-title":["SECURITY AND PRIVACY"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/spy2.70124","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T07:42:33Z","timestamp":1763451753000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/spy2.70124"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,20]]},"references-count":22,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["10.1002\/spy2.70124"],"URL":"https:\/\/doi.org\/10.1002\/spy2.70124","archive":["Portico"],"relation":{},"ISSN":["2475-6725","2475-6725"],"issn-type":[{"type":"print","value":"2475-6725"},{"type":"electronic","value":"2475-6725"}],"subject":[],"published":{"date-parts":[[2025,10,20]]},"assertion":[{"value":"2025-04-28","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-10-06","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-10-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"e70124"}}