{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:47:20Z","timestamp":1743079640915,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030904272"},{"type":"electronic","value":"9783030904289"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-90428-9_2","type":"book-chapter","created":{"date-parts":[[2021,10,30]],"date-time":"2021-10-30T07:02:54Z","timestamp":1635577374000},"page":"24-50","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Security and Complexity of a New Variant of the McEliece Cryptosystem Using Non-linear Convolutional Codes"],"prefix":"10.1007","author":[{"given":"Michael Ekonde","family":"Sone","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,31]]},"reference":[{"key":"2_CR1","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. In: DSN Progress Report, pp. 114\u2013116 (1978)"},{"key":"2_CR2","first-page":"159","volume":"15","author":"H Niederreiter","year":"1986","unstructured":"Niederreiter, H.: Knapsack-type cryptosystems and algebraic coding theory. Probl. Contr. Inform. Theory 15, 159\u2013166 (1986)","journal-title":"Probl. Contr. Inform. Theory"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"3289","DOI":"10.1109\/TIT.2003.820038","volume":"49","author":"EM Gabidulin","year":"2003","unstructured":"Gabidulin, E.M., Ourivski, A.V., Honary, B., Ammar, B.: Reducible rank codes and their applications to cryptography. IEEE Trans. Inf. Theory 49, 3289\u20133293 (2003)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2_CR4","unstructured":"Gaborit, P.: Shorter keys for code-based cryptography. In: Proceedings of WCC, pp. 81\u201390 (2005)"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Sidelnikov, V.M.: A public-key cryptosystem based on binary Reed-Muller codes. Discrete Math. Appl. 4 (1994)","DOI":"10.1515\/dma.1994.4.3.191"},{"issue":"3","key":"2_CR6","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1049\/iet-ifs.2012.0127","volume":"7","author":"M Baldi","year":"2013","unstructured":"Baldi, M., Bianchi, M., Chiaraluce, F.: Security and complexity of the McEliece cryptosystem based on quasi-cyclic low-density parity-check codes. IET Inf. Secur. 7(3), 212\u2013220 (2013)","journal-title":"IET Inf. Secur."},{"issue":"3","key":"2_CR7","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1080\/01611194.2017.1362061","volume":"42","author":"H Moufek","year":"2018","unstructured":"Moufek, H., Guenda, K.: A new variant of the mceliece cryptosystem based on the smith form of convolutional codes. Cryptologia 42(3), 227\u2013239 (2018)","journal-title":"Cryptologia"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-642-38616-9_7","volume-title":"Post-Quantum Cryptography","author":"G Landais","year":"2013","unstructured":"Landais, G., Tillich, J.-P.: An efficient attack of a McEliece cryptosystem variant based on convolutional codes. In: Gaborit, P. (ed.) PQCrypto 2013. LNCS, vol. 7932, pp. 102\u2013117. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38616-9_7"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Trinca, D.: Sequential and parallel cascaded convolutional encryption with local propagation: toward future directions in symmetric cryptography. In: 3rd International Conference on Information Technology, USA, pp. 464\u2013469 (2006)","DOI":"10.1109\/ITNG.2006.120"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Sone, M.E.: Efficient key management scheme to enhance security-throughput trade-off performance in wireless networks. In: Proceedings of the Science and Information Conference (SAI), London, UK, pp. 1249\u20131256 (2015)","DOI":"10.1109\/SAI.2015.7237304"},{"key":"2_CR11","volume-title":"Error Correcting Codes","author":"WW Peterson","year":"1972","unstructured":"Peterson, W.W., Weldon, E.J.: Error Correcting Codes, 2nd edn. MIT Press, Cambridge (1972)","edition":"2"},{"issue":"5","key":"2_CR12","first-page":"67","volume":"6","author":"D Kumari","year":"2016","unstructured":"Kumari, D., Saini, M.L.: Design and performance analysis of convolutional encoder and viterbi decoder for various generator polynomials. Int. J. Eng. Res. Appl. 6(5), 67\u201371 (2016)","journal-title":"Int. J. Eng. Res. Appl."},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Moufek, H., Guenda, K.: McEliece cryptosystem based on punctured convolutional codes and the pseudo-random generators. In: ACM Communications in Computer Algebra, vol. 49, No. 1 (2015)","DOI":"10.1145\/2768577.2768607"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Sone, M.: FPGA-based McEliece cryptosystem using non-linear convolutional codes. In: Proceeding of the 17th International Joint Conference on e-Business and Telecommunications (ICETE 2020) \u2013 SECRYPT, pp. 64\u201375 (2020)","DOI":"10.5220\/0009767000640075"},{"issue":"7","key":"2_CR15","doi-asserted-by":"publisher","first-page":"2145","DOI":"10.1016\/j.laa.2013.06.013","volume":"439","author":"P Almeida","year":"2013","unstructured":"Almeida, P., Napp, D., Pinto, R.: A new class of superregular matrices and MDP convolutional codes. Linear Algebra Appl. 439(7), 2145\u20132157 (2013)","journal-title":"Linear Algebra Appl."},{"key":"2_CR16","volume-title":"Modern Digital and Analog Communication Systems","author":"BP Lathi","year":"1998","unstructured":"Lathi, B.P.: Modern Digital and Analog Communication Systems, 3rd edn. Oxford University Press, Oxford (1998)","edition":"3"},{"issue":"3","key":"2_CR17","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1109\/18.915687","volume":"47","author":"P Loidreau","year":"2001","unstructured":"Loidreau, P., Sendrier, N.: Weak keys in the McEliece public-key cryptosystem. IEEE Trans. Inf. Theory 47(3), 1207\u20131211 (2001)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Communications in Computer and Information Science","E-Business and Telecommunications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-90428-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,30]],"date-time":"2021-10-30T07:03:33Z","timestamp":1635577413000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-90428-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030904272","9783030904289"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-90428-9_2","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"31 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICETE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on E-Business and Telecommunications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icete2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icete.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Primoris","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"177","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}