{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:52:05Z","timestamp":1743079925461,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031223006"},{"type":"electronic","value":"9783031223013"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-22301-3_10","type":"book-chapter","created":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T15:17:17Z","timestamp":1669907837000},"page":"189-205","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Cryptanalysis and\u00a0Repair of\u00a0a\u00a0Gabidulin Code Based Cryptosystem from\u00a0ACISP 2018"],"prefix":"10.1007","author":[{"given":"Wenshuo","family":"Guo","sequence":"first","affiliation":[]},{"given":"Fang-Wei","family":"Fu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,29]]},"reference":[{"issue":"5","key":"10_CR1","doi-asserted-by":"publisher","first-page":"3927","DOI":"10.1109\/TIT.2018.2804444","volume":"64","author":"C Aguilar-Melchor","year":"2018","unstructured":"Aguilar-Melchor, C., Blazy, O., Deneuville, J.-C., Gaborit, P., Z\u00e9mor, G.: Efficient encryption from random quasi-cyclic codes. IEEE Trans. Inform. Theory 64(5), 3927\u20133943 (2018)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"12","key":"10_CR2","doi-asserted-by":"publisher","first-page":"7697","DOI":"10.1109\/TIT.2019.2933535","volume":"65","author":"N Aragon","year":"2019","unstructured":"Aragon, N., Gaborit, P., Hauteville, A., Ruatta, O., Z\u00e9mor, G.: Low rank parity check codes: new decoding algorithms and applications to cryptography. IEEE Trans. Inform. Theory 65(12), 7697\u20137717 (2019)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Aragon, N., Gaborit, P., Hauteville, A., Tillich, J.-P.: A new algorithm for solving the rank syndrome decoding problem. In: Proceedings of 2018 IEEE International Symposium on Information Theory (ISIT 2018), pp. 2421\u20132425. IEEE (2018)","DOI":"10.1109\/ISIT.2018.8437464"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Baldi, M., Chiaraluce, F., Garello, R.: On the usage of quasi-cyclic low-density parity-check codes in the McEliece cryptosystem. In: Proceedings of 2007 IEEE International Conference on Communications (ICC 2007), pp. 951\u2013956. IEEE (2007)","DOI":"10.1109\/ICC.2007.161"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-030-45727-3_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"M Bardet","year":"2020","unstructured":"Bardet, M., Briaud, P., Bros, M., Gaborit, P., Neiger, V., Ruatta, O., Tillich, J.-P.: An algebraic attack on rank metric code-based cryptosystems. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12107, pp. 64\u201393. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_3"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-030-64837-4_17","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"M Bardet","year":"2020","unstructured":"Bardet, M., Bros, M., Cabarcas, D., Gaborit, P., Perlner, R., Smith-Tone, D., Tillich, J.-P., Verbel, J.: Improvements of algebraic attacks for solving the rank decoding and MinRank problems. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12491, pp. 507\u2013536. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64837-4_17"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-540-30556-9_18","volume-title":"Progress in Cryptology - INDOCRYPT 2004","author":"T Berger","year":"2004","unstructured":"Berger, T., Loidreau, P.: Designing an efficient and secure public-key cryptosystem based on reducible rank codes. In: Canteaut, A., Viswanathan, K. (eds.) INDOCRYPT 2004. LNCS, vol. 3348, pp. 218\u2013229. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30556-9_18"},{"issue":"3","key":"10_CR8","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"ER Berlekamp","year":"1978","unstructured":"Berlekamp, E.R., McEliece, R.J., Van Tilborg, H.: On the inherent intractability of certain coding problems. IEEE Trans. Inform. Theory 24(3), 384\u2013386 (1978)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-81293-5_1","volume-title":"Post-Quantum Cryptography","author":"M Bombar","year":"2021","unstructured":"Bombar, M., Couvreur, A.: Decoding supercodes of gabidulin codes and applications to cryptanalysis. In: Cheon, J.H., Tillich, J.-P. (eds.) PQCrypto 2021 2021. LNCS, vol. 12841, pp. 3\u201322. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81293-5_1"},{"issue":"3\u20134","key":"10_CR10","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The MAGMA algebra system I: the user language. J. Symbolic Comput. 24(3\u20134), 235\u2013265 (1997)","journal-title":"J. Symbolic Comput."},{"issue":"9","key":"10_CR11","doi-asserted-by":"publisher","first-page":"1941","DOI":"10.1007\/s10623-020-00781-4","volume":"88","author":"D Coggia","year":"2020","unstructured":"Coggia, D., Couvreur, A.: On the security of a Loidreau rank metric code based encryption scheme. Des. Codes Crypt. 88(9), 1941\u20131957 (2020). https:\/\/doi.org\/10.1007\/s10623-020-00781-4","journal-title":"Des. Codes Crypt."},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/11779360_24","volume-title":"Coding and Cryptography","author":"C Faure","year":"2006","unstructured":"Faure, C., Loidreau, P.: A new public-key cryptosystem based on the problem of reconstructing p\u2013polynomials. In: Ytrehus, \u00d8. (ed.) WCC 2005. LNCS, vol. 3969, pp. 304\u2013315. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11779360_24"},{"issue":"1","key":"10_CR13","first-page":"3","volume":"21","author":"EM Gabidulin","year":"1985","unstructured":"Gabidulin, E.M.: Theory of codes with maximum rank distance. Prob. Peredachi Inf. 21(1), 3\u201316 (1985)","journal-title":"Prob. Peredachi Inf."},{"issue":"12","key":"10_CR14","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. Inform. Theory 49(12), 3289\u20133293 (2003)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/3-540-46416-6_41","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201991","author":"EM Gabidulin","year":"1991","unstructured":"Gabidulin, E.M., Paramonov, A.V., Tretjakov, O.V.: Ideals over a non-commutative ring and their application in cryptology. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 482\u2013489. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-46416-6_41"},{"issue":"7","key":"10_CR16","doi-asserted-by":"publisher","first-page":"1391","DOI":"10.1007\/s10623-017-0402-0","volume":"86","author":"P Gaborit","year":"2018","unstructured":"Gaborit, P., Otmani, A., Kalachi, H.T.: Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes. Des. Codes Cryptogr. 86(7), 1391\u20131403 (2018)","journal-title":"Des. Codes Cryptogr."},{"issue":"2","key":"10_CR17","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.1109\/TIT.2015.2511786","volume":"62","author":"P Gaborit","year":"2016","unstructured":"Gaborit, P., Ruatta, O., Schrek, J.: On the complexity of the rank syndrome decoding problem. IEEE Trans. Inf. Theory 62(2), 1006\u20131019 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s10623-021-00972-7","volume":"90","author":"A Ghatak","year":"2022","unstructured":"Ghatak, A.: Extending Coggia-Couvreur attack on Loidreau\u2019s rank-metric cryptosystem. Des. Codes Cryptogr. 90, 215\u2013238 (2022)","journal-title":"Des. Codes Cryptogr."},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Horlemann-Trautmann, A.-L., Marshall, K., Rosenthal, J.: Considerations for rank-based cryptosystems. In: Proceedings of 2016 IEEE International Symposium on Information Theory (ISIT 2016), pp. 2544\u20132548. IEEE (2016)","DOI":"10.1109\/ISIT.2016.7541758"},{"issue":"2","key":"10_CR20","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10623-017-0343-7","volume":"86","author":"A-L Horlemann-Trautmann","year":"2018","unstructured":"Horlemann-Trautmann, A.-L., Marshall, K., Rosenthal, J.: Extension of overbeck\u2019s attack for Gabidulin-based cryptosystems. Des. Codes Cryptogr. 86(2), 319\u2013340 (2018)","journal-title":"Des. Codes Cryptogr."},{"key":"10_CR21","unstructured":"Horlemann-Trautmann, A.-L., Marshall, K.: New criteria for MRD and Gabidulin codes and some rank-metric code constructions. arXiv:1507.08641 [cs.IT] (2015)"},{"issue":"4","key":"10_CR22","doi-asserted-by":"publisher","first-page":"677","DOI":"10.3934\/amc.2020089","volume":"15","author":"A-L Horlemann-Trautmann","year":"2021","unstructured":"Horlemann-Trautmann, A.-L., Werger, V.: Information set decoding in the Lee metric with applications to cryptography. Adv. Math. Commun. 15(4), 677\u2013699 (2021)","journal-title":"Adv. Math. Commun."},{"issue":"3","key":"10_CR23","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1023\/A:1027351723034","volume":"8","author":"H Janwa","year":"1996","unstructured":"Janwa, H., Moreno, O.: McEliece public key cryptosystems using algebraic-geometric codes. Des. Codes Cryptogr. 8(3), 293\u2013307 (1996)","journal-title":"Des. Codes Cryptogr."},{"issue":"12","key":"10_CR24","doi-asserted-by":"publisher","first-page":"2979","DOI":"10.1007\/s10623-019-00659-0","volume":"87","author":"TSC Lau","year":"2019","unstructured":"Lau, T.S.C., Tan, C.H.: New rank codes based encryption scheme using partial circulant matrices. Des. Codes Crypt. 87(12), 2979\u20132999 (2019). https:\/\/doi.org\/10.1007\/s10623-019-00659-0","journal-title":"Des. Codes Crypt."},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1007\/978-3-319-93638-3_43","volume-title":"Information Security and Privacy","author":"TSC Lau","year":"2018","unstructured":"Lau, T.S.C., Tan, C.H.: A new encryption scheme based on rank metric codes. In: Susilo, W., Yang, G. (eds.) ACISP 2018. LNCS, vol. 10946, pp. 750\u2013758. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93638-3_43"},{"issue":"4","key":"10_CR26","doi-asserted-by":"publisher","first-page":"32","DOI":"10.3390\/cryptography2040032","volume":"2","author":"TSC Lau","year":"2018","unstructured":"Lau, T.S.C., Tan, C.H.: A new technique in rank metric code-based encryption. Cryptography 2(4), 32 (2018)","journal-title":"Cryptography"},{"key":"10_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-59879-6_1","volume-title":"Post-Quantum Cryptography","author":"P Loidreau","year":"2017","unstructured":"Loidreau, P.: A new rank metric codes based encryption scheme. In: Lange, T., Takagi, T. (eds.) PQCrypto 2017. LNCS, vol. 10346, pp. 3\u201317. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59879-6_1"},{"key":"10_CR28","unstructured":"Loidreau, P.: Analysis of a rank metric codes based encryption scheme. https:\/\/drive.google.com\/file\/d\/1FuMgqm0NfGMJOxaZyrIrI1OWn0UICwPo\/view. Accessed 1 July 2021"},{"key":"10_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/11779360_4","volume-title":"Coding and Cryptography","author":"P Loidreau","year":"2006","unstructured":"Loidreau, P.: A welch\u2013berlekamp like algorithm for decoding gabidulin codes. In: Ytrehus, \u00d8. (ed.) WCC 2005. LNCS, vol. 3969, pp. 36\u201345. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11779360_4"},{"key":"10_CR30","first-page":"114","volume":"42\u201344","author":"RJ McEliece","year":"1978","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. Jet Propuls. Lab. DSN Progr. Rep. 42\u201344, 114\u2013116 (1978)","journal-title":"Jet Propuls. Lab. DSN Progr. Rep."},{"issue":"2","key":"10_CR31","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"},{"issue":"9","key":"10_CR32","doi-asserted-by":"publisher","first-page":"1983","DOI":"10.1007\/s10623-017-0434-5","volume":"86","author":"A Otmani","year":"2018","unstructured":"Otmani, A., Kalachi, H.T., Ndjeya, S.: Improved cryptanalysis of rank metric schemes based on Gabidulin codes. Des. Codes Cryptogr. 86(9), 1983\u20131996 (2018)","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"10_CR33","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1023\/A:1020369320078","volume":"38","author":"AV Ourivski","year":"2002","unstructured":"Ourivski, A.V., Johansson, T.: New technique for decoding codes in the rank metric and its cryptography applications. Problems Inform. Transm. 38(3), 237\u2013246 (2002)","journal-title":"Problems Inform. Transm."},{"issue":"2","key":"10_CR34","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/s00145-007-9003-9","volume":"21","author":"R Overbeck","year":"2008","unstructured":"Overbeck, R.: Structural attacks for public key cryptosystems based on Gabidulin codes. J. Cryptology 21(2), 280\u2013301 (2008)","journal-title":"J. Cryptology"},{"key":"10_CR35","doi-asserted-by":"crossref","unstructured":"Renner, J., Puchinger, S., Wachter-Zeh, A.: LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding. Des. Codes Cryptogr. 89(6), 1279\u20131319 (2021). Springer","DOI":"10.1007\/s10623-021-00861-z"},{"key":"10_CR36","unstructured":"Richter, G., Plass, S.: Error and erasure decoding of rank-codes with a modified Berlekamp-Massey algorithm. ITG FACHBERICHT, pp. 203\u2013210 (2004)"},{"issue":"2","key":"10_CR37","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/S0036144598347011","volume":"41","author":"PW Shor","year":"1994","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev. 41(2), 303\u2013332 (1994)","journal-title":"SIAM Rev."}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22301-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T15:18:17Z","timestamp":1669907897000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22301-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031223006","9783031223013"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22301-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACISP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Conference on Information Security and Privacy","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wollongong, NSW","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acisp2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/uow-ic2.github.io\/acisp2022\/index.html","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":"62","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":"25","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":"4","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":"3","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)"}}]}}