{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T11:14:16Z","timestamp":1758280456542,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T00:00:00Z","timestamp":1664236800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T00:00:00Z","timestamp":1664236800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100009827","name":"Alexandria University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100009827","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Netw"],"published-print":{"date-parts":[[2023,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The polar code is a unique coding approach that can achieve Shannon's capacity in modern communication systems' discrete memory-less channels with superior reliability, but it is not secure enough under modern attacks for such systems. This study aims to offer a comprehensive secured polar coding scheme that uses a combination of polar coding and the Mersenne-Twister pseudo-random number generator (MT-PRNG) to achieve a super secured encoding. The pre-shared crypto-system cyphering key initiates the starting state of the MT-PRNG as a seed. The randomly generated sequences govern the values of the frozen bits in polarized bit channels and their associated indices. A half-bit-error-rate probability system performance is calculated when the encoding ciphering keys at the receiver differ by a single bit from those utilized at the transmitter. Using calculated numerical analysis, the system is shown to be secure against brute force attacks, Rao-Nam attacks, and polar code reconstruction attacks.<\/jats:p>","DOI":"10.1007\/s11276-022-03127-1","type":"journal-article","created":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T06:02:58Z","timestamp":1664258578000},"page":"423-435","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Secured polar code derived from random hopped frozen-bits"],"prefix":"10.1007","volume":"29","author":[{"given":"Karim H.","family":"Moussa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shawki","family":"Shaaban","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1157-6860","authenticated-orcid":false,"given":"Ahmed H.","family":"El-Sakka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,27]]},"reference":[{"issue":"8","key":"3127_CR1","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1109\/LCOMM.2011.061611.110862","volume":"15","author":"E Arikan","year":"2011","unstructured":"Arikan, E. (2011). Systematic polar coding. IEEE communications letters, 15(8), 860\u2013862.","journal-title":"IEEE communications letters"},{"issue":"7","key":"3127_CR2","doi-asserted-by":"publisher","first-page":"3051","DOI":"10.1109\/TIT.2009.2021379","volume":"55","author":"E Arikan","year":"2009","unstructured":"Arikan, E. (2009). Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels. IEEE Transactions on Information Theory, 55(7), 3051\u20133073.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"3127_CR3","doi-asserted-by":"publisher","first-page":"1751","DOI":"10.1109\/TIT.2010.2040961","volume":"56","author":"SB Korada","year":"2010","unstructured":"Korada, S. B., & Urbanke, R. L. (2010). Polar codes are optimal for lossy source coding. IEEE Transactions on Information Theory, 56(4), 1751\u20131768.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"3127_CR4","doi-asserted-by":"publisher","first-page":"2","DOI":"10.22237\/jmasm\/1051747320","volume":"2","author":"G Marsaglia","year":"2003","unstructured":"Marsaglia, G. (2003). Random number generators. Journal of Modern Applied Statistical Methods, 2(1), 2.","journal-title":"Journal of Modern Applied Statistical Methods"},{"issue":"1","key":"3127_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/272991.272995","volume":"8","author":"M Matsumoto","year":"1998","unstructured":"Matsumoto, M., & Nishimura, T. (1998). Mersenne twister: A 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Transactions on Modeling and Computer Simulation (TOMACS), 8(1), 3\u201330.","journal-title":"ACM Transactions on Modeling and Computer Simulation (TOMACS)"},{"key":"3127_CR6","volume-title":"Mersenne Twister\u2013A Pseudo-random number generator and its variants","author":"A Jagannatam","year":"2008","unstructured":"Jagannatam, A. (2008). Mersenne Twister\u2013A Pseudo-random number generator and its variants. George Mason University."},{"key":"3127_CR7","doi-asserted-by":"crossref","unstructured":"Chande, V., Farvardin, N., & Jafarkhani, H. (1999). Image communication over noisy channels with feedback. In Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348), vol. 2, pp. 540\u2013544.","DOI":"10.1109\/ICIP.1999.822954"},{"issue":"04","key":"3127_CR8","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1142\/S0218127400000505","volume":"10","author":"M Hasler","year":"2000","unstructured":"Hasler, M., & Schimming, T. (2000). Chaos communication over noisy channels. International Journal of Bifurcation and Chaos, 10(04), 719\u2013735.","journal-title":"International Journal of Bifurcation and Chaos"},{"key":"3127_CR9","first-page":"602","volume":"2017","author":"G Wang","year":"2017","unstructured":"Wang, G., Qin, Y., & Chang, C. (2017). Communication with partial noisy feedback. IEEE Symposium on Computers and Communications (ISCC), 2017, 602\u2013607.","journal-title":"IEEE Symposium on Computers and Communications (ISCC)"},{"key":"3127_CR10","first-page":"586","volume":"2018","author":"D Ding","year":"2018","unstructured":"Ding, D., & Guha, S. (2018). Noisy feedback and loss unlimited private communication. IEEE International Symposium on Information Theory (ISIT), 2018, 586\u2013590.","journal-title":"IEEE International Symposium on Information Theory (ISIT)"},{"issue":"10","key":"3127_CR11","doi-asserted-by":"publisher","first-page":"2126","DOI":"10.1109\/LCOMM.2017.2726523","volume":"21","author":"I-M Kim","year":"2017","unstructured":"Kim, I.-M., Kim, B.-H., & Ahn, J. K. (2017). Secure polar coding with REP and XOR coding. IEEE Communications Letters, 21(10), 2126\u20132129.","journal-title":"IEEE Communications Letters"},{"issue":"2","key":"3127_CR12","doi-asserted-by":"publisher","first-page":"1345","DOI":"10.1007\/s11277-015-2691-9","volume":"84","author":"R Hooshmand","year":"2015","unstructured":"Hooshmand, R., Aref, M. R., & Eghlidos, T. (2015). Secret key cryptosystem based on non-systematic polar codes. Wireless Personal Communications, 84(2), 1345\u20131373.","journal-title":"Wireless Personal Communications"},{"issue":"3","key":"3127_CR13","doi-asserted-by":"publisher","first-page":"357","DOI":"10.26599\/TST.2018.9010081","volume":"23","author":"C Sun","year":"2018","unstructured":"Sun, C., Fei, Z., Jia, D., Cao, C., & Wang, X. (2018). Secure transmission scheme for parallel relay channels based on polar coding. Tsinghua Science and Technology, 23(3), 357\u2013365.","journal-title":"Tsinghua Science and Technology"},{"issue":"6","key":"3127_CR14","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1109\/LCOMM.2014.2318306","volume":"18","author":"Y-S Kim","year":"2014","unstructured":"Kim, Y.-S., Kim, J.-H., & Kim, S.-H. (2014). A secure information transmission scheme with a secret key based on polar coding. IEEE Communications Letters, 18(6), 937\u2013940.","journal-title":"IEEE Communications Letters"},{"key":"3127_CR15","doi-asserted-by":"crossref","unstructured":"Soliman, T. H. M., Yang, F. F., & Ejaz, S. (2015). A polar coding scheme for secure data transmission based on 1D chaotic-map. In International Conference on Computer Information Systems and Industrial Applications (CISIA 2015), pp. 414\u2013417.","DOI":"10.2991\/cisia-15.2015.112"},{"issue":"2","key":"3127_CR16","first-page":"111","volume":"9","author":"B Mafakheri","year":"2017","unstructured":"Mafakheri, B., Eghlidos, T., & Pilaram, H. (2017). An efficient, secure channel coding scheme based on polar codes. The ISC International Journal of Information Security, 9(2), 111\u2013118.","journal-title":"The ISC International Journal of Information Security"},{"key":"3127_CR17","first-page":"1496","volume":"2009","author":"R Mori","year":"2009","unstructured":"Mori, R., & Tanaka, T. (2009). Performance and construction of polar codes on symmetric binary-input memoryless channels. IEEE International Symposium on Information Theory, 2009, 1496\u20131500.","journal-title":"IEEE International Symposium on Information Theory"},{"issue":"7","key":"3127_CR18","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.1109\/LCOMM.2014.2325811","volume":"18","author":"D Wu","year":"2014","unstructured":"Wu, D., Li, Y., & Sun, Y. (2014). Construction and block error rate analysis of polar codes over AWGN channel based on Gaussian approximation. IEEE Communications Letters, 18(7), 1099\u20131102.","journal-title":"IEEE Communications Letters"},{"issue":"1","key":"3127_CR19","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/584091.584093","volume":"5","author":"CE Shannon","year":"2001","unstructured":"Shannon, C. E. (2001). A mathematical theory of communication. ACM SIGMOBILE Mobile Computing and Communications Review, 5(1), 3\u201355.","journal-title":"ACM SIGMOBILE Mobile Computing and Communications Review"},{"key":"3127_CR20","doi-asserted-by":"crossref","unstructured":"Guo, J., Sayir, J., Qin, M., & Fabregas A. G. I. (2015). An alternative proof of channel polarization for channels with arbitrary input alphabets. In 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton). pp. 522\u2013529.","DOI":"10.1109\/ALLERTON.2015.7447049"},{"issue":"1","key":"3127_CR21","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/LCOMM.2015.2497220","volume":"20","author":"H Vangala","year":"2015","unstructured":"Vangala, H., Hong, Y., & Viterbo, E. (2015). Efficient algorithms for systematic polar encoding. IEEE Communications Letters, 20(1), 17\u201320.","journal-title":"IEEE Communications Letters"},{"issue":"11","key":"3127_CR22","doi-asserted-by":"publisher","first-page":"2248","DOI":"10.1109\/JLT.2018.2802539","volume":"36","author":"T Koike-Akino","year":"2018","unstructured":"Koike-Akino, T., et al. (2018). Irregular polar coding for complexity-constrained lightwave systems. Journal of Lightwave Technology, 36(11), 2248\u20132258.","journal-title":"Journal of Lightwave Technology"},{"issue":"12","key":"3127_CR23","doi-asserted-by":"publisher","first-page":"1378","DOI":"10.1109\/LCOMM.2011.101811.111480","volume":"15","author":"A Alamdar-Yazdi","year":"2011","unstructured":"Alamdar-Yazdi, A., & Kschischang, F. R. (2011). A simplified successive-cancellation decoder for polar codes. IEEE Communications Letters, 15(12), 1378\u20131380.","journal-title":"IEEE Communications Letters"},{"issue":"4","key":"3127_CR24","doi-asserted-by":"publisher","first-page":"69","DOI":"10.4316\/AECE.2013.04012","volume":"13","author":"B Belean","year":"2013","unstructured":"Belean, B., Borda, M., Bot, A., & Nedevschi, S. (2013). Low Complexity Approach for High Throughput Belief-Propagation based Decoding of LDPC Codes. Advances in Electrical and Computer Engineering, 13(4), 69\u201373.","journal-title":"Advances in Electrical and Computer Engineering"},{"key":"3127_CR25","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1109\/LCOMM.2022.3146876","volume":"26","author":"C Chen","year":"2022","unstructured":"Chen, C., Zhang, X., Liu, Y., Wang, W., & Zeng, Q. (2022). An ultra-low complexity early stopping criterion for belief propagation polar code decoder. IEEE Communications Letters, 26, 723.","journal-title":"IEEE Communications Letters"},{"issue":"2","key":"3127_CR26","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1109\/49.661103","volume":"16","author":"RJ McEliece","year":"1998","unstructured":"McEliece, R. J., MacKay, D. J. C., & Cheng, J.-F. (1998). Turbo decoding as an instance of Pearl\u2019s\" belief propagation\" algorithm. IEEE Journal on Selected Areas in Communications, 16(2), 140\u2013152.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"3127_CR27","volume-title":"Performance of short polar codes under ML decoding","author":"E Arkan","year":"2009","unstructured":"Arkan, E., Kim, H., Markarian, G., Ozgur, U., & Poyraz, E. (2009). Performance of short polar codes under ML decoding. Santander: Proc ICT MobileSummit."},{"key":"3127_CR28","doi-asserted-by":"crossref","unstructured":"Co\u015fkun, M. C., & Pfister, H. D. (2021). An information-theoretic perspective on successive cancellation list decoding and polar code design. arXiv preprint arXiv:2103.16680.","DOI":"10.1109\/TIT.2022.3173152"},{"issue":"3","key":"3127_CR29","first-page":"75","volume":"2","author":"KT Dave","year":"2013","unstructured":"Dave, K. T. (2013). Brute-force attack \u2018seeking but distressing.\u2019 Int. J. Innov. Eng. Technol. Brute-force, 2(3), 75\u201378.","journal-title":"Int. J. Innov. Eng. Technol. Brute-force"},{"issue":"1","key":"3127_CR30","first-page":"361","volume":"14","author":"A Rechavi","year":"2020","unstructured":"Rechavi, A., & Berenblum, T. (2020). What\u2019s in a Name? Using words\u2019 uniqueness to identify hackers in brute force attacks. International Journal of Cyber Criminology, 14(1), 361\u2013382.","journal-title":"International Journal of Cyber Criminology"},{"issue":"4","key":"3127_CR31","first-page":"254","volume":"3","author":"N Garg","year":"2013","unstructured":"Garg, N., Kukreja, R., & Sharma, P. (2013). Revisiting defences against large scale online password guessing attacks. International Journal of Scientific and Research Publications, 3(4), 254.","journal-title":"International Journal of Scientific and Research Publications"},{"issue":"3","key":"3127_CR32","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1109\/CC.2014.6825260","volume":"11","author":"L Ning","year":"2014","unstructured":"Ning, L., Kanfeng, L., Wenliang, L., & Zhongliang, D. (2014). A joint encryption and error correction method used in satellite communications. China Communications, 11(3), 70\u201379.","journal-title":"China Communications"}],"container-title":["Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-022-03127-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11276-022-03127-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-022-03127-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T17:16:48Z","timestamp":1673025408000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11276-022-03127-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,27]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["3127"],"URL":"https:\/\/doi.org\/10.1007\/s11276-022-03127-1","relation":{},"ISSN":["1022-0038","1572-8196"],"issn-type":[{"type":"print","value":"1022-0038"},{"type":"electronic","value":"1572-8196"}],"subject":[],"published":{"date-parts":[[2022,9,27]]},"assertion":[{"value":"27 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}