{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T07:42:40Z","timestamp":1770882160455,"version":"3.50.1"},"reference-count":23,"publisher":"Informa UK Limited","issue":"3","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Cryptologia"],"published-print":{"date-parts":[[2018,5,4]]},"DOI":"10.1080\/01611194.2017.1362061","type":"journal-article","created":{"date-parts":[[2017,10,25]],"date-time":"2017-10-25T11:13:55Z","timestamp":1508930035000},"page":"227-239","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":5,"title":["A New variant of the McEliece cryptosystem based on the Smith form of convolutional codes"],"prefix":"10.1080","volume":"42","author":[{"given":"Hamza","family":"Moufek","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1482-7565","authenticated-orcid":false,"given":"Kenza","family":"Guenda","sequence":"additional","affiliation":[]}],"member":"301","published-online":{"date-parts":[[2017,10,25]]},"reference":[{"key":"CIT0001","doi-asserted-by":"crossref","unstructured":"Baldi, M., M. Bianchi, and F. Chiaraluce. 2013a. Optimization of the parity-check matrix density in QC-LDPC code-based McEliece cryptosystems. In Proceedings of the IEEE International Conference on Communications (ICC\u201913) - Workshop on Information Security over Noisy and Lossy Communication Systems. Budapest, Hungary, 707\u2013711.","DOI":"10.1109\/ICCW.2013.6649325"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1049\/iet-ifs.2012.0127"},{"key":"CIT0003","doi-asserted-by":"crossref","unstructured":"Baldi, M., M. Bianchi, N. Maturo, and F. Chiaraluce. 2013c. Improving the efficiency of the LDPC code-based McEliece cryptosystem through irregular codes. In Proceedings of the IEEE Symposium on Computers and Communications (ISCC\u201913). Split, Croatia, 197\u2013202.","DOI":"10.1109\/ISCC.2013.6754945"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-014-9187-8"},{"key":"CIT0006","unstructured":"Baldi, M., F. Chiaraluce, J. Rosenthal, and D. Schipani. 2015. A modification of the McEliece cryptosystem based on generalized Reed-Solomon codes. MEGA 2015, Italy. http:\/\/mega2015.science.unitn.it\/POSTERS\/BaldiChiaraluceRosenthalSchipani.pdf."},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055873"},{"key":"CIT0013","unstructured":"Dumer, I. 1991. On minimum distance decoding of linear codes. 5th Joint Soviet-Swedish, Workshop Information Theory, Moscow, 50\u201352."},{"key":"CIT0015","unstructured":"Finiasz, M. 2009. NP-completeness of certain sub-classes of the syndrome decoding problem, CoRR, abs\/0912.0453."},{"key":"CIT0016","unstructured":"Gaborit, P. 2005. Shorter keys for code based cryptography. International Workshop on Coding and Cryptography (WCC 2005), Norway, 81\u201391."},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1142\/S0219498806001855"},{"key":"CIT0018","doi-asserted-by":"crossref","unstructured":"Johannesson, R., and K. S. Zigangirov. 2015. Fundamentals of convolutional coding, IEEE Press, 2nd edition.","DOI":"10.1002\/9781119098799"},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1109\/18.272496"},{"key":"CIT0024","first-page":"114","volume":"42","author":"McEliece R. J.","year":"1978","journal-title":"DSN Progress Report"},{"key":"CIT0027","doi-asserted-by":"crossref","unstructured":"Misoczki, R., J.P. Tillich, N. Sendrier, and P. S. Barreto. 2013. MDPC-McEliece: New McEliece variants from moderate density parity-check codes. International Symposium on Information Theory, Turkey, 2069\u20132073.","DOI":"10.1109\/ISIT.2013.6620590"},{"key":"CIT0029","doi-asserted-by":"crossref","unstructured":"Moufek, H., and K. Guenda. 2015b. New variant of the McEliece cryptosystem. In 4th International Castle Meeting, Palmela Castle, Portugal. Coding Theory and Applications, Springer, 291\u2013296.","DOI":"10.1007\/978-3-319-17296-5_31"},{"key":"CIT0030","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2640271"},{"key":"CIT0031","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057777"},{"key":"CIT0032","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055937"},{"key":"CIT0033","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293172"},{"key":"CIT0034","doi-asserted-by":"publisher","DOI":"10.1515\/dma.1994.4.3.191"},{"key":"CIT0035","doi-asserted-by":"publisher","DOI":"10.1515\/dma.1992.2.4.439"},{"key":"CIT0037","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1054010"},{"key":"CIT0039","volume-title":"Sequential decoding","author":"Wozencraft J. M.","year":"1961"}],"container-title":["Cryptologia"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/01611194.2017.1362061","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,3,19]],"date-time":"2018-03-19T14:12:58Z","timestamp":1521468778000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/01611194.2017.1362061"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,25]]},"references-count":23,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2018,2,27]]},"published-print":{"date-parts":[[2018,5,4]]}},"alternative-id":["10.1080\/01611194.2017.1362061"],"URL":"https:\/\/doi.org\/10.1080\/01611194.2017.1362061","relation":{},"ISSN":["0161-1194","1558-1586"],"issn-type":[{"value":"0161-1194","type":"print"},{"value":"1558-1586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10,25]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=ucry20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=ucry20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"}]}}