{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:56:16Z","timestamp":1743076576389,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":28,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819712373"},{"type":"electronic","value":"9789819712380"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-981-97-1238-0_15","type":"book-chapter","created":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T18:30:58Z","timestamp":1709836258000},"page":"282-305","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the security of REDOG"],"prefix":"10.1007","author":[{"given":"Tanja","family":"Lange","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Pellegrini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Ravagnani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,8]]},"reference":[{"key":"15_CR1","unstructured":"Carlos Aguilar Melchor, Nicolas Aragon, Slim Bettaieb, Loic Bidoux, Olivier Blazy, Jean-Christophe Deneuville, Phillipe Gaborit, Adrien Hauteville, and Gilles Z\u00e9mor. Ouroboros-R. Technical report, National Institute of Standards and Technology, 2017. available at https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization\/round-1-submissions"},{"key":"15_CR2","unstructured":"Carlos Aguilar Melchor, Nicolas Aragon, Slim Bettaieb, Loic Bidoux, Olivier Blazy, Jean-Christophe Deneuville, Phillippe Gaborit, and Gilles Z\u00e9mor. RQC. Technical report, National Institute of Standards and Technology, 2017. available at https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization\/round-1-submissions"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Gorjan Alagic, Jacob Alperin-Sheriff, Daniel Apon, David Cooper, Quynh Dang, John Kelsey, Yi-Kai Liu, Carl Miller, Dustin Moody, Rene Peralta, Ray Perlner, Angela Robinson, and Daniel Smith-Tone. Status report on the second round of the NIST post-quantum cryptography standardization process. NIST IR 8309, 2020. https:\/\/doi.org\/10.6028\/NIST.IR.8309","DOI":"10.6028\/NIST.IR.8240"},{"key":"15_CR4","unstructured":"Nicolas Aragon, Olivier Blazy, Jean-Christophe Deneuville, Philippe Gaborit, Adrien Hauteville, Olivier Ruatta, Jean-Pierre Tillich, and Gilles Z\u00e9mor. LAKE. Technical report, National Institute of Standards and Technology, 2017. available at https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization\/round-1-submissions"},{"key":"15_CR5","unstructured":"Nicolas Aragon, Olivier Blazy, Jean-Christophe Deneuville, Philippe Gaborit, Adrien Hauteville, Olivier Ruatta, Jean-Pierre Tillich, and Gilles Z\u00e9mor. LOCKER. Technical report, National Institute of Standards and Technology, 2017. available at https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization\/round-1-submissions"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Nicolas Aragon, Philippe Gaborit, Adrien Hauteville, and Jean-Pierre Tillich. A new algorithm for solving the rank syndrome decoding problem. In ISIT, pages 2421\u20132425. IEEE, 2018","DOI":"10.1109\/ISIT.2018.8437464"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Magali Bardet, Pierre Briaud, Maxime Bros, Philippe Gaborit, Vincent Neiger, Olivier Ruatta, and Jean-Pierre Tillich. An algebraic attack on rank metric code-based cryptosystems. In Anne Canteaut and Yuval Ishai, editors, EUROCRYPT 2020, Part III, volume 12107 of LNCS, pages 64\u201393, Zagreb, Croatia, May 10\u201314, 2020. Springer, Heidelberg, Germany","DOI":"10.1007\/978-3-030-45727-3_3"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Magali Bardet, Pierre Briaud, Maxime Bros, Philippe Gaborit, and Jean-Pierre Tillich. Revisiting algebraic attacks on minrank and on the rank decoding problem. Designs, Codes and Cryptography, pages 1\u201337, 07 2023","DOI":"10.1007\/s10623-023-01265-x"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Magali Bardet, Maxime Bros, Daniel Cabarcas, Philippe Gaborit, Ray A. Perlner, Daniel Smith-Tone, Jean-Pierre Tillich, and Javier A. Verbel. Improvements of algebraic attacks for solving the rank decoding and MinRank problems. In Shiho Moriai and Huaxiong Wang, editors, ASIACRYPT 2020, Part I, volume 12491 of LNCS, pages 507\u2013536, Daejeon, South Korea, December 7\u201311, 2020. Springer, Heidelberg, Germany","DOI":"10.1007\/978-3-030-64837-4_17"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Thierry\u00a0P. Berger. Isometries for rank distance and permutation group of Gabidulin codes. IEEE Trans. Inf. Theory, 49(11):3016\u20133019, 2003","DOI":"10.1109\/TIT.2003.819322"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Philippe Delsarte. Bilinear forms over a finite field, with applications to coding theory. Journal of Combinatorial Theory, Series A, 25(3):226\u2013241, 1978","DOI":"10.1016\/0097-3165(78)90015-8"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Jean-Christophe Deneuville, Philippe Gaborit, and Gilles Z\u00e9mor. Ouroboros: A simple, secure and efficient key exchange protocol based on coding theory. In Tanja Lange and Tsuyoshi Takagi, editors, Post-Quantum Cryptography - 8th International Workshop, PQCrypto 2017, pages 18\u201334, Utrecht, The Netherlands, June 26\u201328, 2017. Springer, Heidelberg, Germany","DOI":"10.1007\/978-3-319-59879-6_2"},{"key":"15_CR13","unstructured":"Ernst\u00a0M. Gabidulin. Theory of codes with maximum rank distance. Problems of Information Transmission, 21(1):1\u201312, 1985"},{"key":"15_CR14","unstructured":"Lucky Galvez, Jon-Lark Kim, Myeong Jae Kim, Young-Sik Kim, and Nari Lee. McNie. Technical report, National Institute of Standards and Technology, 2017. available at https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization\/round-1-submissions"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Ernst M. Gabidulin, A. V. Paramonov, and O. V. Tretjakov. Ideals over a non-commutative ring and thier applications in cryptology. In Donald W. Davies, editor, EUROCRYPT\u201991, volume 547 of LNCS, pages 482\u2013489, Brighton, UK, April 8\u201311, 1991. Springer, Heidelberg, Germany","DOI":"10.1007\/3-540-46416-6_41"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Philippe Gaborit, Olivier Ruatta, and Julien Schrek. On the complexity of the rank syndrome decoding problem. IEEE Transactions on Information Theory, 62(2):1006\u20131019, 2016","DOI":"10.1109\/TIT.2015.2511786"},{"key":"15_CR17","unstructured":"Jon-Lark Kim, Jihoon Hong, Terry Shue Chien Lau, YounJae Lim, Chik How Tan, Theo Fanuela Prabowo, and Byung-Sun Won. REDOG. Submission to KpqC Round 1, 2022"},{"key":"15_CR18","unstructured":"Jon-Lark Kim, Jihoon Hong, Terry Shue Chien Lau, YounJae Lim, Chik How Tan, Theo Fanuela Prabowo, and Byung-Sun Won. REDOG and its performance analysis. Cryptology ePrint Archive, Report 2022\/1663, 2022. https:\/\/eprint.iacr.org\/2022\/1663"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Jon-Lark Kim, Young-Sik Kim, Lucky Erap Galvez, and Myeong Jae Kim. A modified Dual-Ouroboros public-key encryption using Gabidulin codes. Appl. Algebra Eng. Commun. Comput., 32(2):147\u2013156, 2021","DOI":"10.1007\/s00200-019-00406-x"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Pierre Loidreau. A new rank metric codes based encryption scheme. In Tanja Lange and Tsuyoshi Takagi, editors, Post-Quantum Cryptography - 8th International Workshop, PQCrypto 2017, pages 3\u201317, Utrecht, The Netherlands, June 26\u201328, 2017. Springer, Heidelberg, Germany","DOI":"10.1007\/978-3-319-59879-6_1"},{"key":"15_CR21","unstructured":"Tanja Lange, Alex Pellegrini, and Alberto Ravagnani. On the security of REDOG. Cryptology ePrint Archive, Paper 2023\/1205, 2023. https:\/\/eprint.iacr.org\/2023\/1205"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"Terry Shue Chien Lau and Chik How Tan. Key recovery attack on McNie based on low rank parity check codes and its reparation. In Atsuo Inomata and Kan Yasuda, editors, IWSEC 18, volume 11049 of LNCS, pages 19\u201334, Sendai, Japan, September 3\u20135, 2018. Springer, Heidelberg, Germany","DOI":"10.1007\/978-3-319-97916-8_2"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Terry Shue Chien Lau, Chik How Tan, and Theo Fanuela Prabowo. On the security of the modified Dual-Ouroboros PKE using Gabidulin codes. Appl. Algebra Eng. Commun. Comput., 32(6):681\u2013699, 2021","DOI":"10.1007\/s00200-020-00419-x"},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"Raphael Overbeck. A new structural attack for GPT and variants. In Mycrypt, volume 3715 of Lecture Notes in Computer Science, pages 50\u201363. Springer, 2005","DOI":"10.1007\/11554868_5"},{"key":"15_CR25","doi-asserted-by":"crossref","unstructured":"Raphael Overbeck. Structural attacks for public key cryptosystems based on Gabidulin codes. Journal of Cryptology, 21(2):280\u2013301, April 2008","DOI":"10.1007\/s00145-007-9003-9"},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"Eugene Prange. The use of information sets in decoding cyclic codes. IRE Transactions on Information Theory, 8(5):5\u20139, 1962","DOI":"10.1109\/TIT.1962.1057777"},{"key":"15_CR27","unstructured":"William A. Stein et al. Sage Mathematics Software (Version (9.3)). The Sage Development Team, 2021. https:\/\/www.sagemath.org"},{"key":"15_CR28","unstructured":"Richard P. Stanley. Enumerative Combinatorics, volume 1 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, 2 edition, 2011"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology \u2013 ICISC 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-1238-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,14]],"date-time":"2024-11-14T00:00:35Z","timestamp":1731542435000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-1238-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819712373","9789819712380"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-1238-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"8 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICISC","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":"Seoul","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icisc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icisc.org\/static\/pastconferences","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":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"78","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":"31","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":"0","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":"40% - 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":"2","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}