{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T10:44:31Z","timestamp":1761648271246},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,5,27]],"date-time":"2015-05-27T00:00:00Z","timestamp":1432684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Pers Commun"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1007\/s11277-015-2691-9","type":"journal-article","created":{"date-parts":[[2015,5,26]],"date-time":"2015-05-26T11:49:17Z","timestamp":1432640957000},"page":"1345-1373","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Secret Key Cryptosystem Based on Non-systematic Polar Codes"],"prefix":"10.1007","volume":"84","author":[{"given":"Reza","family":"Hooshmand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad Reza","family":"Aref","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taraneh","family":"Eghlidos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,5,27]]},"reference":[{"key":"2691_CR1","volume-title":"Error control coding: fundamentals and applications","author":"S Lin","year":"2004","unstructured":"Lin, S., & Costello, D. J. (2004). Error control coding: fundamentals and applications (2nd ed.). Upper Saddle River, NJ: Prentice-Hall.","edition":"2"},{"issue":"7","key":"2691_CR2","doi-asserted-by":"crossref","first-page":"3051","DOI":"10.1109\/TIT.2009.2021379","volume":"55","author":"E Ar\u0131kan","year":"2009","unstructured":"Ar\u0131kan, 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":"8","key":"2691_CR3","doi-asserted-by":"crossref","first-page":"2933","DOI":"10.1109\/TIT.2007.901143","volume":"53","author":"A Thangaraj","year":"2007","unstructured":"Thangaraj, A., Dihidar, S., Calderbank, A., McLaughlin, S., & Merolla, J. M. (2007). Applications of LDPC codes to the wiretap channel. IEEE Transactions on Information Theory, 53(8), 2933\u20132945.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"10","key":"2691_CR4","doi-asserted-by":"crossref","first-page":"6428","DOI":"10.1109\/TIT.2011.2162275","volume":"57","author":"H Mahdavifar","year":"2011","unstructured":"Mahdavifar, H., & Vardy, A. (2011). Achieving the secrecy capacity of wiretap channels using polar Codes. IEEE Transactions on Information Theory, 57(10), 6428\u20136443.","journal-title":"IEEE Transactions on Information Theory"},{"key":"2691_CR5","first-page":"114","volume-title":"A public-key cryptosystem based on algebraic coding theory. DNS progress report","author":"RJ McEliece","year":"1978","unstructured":"McEliece, R. J. (1978). A public-key cryptosystem based on algebraic coding theory. DNS progress report (pp. 114\u2013116). Pasadena, CA: Jet Propulsion Labaratory."},{"issue":"4","key":"2691_CR6","first-page":"829","volume":"35","author":"TRN Rao","year":"1987","unstructured":"Rao, T. R. N., & Nam, K. H. (1989). Private-key algebraic-code encryption. IEEE Transactions on Information Theory, 35(4), 829\u2013833.","journal-title":"IEEE Transactions on Information Theory"},{"key":"2691_CR7","volume-title":"Post-quantum cryptography","author":"DJ Bernstein","year":"2008","unstructured":"Bernstein, D. J., Buchmann, J., & Dahmen, E. (2008). Post-quantum cryptography. New York: Springer."},{"issue":"5","key":"2691_CR8","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"ER Berlekamp","year":"1978","unstructured":"Berlekamp, E. R., McEliece, R. J., & van Tilborg, H. C. A. (1978). On the inherent intractability of certain coding problems. IEEE Transactions on Information Theory, 24(5), 384\u2013386.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"10","key":"2691_CR9","doi-asserted-by":"crossref","first-page":"2669","DOI":"10.1109\/TIT.2002.802608","volume":"48","author":"T Johansson","year":"2002","unstructured":"Johansson, T., & Jonsson, F. (2002). On the complexity of some cryptographic problems based on the general decoding problem. IEEE Transactions on Information Theory, 48(10), 2669\u20132678.","journal-title":"IEEE Transactions on Information Theory"},{"key":"2691_CR10","doi-asserted-by":"crossref","unstructured":"Rao, T. R. N. (1984). Joint encryption and error correction schemes. In Proceedings of the 11th Annual International Symposium on Computer Architecture, Ann Arbor, Mich. (pp. 240\u2013241).","DOI":"10.1145\/800015.808188"},{"key":"2691_CR11","unstructured":"Struik, R., & van Tilburg, J. (1987). The Rao\u2013Nam scheme is insecure against a chosen-plaintext attack. In Pomerance C (Ed.), Advances in cryptology\u2014CRYPTO\u02bc87(pp. 445\u2013457). New York: Springer."},{"issue":"24","key":"2691_CR12","doi-asserted-by":"crossref","first-page":"2226","DOI":"10.1049\/el:19961491","volume":"32","author":"A Al Jabri","year":"1996","unstructured":"Al Jabri, A. (1996). Security of private-key encryption based on array codes. IEEE Electronics Letters, 32(24), 2226\u20132227.","journal-title":"IEEE Electronics Letters"},{"issue":"24","key":"2691_CR13","doi-asserted-by":"crossref","first-page":"2035","DOI":"10.1049\/el:19971359","volume":"33","author":"HM Sun","year":"1997","unstructured":"Sun, H. M. (1997). Private key cryptosystem based on burst error correcting codes. IEEE Electron. Lett., 33(24), 2035\u20132036.","journal-title":"IEEE Electron. Lett."},{"key":"2691_CR14","doi-asserted-by":"crossref","unstructured":"Sun, H. M., & Shieh, S. P. (1998). On private-key cryptosystems based on product codes. In Proceedings of the 3rd Australasian Conference on Information Security and Privacy (pp. 68\u201379).","DOI":"10.1007\/BFb0053722"},{"key":"2691_CR15","unstructured":"Barbero, A. I., & Ytrehus, O. (1998). Modifications of the Rao\u2013Nam cryptosystem. In Proceedings of International Conference on Coding Theory, Cryptography and Related Areas (pp. 1\u201313)."},{"issue":"2","key":"2691_CR16","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1049\/ip-com:20050086","volume":"153","author":"A Payandeh","year":"2006","unstructured":"Payandeh, A., Ahmadian, M., & Aref, M. R. (2006). Adaptive secure channel coding based on punctured turbo codes. IEE Proceedings-Communications, 153(2), 313\u2013316.","journal-title":"IEE Proceedings-Communications"},{"issue":"4","key":"2691_CR17","first-page":"373","volume":"13","author":"A Payandeh","year":"2006","unstructured":"Payandeh, A., Ahmadian, M., & Aref, M. R. (2006). An adaptive secure channel coding scheme for data transmission over LEO satellite channels. Scientica Iranica, 13(4), 373\u2013378.","journal-title":"Scientica Iranica"},{"issue":"2","key":"2691_CR18","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1049\/iet-com:20080050","volume":"3","author":"AA Sobhi Afshar","year":"2009","unstructured":"Sobhi Afshar, A. A., Eghlidos, T., & Aref, M. R. (2009). Efficient secure channel coding based on quasi-cyclic low-density parity-check codes. IET Communications Journals, 3(2), 279\u2013292.","journal-title":"IET Communications Journals"},{"issue":"1","key":"2691_CR19","first-page":"3","volume":"4","author":"R Hooshmand","year":"2012","unstructured":"Hooshmand, R., Eghlidos, T., & Aref, M. R. (2012). Improving the Rao\u2013Nam secret key cryptosystem using regular EDF-QC-LDPC codes. ISeCure Journal, 4(1), 3\u201314.","journal-title":"ISeCure Journal"},{"key":"2691_CR20","doi-asserted-by":"crossref","unstructured":"Hof, E., & Shamai, S. (2010). Secrecy-achieving polar-coding. In Proceedings of IEEE Information Theory Workshop (pp. 1\u20135).","DOI":"10.1109\/CIG.2010.5592878"},{"key":"2691_CR21","doi-asserted-by":"crossref","unstructured":"Hooshmand, R., Koochak Shooshtari, M., & Aref, M. R. (2013). Secret key cryptosystem based on polar codes over binary erasure channel. In Proceedings of ISCISC2013, Yazd University, Iran (pp. 1\u20137).","DOI":"10.1109\/ISCISC.2013.6767351"},{"issue":"2","key":"2691_CR22","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0898-1221(94)90038-8","volume":"27","author":"HM Sun","year":"1994","unstructured":"Sun, H. M., & Hwang, T. (1994). Key generation of algebraic-code cryptosystems. Computers & Mathematics with Applications, 27(2), 99\u2013106.","journal-title":"Computers & Mathematics with Applications"},{"key":"2691_CR23","doi-asserted-by":"crossref","unstructured":"Goela, N., Korada, S. B., & Gastpar, M. (2010). On LP decoding of polar codes. In Proceedings of IEEE Information Theory Workshop (pp. 1\u20135).","DOI":"10.1109\/CIG.2010.5592698"},{"key":"2691_CR24","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1109\/LCOMM.2008.080017","volume":"12","author":"E Ar\u0131kan","year":"2008","unstructured":"Ar\u0131kan, E. (2008). A performance comparison of polar codes and Reed\u2013Muller codes. IEEE Communications Letters, 12, 447\u2013449.","journal-title":"IEEE Communications Letters"},{"issue":"8","key":"2691_CR25","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1109\/LCOMM.2011.061611.110862","volume":"15","author":"E Ar\u0131kan","year":"2011","unstructured":"Ar\u0131kan, E. (2011). Systematic polar coding. IEEE Communications Letters, 15(8), 860\u2013862.","journal-title":"IEEE Communications Letters"},{"key":"2691_CR26","unstructured":"Korada, S. B., Montanari, A., Telatar, E., & Urbanke, R. (2010). An emprical scaling law for polar codes. In Proceedings IEEE International Symposium on Information Theory (pp. 884\u2013888)."},{"key":"2691_CR27","doi-asserted-by":"crossref","unstructured":"Goli, A., Hassani, S. H., & Urbanke, R. (2012). Universal bounds on the scaling behavior of polar codes. In Proceedings of IEEE International Symposium on Information Theory (pp. 1957\u20131961).","DOI":"10.1109\/ISIT.2012.6283641"},{"key":"2691_CR28","unstructured":"Meijers, J., & Tilburg, J. V. (1991). Extended majority voting and private-key algebraic code encryptions. In Proceedings of ASIACRYPT\u201991, 739 Fujiyoshida, Japan (pp. 288\u2013298)."},{"key":"2691_CR29","unstructured":"van Tilburg, J. (1994). Security-analysis of a class of cryptosystems based on linear error-correcting codes. Ph.D. dissertation, Tech. Univ. Eindhoven, Eindhoven, The Netherlands."},{"key":"2691_CR30","unstructured":"Hwang, T., & Rao, T. R. N. (1988). Secret error-correcting codes (SECC). In Proceedings of CRYPTO\u201988, vol. 403, Santa Barbara, California, USA (pp. 540\u2013563)."},{"key":"2691_CR31","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1080\/03081089208818121","volume":"31","author":"HM Sun","year":"1992","unstructured":"Sun, H. M., & Hwang, T. (1992). On double-one matrices and double-zero matrices. Linear and Multilinear Algebra, 31, 47\u201355.","journal-title":"Linear and Multilinear Algebra"},{"key":"2691_CR32","unstructured":"Vladimirova, T. (2006). Investigation of fault propagation in encryption of satellite images using the AES algorithm. In IEEE Military Communications Conference, MILCOM 2006."},{"issue":"2","key":"2691_CR33","first-page":"56","volume":"1","author":"HL Praveen","year":"2012","unstructured":"Praveen, H. L., Jayaramu, H. S., & Kurian, M. Z. (2012). Sattelite image encryption using AES. International Journal of Computer Science and Electrical Engineering, 1(2), 56\u201360.","journal-title":"International Journal of Computer Science and Electrical Engineering"},{"key":"2691_CR34","unstructured":"Mathur, C. N. (2007). A mathematical framework for combining error correction and encryption. Ph.D. thesis, Department of Electrical and Computer Engineering, Stevens Institute of Technology, Castle Point on Hudson, Hoboken, NJ, USA."},{"key":"2691_CR35","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/WCN\/2006\/42871","volume":"2006","author":"CN Mathur","year":"2006","unstructured":"Mathur, C. N., Narayan, K., & Subbalakshmi, K. P. (2006). On the design of error-correcting ciphers. EURASIP Journal on Wireless Communications and Networking, 2006, 1\u201312.","journal-title":"EURASIP Journal on Wireless Communications and Networking"},{"key":"2691_CR36","unstructured":"Finiasz, M. (2009). NP-completeness of certain sub-classes of the syndrome decoding problem. arXiv:0912.0453v1."},{"key":"2691_CR37","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0166-218X(00)00353-X","volume":"111","author":"A Valembois","year":"2001","unstructured":"Valembois, A. (2001). Detection and recognition of a binary linear code. Discrete Applied Mathematics, 111, 199\u2013218.","journal-title":"Discrete Applied Mathematics"},{"key":"2691_CR38","unstructured":"Barbier, J. (2005). Reconstruction of turbo-code encoders. In Proceedings of SPIE Security and Defense, Space Communication Technologies Symposium, Orlando, FL, USA (pp. 463\u2013473)."},{"key":"2691_CR39","first-page":"2737","volume-title":"Recovering a code\u2019s length and synchronization from a noisy intercepted bitstream. ISIT 2009","author":"M Cluzeau","year":"2009","unstructured":"Cluzeau, M., & Finiasz, M. (2009). Recovering a code\u2019s length and synchronization from a noisy intercepted bitstream. ISIT 2009 (pp. 2737\u20132741). Korea: Seoul."}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-015-2691-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11277-015-2691-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-015-2691-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T13:18:20Z","timestamp":1559395100000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11277-015-2691-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,27]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["2691"],"URL":"https:\/\/doi.org\/10.1007\/s11277-015-2691-9","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"value":"0929-6212","type":"print"},{"value":"1572-834X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,27]]}}}