{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:09:33Z","timestamp":1742940573997,"version":"3.40.3"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030142339"},{"type":"electronic","value":"9783030142346"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-14234-6_33","type":"book-chapter","created":{"date-parts":[[2019,2,20]],"date-time":"2019-02-20T08:02:08Z","timestamp":1550649728000},"page":"621-625","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Note on the Sidelnikov-Shestakov Attack of Niederreiter Scheme"],"prefix":"10.1007","author":[{"given":"Dingyi","family":"Pei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,2,21]]},"reference":[{"key":"33_CR1","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. Deep space network progress report, 42\u201344, pp. 114\u2013116 (1978)"},{"issue":"2","key":"33_CR2","first-page":"159","volume":"15","author":"H Niederreiter","year":"1986","unstructured":"Niederreiter, H.: Knapsack-type cryptosystems and algebraic coding theory. Prob. Control Inf. Theory 15(2), 159\u2013166 (1986)","journal-title":"Prob. Control Inf. Theory"},{"issue":"4","key":"33_CR3","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1515\/dma.1992.2.4.439","volume":"2","author":"VM Sidelnikov","year":"1992","unstructured":"Sidelnikov, V.M., Shestakov, S.O.: On insecurity of cryptosystems based on generalized Reed-Solomon codes. Discrete Math. Appl. 2(4), 439\u2013444 (1992)","journal-title":"Discrete Math. Appl."},{"key":"33_CR4","doi-asserted-by":"publisher","unstructured":"Chen, L., Chen, L., Jordan, S., Liu, Y.-K., Moody, D., et al.: Report on post-quantum cryptography. Technical reports (2016). https:\/\/doi.org\/10.6028\/nist.ir.8105","DOI":"10.6028\/nist.ir.8105"},{"issue":"2","key":"33_CR5","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s10623-014-9967-z","volume":"73","author":"A Couvreur","year":"2014","unstructured":"Couvreur, A., Gaborit, P., Gauthier-Umana, V., et al.: Distinguisher-based attacks on public-key cryptosystems using Reed\u2013Solomon codes. Des. codes Crypt. 73(2), 641\u2013666 (2014)","journal-title":"Des. codes Crypt."},{"key":"33_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-642-55220-5_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"A Couvreur","year":"2014","unstructured":"Couvreur, A., Otmani, A., Tillich, J.P.: Polynomial time attack on wild McEliece over quadratic extensions. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 17\u201339. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_2"},{"issue":"2","key":"33_CR7","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1515\/JMC.2007.009","volume":"1","author":"D Engelbert","year":"2007","unstructured":"Engelbert, D., Overbeck, R., Schmidt, A.: A summary of McEliece-type cryptosystems and their security. J. Math. Cryptol. 1(2), 151\u2013199 (2007)","journal-title":"J. Math. Cryptol."},{"key":"33_CR8","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-540-88702-7_4","volume-title":"Post-Quantum Cryptography","author":"R Overbeck","year":"2009","unstructured":"Overbeck, R., Sendrier, N.: Code-based cryptography. In: Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.) Post-Quantum Cryptography, pp. 95\u2013145. Springer, Berlin, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-540-88702-7_4"},{"key":"33_CR9","unstructured":"Gabidulin, E.: Public-key cryptosystems based on linear codes. In: Proceedings of 4th IMA Conference on Cryptography and Coding 1993, Codes & Ciphers. IMA Press (1995)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-14234-6_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:06:42Z","timestamp":1709824002000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-14234-6_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030142339","9783030142346"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-14234-6_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"21 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Inscrypt","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security and Cryptology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Fuzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cisc2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/xxhb.fjnu.edu.cn\/inscrypt2018\/","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":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"93","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":"32","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":"5","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":"34% - 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":"2","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}