{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:39Z","timestamp":1759638939112,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,5,23]],"date-time":"2018-05-23T00:00:00Z","timestamp":1527033600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Samsung Science and Technology Foundation","award":["SSTF-BA1602-01"],"award-info":[{"award-number":["SSTF-BA1602-01"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,5,23]]},"DOI":"10.1145\/3197507.3197513","type":"proceedings-article","created":{"date-parts":[[2018,5,25]],"date-time":"2018-05-25T12:39:28Z","timestamp":1527251968000},"page":"25-33","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["A New LRPC-Kronecker Product Codes Based Public-Key Cryptography"],"prefix":"10.1145","author":[{"given":"Jon-Lark","family":"Kim","sequence":"first","affiliation":[{"name":"Sogang University, Seoul, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lucky","family":"Galvez","sequence":"additional","affiliation":[{"name":"Sogang University, Seoul, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Young-Sik","family":"Kim","sequence":"additional","affiliation":[{"name":"Chosun University, Gwangju, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nari","family":"Lee","sequence":"additional","affiliation":[{"name":"Sogang University, Seoul, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,5,23]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"N. Aragon P. Gaborit A. Hauteville and J. P. Tillich. 2017. Improvement of Generic Attacks on the Rank Syndrome Decoding Problem. (2017). https:\/\/hal. archives-ouvertes.fr\/hal-01618464 working paper or preprint. A New LRPC-Kronecker Product Codes Based Public-Key Cryptography APKC'18 June 4 2018 Incheon Republic of Korea  N. Aragon P. Gaborit A. Hauteville and J. P. Tillich. 2017. Improvement of Generic Attacks on the Rank Syndrome Decoding Problem. (2017). https:\/\/hal. archives-ouvertes.fr\/hal-01618464 working paper or preprint. A New LRPC-Kronecker Product Codes Based Public-Key Cryptography APKC'18 June 4 2018 Incheon Republic of Korea"},{"volume-title":"2007 IEEE International Symposium on Information Theory. 2591--2595","author":"Baldi M.","key":"e_1_3_2_1_2_1"},{"volume-title":"Quasi-Cyclic Low-Density Parity-Check Codes in the McEliece Cryptosystem. In 2007 IEEE International Conference on Communications. 951--956","author":"Baldi M.","key":"e_1_3_2_1_3_1"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_31"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30556-9_18"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-003-6151-2"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055873"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88403-3_3"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1998.1608"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.651067"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"F. Chabaud and J. Stern. 1996. The cryptographic security of the syndrome decoding problem for rank distance codes. In Advances in Cryptology -- ASIACRYPT '96 K. Kim and T. Matsumoto (Eds.). Springer Berlin Heidelberg Berlin Heidelberg 368--381.   F. Chabaud and J. Stern. 1996. The cryptographic security of the syndrome decoding problem for rank distance codes. In Advances in Cryptology -- ASIACRYPT '96 K. Kim and T. Matsumoto (Eds.). Springer Berlin Heidelberg Berlin Heidelberg 368--381.","DOI":"10.1007\/BFb0034862"},{"key":"e_1_3_2_1_12_1","first-page":"48","article-title":"The failure of McEliece PKC based on Reed-Muller codes","volume":"6","author":"Chizhov I. V.","year":"2013","journal-title":"Prikl. Diskr. Mat. Suppl."},{"volume-title":"2014 IEEE International Symposium on Information Theory. 1446--1450","author":"Couvreur A.","key":"e_1_3_2_1_13_1"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(78)90015-8"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1837934.1837984"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_16"},{"volume-title":"2014 IEEE International Symposium on Information Theory. 1717--1721","author":"Faug\u00e8re J. C.","key":"e_1_3_2_1_17_1"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-015-0036-z"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72540-4_20"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-011-9114-1"},{"key":"e_1_3_2_1_21_1","first-page":"1","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"Gabidulin E. M.","year":"1985","journal-title":"Problemy Peredachi Informatsii"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.820038"},{"volume-title":"Proceedings of the 10th Annual International Conference on Theory and Application of Cryptographic Techniques (EUROCRYPT'91)","author":"Gabidulin E. M.","key":"e_1_3_2_1_23_1"},{"volume-title":"The Proceedings of Workshop on Coding and Cryptography (WCC)","year":"2013","author":"Gaborit P.","key":"e_1_3_2_1_24_1"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2511786"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"P. Gaborit O. Ruatta J. Schrek and G. Z\u00e9mor. 2014. New Results for Rank-Based Cryptography. In Progress in Cryptology -- AFRICACRYPT 2014 D. Pointcheval and D. Vergnaud (Eds.). Springer International Publishing Cham 1--12.  P. Gaborit O. Ruatta J. Schrek and G. Z\u00e9mor. 2014. New Results for Rank-Based Cryptography. In Progress in Cryptology -- AFRICACRYPT 2014 D. Pointcheval and D. Vergnaud (Eds.). Springer International Publishing Cham 1--12.","DOI":"10.1007\/978-3-319-06734-6_1"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2616127"},{"volume-title":"2015 IEEE International Symposium on Information Theory (ISIT). 2747--2751","author":"Hauteville A.","key":"e_1_3_2_1_28_1"},{"volume-title":"NTRU: A ring-based public key cryptosystem","year":"1998","author":"Hoffstein J.","key":"e_1_3_2_1_29_1"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1027351723034"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"K. Kobara and H. Imai. 2001. Semantically Secure McEliece Public-Key Cryptosystems -Conversions for McEliece PKC -. In Public Key Cryptography K. Kim (Ed.). Springer Berlin Heidelberg Berlin Heidelberg 19--35.   K. Kobara and H. Imai. 2001. Semantically Secure McEliece Public-Key Cryptosystems -Conversions for McEliece PKC -. In Public Key Cryptography K. Kim (Ed.). Springer Berlin Heidelberg Berlin Heidelberg 19--35.","DOI":"10.1007\/3-540-44586-2_2"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"G. Landais and J. P. Tillich. 2013. An Efficient Attack of a McEliece Cryptosystem Variant Based on Convolutional Codes. In Post-Quantum Cryptography P. Gaborit (Ed.). Springer Berlin Heidelberg Berlin Heidelberg 102--117.  G. Landais and J. P. Tillich. 2013. An Efficient Attack of a McEliece Cryptosystem Variant Based on Convolutional Codes. In Post-Quantum Cryptography P. Gaborit (Ed.). Springer Berlin Heidelberg Berlin Heidelberg 102--117.","DOI":"10.1007\/978-3-642-38616-9_7"},{"volume-title":"Proceedings of YACC","year":"2006","author":"Vehel F.","key":"e_1_3_2_1_33_1"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"P. Loidreau. 2017. A New Rank Metric Codes Based Encryption Scheme. In PostQuantum Cryptography T. Lange and T. Takagi (Eds.). Springer International Publishing Cham 3--17.  P. Loidreau. 2017. A New Rank Metric Codes Based Encryption Scheme. In PostQuantum Cryptography T. Lange and T. Takagi (Eds.). Springer International Publishing Cham 3--17.","DOI":"10.1007\/978-3-319-59879-6_1"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34129-8_45"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72540-4_20"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-05445-7_24"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620590"},{"volume-title":"2000 IEEE International Symposium on Information Theory. 215--.","author":"Monico C.","key":"e_1_3_2_1_40_1"},{"key":"e_1_3_2_1_41_1","first-page":"159","article-title":"Knapsack Type Cryptosystems and Algebraic Coding Theory","volume":"15","author":"Niederreiter H.","year":"1986","journal-title":"Problems of Control and Information Theory"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1020369320078"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/11554868_5"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002000050104"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293172"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1515\/dma.1994.4.3.191"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1515\/dma.1992.2.4.439"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12929-2_5"}],"event":{"name":"ASIA CCS '18: ACM Asia Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Incheon Republic of Korea","acronym":"ASIA CCS '18"},"container-title":["Proceedings of the 5th ACM on ASIA Public-Key Cryptography Workshop"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3197507.3197513","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3197507.3197513","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:22Z","timestamp":1750210762000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3197507.3197513"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,23]]},"references-count":47,"alternative-id":["10.1145\/3197507.3197513","10.1145\/3197507"],"URL":"https:\/\/doi.org\/10.1145\/3197507.3197513","relation":{},"subject":[],"published":{"date-parts":[[2018,5,23]]},"assertion":[{"value":"2018-05-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}