{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:28:50Z","timestamp":1742912930963,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031803109"},{"type":"electronic","value":"9783031803116"}],"license":[{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-80311-6_13","type":"book-chapter","created":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:30:40Z","timestamp":1733963440000},"page":"257-278","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Novel PQ-KEM Based on\u00a0Coding Theory"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-9927-1157","authenticated-orcid":false,"given":"Ekta","family":"Bindal","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0588-9163","authenticated-orcid":false,"given":"Abhay Kumar","family":"Singh","sequence":"additional","affiliation":[]},{"given":"Manoj Kumar","family":"Singh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,12]]},"reference":[{"key":"13_CR1","unstructured":"Alazard, T.D., Sendrier, N., Tillich, J.P.: WAVE: a new family of trapdoor one-way preimage sampleable functions based on codes. In: ASIACRYPT (2019)"},{"key":"13_CR2","unstructured":"Albrecht, M.R., et al.: Classic McEliece. https:\/\/classic.mceliece.org\/ (2022)"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Alekhnovich, M.: More on average case vs approximation complexity. Comput. Complexity 20, 755\u2013786 (2011)","DOI":"10.1007\/s00037-011-0029-x"},{"key":"13_CR4","unstructured":"Aragon, N., et al.: BIKE: bit Flipping Key Encapsulation (2022). https:\/\/bikesuite.org\/"},{"issue":"3","key":"13_CR5","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"E Berlekamp","year":"1978","unstructured":"Berlekamp, E., McEliece, R., Van Tilborg, H.: On the inherent intractability of certain coding problems. IEEE Trans. Inf. Theory 24(3), 384\u2013386 (1978)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J.: Grover vs. mceliece. In: Post-Quantum Cryptography: Third International Workshop, PQCrypto 2010, Darmstadt, Germany, May 25-28, 2010. Proceedings 3, pp. 73\u201380. Springer (2010)","DOI":"10.1007\/978-3-642-12929-2_6"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"35586","DOI":"10.1109\/ACCESS.2024.3373314","volume":"12","author":"E Bindal","year":"2024","unstructured":"Bindal, E., Singh, A.K.: Secure and compact: a new variant of McEliece cryptosystem. IEEE Access 12, 35586\u201335596 (2024). https:\/\/doi.org\/10.1109\/ACCESS.2024.3373314","journal-title":"IEEE Access"},{"issue":"1","key":"13_CR8","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1109\/TIT.2021.3120440","volume":"68","author":"A Couvreur","year":"2021","unstructured":"Couvreur, A., Lequesne, M.: On the security of subspace subcodes of Reed-Solomon codes for public key encryption. IEEE Trans. Inf. Theory 68(1), 632\u2013648 (2021)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"13_CR9","unstructured":"Debris\u00a0Alazard, T., Sendrier, N., Tillich, J.P.: The problem with the SURF scheme. arXiv preprint arXiv:1706.08065 (2017)"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Esser, A., Bellini, E.: Syndrome decoding estimator. In: Public-Key Cryptography \u2013 PKC 2022, pp. 112\u2013141. Springer, Cham (2022)","DOI":"10.1007\/978-3-030-97121-2_5"},{"key":"13_CR11","doi-asserted-by":"publisher","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, STOC 196, pp. 212\u2013219. Association for Computing Machinery, New York (1996). https:\/\/doi.org\/10.1145\/237814.237866","DOI":"10.1145\/237814.237866"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Hofheinz, D., H\u00f6velmanns, K., Kiltz, E.: A modular analysis of the fujisaki-okamoto transformation. In: Theory of Cryptography Conference, pp. 341\u2013371. Springer (2017)","DOI":"10.1007\/978-3-319-70500-2_12"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Huffman, W.C., Pless, V.: Fundamentals of Error-Correcting Codes. Cambridge University Press (2003)","DOI":"10.1017\/CBO9780511807077"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography, Second Edition. Chapman & Hall\/CRC, 2nd edn. (2014)","DOI":"10.1201\/b17668"},{"issue":"11","key":"13_CR15","doi-asserted-by":"publisher","first-page":"2809","DOI":"10.1109\/TIT.2003.819332","volume":"49","author":"R Koetter","year":"2003","unstructured":"Koetter, R., Vardy, A.: Algebraic soft-decision decoding of reed-solomon codes. IEEE Trans. Inf. Theory 49(11), 2809\u20132825 (2003)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Lee, P.J., Brickell, E.F.: An observation on the security of McEliece\u2019s public-key cryptosystem. In: Workshop on the Theory and Application of of Cryptographic Techniques, pp. 275\u2013280. Springer (1988)","DOI":"10.1007\/3-540-45961-8_25"},{"issue":"1","key":"13_CR17","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1109\/18.272496","volume":"40","author":"YX Li","year":"1994","unstructured":"Li, Y.X., Deng, R.H., Wang, X.M.: On the equivalence of McEliece\u2019s and Niederreiter\u2019s public-key cryptosystems. IEEE Trans. Inf. Theory 40(1), 271\u2013273 (1994)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Mahdjoubi, R., Cayrel, P.L., Akleylek, S., Kenza, G.: A Novel Niederreiter-like cryptosystem based on the $$( u | u + v )$$-construction codes. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA) 55, 10 (2021). https:\/\/hal.inria.fr\/hal-03436797","DOI":"10.1051\/ita\/2021010"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"M\u00e1rquez-Corbella, I., Tillich, J.P.: Using Reed-Solomon codes in the $$(U|U+V)$$ construction and an application to cryptography. In: 2016 IEEE International Symposium on Information Theory (ISIT), pp. 930\u2013934. IEEE (2016)","DOI":"10.1109\/ISIT.2016.7541435"},{"key":"13_CR20","first-page":"114","volume":"4244","author":"RJ McEliece","year":"1978","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. Coding Thv 4244, 114\u2013116 (1978)","journal-title":"Coding Thv"},{"key":"13_CR21","unstructured":"Melchor, C.A., et al.: Hamming quasi-cyclic (HQC). http:\/\/pqc-hqc.org (2022)"},{"key":"13_CR22","unstructured":"National Institute of Standard Techonology(NIST) (2022). https:\/\/rb.gy\/y7z83"},{"issue":"2","key":"13_CR23","first-page":"157","volume":"15","author":"H Niederreiter","year":"1986","unstructured":"Niederreiter, H.: Knapsack-type cryptosystems and algebraic coding theory. Prob. Contr. Inform. Theory 15(2), 157\u2013166 (1986)","journal-title":"Prob. Contr. Inform. Theory"},{"key":"13_CR24","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s10623-008-9175-9","volume":"49","author":"R Nojima","year":"2008","unstructured":"Nojima, R., Imai, H., Kobara, K., Morozov, K.: Semantic security for the McEliece cryptosystem without random oracles. Des. Codes Crypt. 49, 289\u2013305 (2008)","journal-title":"Des. Codes Crypt."},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Peters, C.: Information-Set decoding for linear codes over $$\\mathbb{F}_q$$. In: International Workshop on Post-Quantum Cryptography, pp. 81\u201394. Springer (2010)","DOI":"10.1007\/978-3-642-12929-2_7"},{"issue":"5","key":"13_CR26","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/TIT.1962.1057777","volume":"8","author":"E Prange","year":"1962","unstructured":"Prange, E.: The use of information sets in decoding cyclic codes. IRE Trans. Inf. Theory 8(5), 5\u20139 (1962)","journal-title":"IRE Trans. Inf. Theory"},{"key":"13_CR27","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th Annual Symposium on Foundations of Computer Science, pp. 124\u2013134. IEEE (1994)","DOI":"10.1109\/SFCS.1994.365700"},{"key":"13_CR28","doi-asserted-by":"crossref","unstructured":"Stern, J.: A method for finding codewords of small weight. In: International Colloquium on Coding Theory and Applications, pp. 106\u2013113. Springer (1988)","DOI":"10.1007\/BFb0019850"},{"key":"13_CR29","unstructured":"Weger, V.: Information Set Decoding in the Lee Metric and the Local to Global Principle for Densities. https:\/\/shorturl.at\/qD037 (2020). thesis"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-80311-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T01:03:40Z","timestamp":1733965420000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-80311-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,12]]},"ISBN":["9783031803109","9783031803116"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-80311-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,12]]},"assertion":[{"value":"12 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"INDOCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in India","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chennai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}