{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T04:28:36Z","timestamp":1768537716129,"version":"3.49.0"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,2,11]],"date-time":"2020-02-11T00:00:00Z","timestamp":1581379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,11]],"date-time":"2020-02-11T00:00:00Z","timestamp":1581379200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s11432-019-2670-7","type":"journal-article","created":{"date-parts":[[2020,2,15]],"date-time":"2020-02-15T03:02:24Z","timestamp":1581735744000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An improved Durandal signature scheme"],"prefix":"10.1007","volume":"63","author":[{"given":"Yongcheng","family":"Song","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinyi","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Mu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,11]]},"reference":[{"key":"2670_CR1","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/SFCS.1994.365700","volume-title":"Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe","author":"P W Shor","year":"1994","unstructured":"Shor P W. Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, 1994. 124\u2013134"},{"key":"2670_CR2","doi-asserted-by":"publisher","first-page":"022501","DOI":"10.1007\/s11432-016-9151-x","volume":"61","author":"Z Dou","year":"2018","unstructured":"Dou Z, Xu G, Chen X-B, et al. A secure rational quantum state sharing protocol. Sci China Inf Sci, 2018, 61: 022501","journal-title":"Sci China Inf Sci"},{"key":"2670_CR3","doi-asserted-by":"publisher","first-page":"022502","DOI":"10.1007\/s11432-017-9180-2","volume":"61","author":"L Yang","year":"2018","unstructured":"Yang L, Wu C M, Xie H Q. Mutual authenticated quantum no-key encryption scheme over private quantum channel. Sci China Inf Sci, 2018, 61: 022502","journal-title":"Sci China Inf Sci"},{"key":"2670_CR4","doi-asserted-by":"publisher","first-page":"102501","DOI":"10.1007\/s11432-017-9468-y","volume":"61","author":"X Y Dong","year":"2018","unstructured":"Dong X Y, Wang X Y. Quantum key-recovery attack on Feistel structures. Sci China Inf Sci, 2018, 61: 102501","journal-title":"Sci China Inf Sci"},{"key":"2670_CR5","doi-asserted-by":"publisher","first-page":"072501","DOI":"10.1007\/s11432-018-9705-x","volume":"62","author":"Y Wang","year":"2019","unstructured":"Wang Y, Tian C X, Su Q, et al. Measurement-device-independent quantum secret sharing and quantum conference based on Gaussian cluster state. Sci China Inf Sci, 2019, 62: 072501","journal-title":"Sci China Inf Sci"},{"key":"2670_CR6","first-page":"114","volume":"4244","author":"R J Mceliece","year":"1978","unstructured":"Mceliece R J. A Public-key Cryptosystem Based on Algebraic Coding Theory. Technical Report DSN Progress Report, 1978, 4244: 114\u2013116","journal-title":"Technical Report DSN Progress Report"},{"key":"2670_CR7","first-page":"159","volume":"15","author":"H Niederreiter","year":"1986","unstructured":"Niederreiter H. Knapsack-type cryptosystems and algebraic coding thoery. Prob Control Inf Theory, 1986, 15: 159-166","journal-title":"Prob Control Inf Theory"},{"key":"2670_CR8","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 Inform Theor, 1978, 24: 384\u2013386","journal-title":"IEEE Trans Inform Theor"},{"key":"2670_CR9","first-page":"157","volume-title":"Proceedings of ASIACRYPT, Gold Coast","author":"N Courtois","year":"2001","unstructured":"Courtois N, Finiasz M, Sendrier N. How to achieve a McEliece-based digital signature scheme. In: Proceedings of ASIACRYPT, Gold Coast, 2001. 157\u2013174"},{"key":"2670_CR10","first-page":"1","volume-title":"Proceedings of PQCrypto, Limoges","author":"M Baldi","year":"2013","unstructured":"Baldi M, Bianchi M, Chiaraluce F, et al. Using LDGM codes and sparse syndromes to achieve digital signatures. In: Proceedings of PQCrypto, Limoges, 2013. 1\u201315"},{"key":"2670_CR11","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/978-3-642-34129-8_45","volume-title":"Proceedings of the 14th International Conference on Information and Communications Security, Hong Kong","author":"C Londahl","year":"2012","unstructured":"Londahl C, Johansson T. A new version of McEliece PKC based on convolutional codes. In: Proceedings of the 14th International Conference on Information and Communications Security, Hong Kong, 2012. 461\u2013470"},{"key":"2670_CR12","first-page":"86","volume-title":"Proceedings of PQCrypto, Fukuoka","author":"A Phesso","year":"2016","unstructured":"Phesso A, Tillich J P. An efficient attack on a code-based signature scheme. In: Proceedings of PQCrypto, Fukuoka, 2016. 86\u2013103"},{"key":"2670_CR13","first-page":"102","volume-title":"Proceedings of PQCrypto, Limoges","author":"G Landais","year":"2013","unstructured":"Landais G, Tillich J P. An efficient attack of a McEliece cryptosystem variant based on convolutional codes. In: Proceedings of PQCrypto, Limoges, 2013. 102\u2013117"},{"key":"2670_CR14","first-page":"88","volume-title":"Proceedings of PQCrypto, Waterloo","author":"P Gaborit","year":"2014","unstructured":"Gaborit P, Ruatta O, Schrek J, et al. RankSign: an efficient signature algorithm based on the rank metric. In: Proceedings of PQCrypto, Waterloo, 2014. 88\u2013107"},{"key":"2670_CR15","first-page":"1","volume-title":"Proceedings of AFRICACRYPT, Marrakesh","author":"P Gaborit","year":"2014","unstructured":"Gaborit P, Ruatta O, Schrek J, et al. New results for rank-based cryptography. In: Proceedings of AFRICACRYPT, Marrakesh, 2014. 1\u201312"},{"key":"2670_CR16","first-page":"167","volume-title":"Proceedings of the Workshop on Coding and Cryptography, Bergen","author":"P Gaborit","year":"2013","unstructured":"Gaborit P, Murat G, Ruatta O, et al. Low rank parity check codes and their application to cryptography. In: Proceedings of the Workshop on Coding and Cryptography, Bergen, 2013. 167\u2013179"},{"key":"2670_CR17","volume-title":"First Round Submission to the NIST Post-Quantum Cryptography Call","author":"N Aragon","year":"2017","unstructured":"Aragon N, Gaborit P, Hauteville A, et al. RankSign-a signature proposal for the NIST\u2019s call. First Round Submission to the NIST Post-Quantum Cryptography Call, 2017. https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/Round-1-Submissions"},{"key":"2670_CR18","first-page":"62","volume-title":"Proceedings of ASIACRYPT, Brisbane","author":"T Debris-Alazard","year":"2018","unstructured":"Debris-Alazard T, Tillich J P. Two attacks on rank metric code-based schemes: RankSign and an IBE scheme. In: Proceedings of ASIACRYPT, Brisbane, 2018. 62\u201392"},{"key":"2670_CR19","first-page":"186","volume-title":"Proceedings of CRYPTO, Santa Barbara","author":"A Fiat","year":"1986","unstructured":"Fiat A, Shamir A. How to prove yourself: practical solutions to identification and signature problems. In: Proceedings of CRYPTO, Santa Barbara, 1986. 186\u2013194"},{"key":"2670_CR20","first-page":"13","volume-title":"Proceedings of CRYPTO, Santa Barbara","author":"J Stern","year":"1993","unstructured":"Stern J. A new identification scheme based on syndrome decoding. In: Proceedings of CRYPTO, Santa Barbara, 1993. 13\u201321"},{"key":"2670_CR21","first-page":"171","volume-title":"Proceedings of Selected Areas in Cryptography, Waterloo","author":"P Cayrel","year":"2010","unstructured":"Cayrel P, Veron P, Alaoui S M E Y. A zero-knowledge identification scheme based on the q-ary syndrome decoding problem. In: Proceedings of Selected Areas in Cryptography, Waterloo, 2010. 171\u2013186"},{"key":"2670_CR22","first-page":"728","volume-title":"Proceedings of EURO-CRYPT, Darmstadt","author":"N Aragon","year":"2019","unstructured":"Aragon N, Blazy O, Gaborit P, et al. Durandal: a rank metric based signature scheme. In: Proceedings of EURO-CRYPT, Darmstadt, 2019. 728\u2013758"},{"key":"2670_CR23","first-page":"111","volume-title":"Dissertation for Ph.D. Degree","author":"E Persichetti","year":"2012","unstructured":"Persichetti E. Improving the efficiency of code-based cryptography. Dissertation for Ph.D. Degree. Auckland: University of Auckland, 2012. 111\u2013115"},{"key":"2670_CR24","doi-asserted-by":"publisher","first-page":"30","DOI":"10.3390\/cryptography2040030","volume":"2","author":"E Persichetti","year":"2018","unstructured":"Persichetti E. Efficient one-time signatures from quasi-cyclic codes: a full treatment. Cryptography, 2018, 2: 30","journal-title":"Cryptography"},{"key":"2670_CR25","volume-title":"First Round Submission to the NIST Post-quantum Cryptography Call","author":"K Fukushima","year":"2017","unstructured":"Fukushima K, Roy P S, Xu R, et al. Random code-based signature scheme (RaCoSS). First Round Submission to the NIST Post-quantum Cryptography Call. 2017. https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-1-submissions"},{"key":"2670_CR26","first-page":"17","volume":"118","author":"P S Roy","year":"2018","unstructured":"Roy P S, Morozov K, Fukushima K, et al. Code-based Signature Scheme Without Trapdoors. IEICE Technical Report, 2018, 118: 17\u201322","journal-title":"IEICE Technical Report"},{"key":"2670_CR27","first-page":"738","volume-title":"Proceedings of EUROCRYPT, Cambridge","author":"V Lyubashevsky","year":"2012","unstructured":"Lyubashevsky V. Lattice signatures without trapdoors. In: Proceedings of EUROCRYPT, Cambridge, 2012. 738\u2013755"},{"key":"2670_CR28","volume-title":"Second Round Submission to the NIST Postquantum Cryptography Call","author":"C A Melchor","year":"2019","unstructured":"Melchor C A, Aragon N, Bettaieb S, et al. Rank quasi-cyclic (RQC). Second Round Submission to the NIST Postquantum Cryptography Call, 2019. https:\/\/pqc-rqc.org\/doc\/rqc-specification_2019-04-10.pdf"},{"key":"2670_CR29","volume-title":"Properties of codes in rank metric","author":"P Loidreau","year":"2006","unstructured":"Loidreau P. Properties of codes in rank metric. 2006. arXiv: cs\/0610057"},{"key":"2670_CR30","first-page":"81","volume-title":"Proceedings of the Workshop on Coding and Cryptography, Bergen","author":"P Gaborit","year":"2005","unstructured":"Gaborit P. Shorter keys for code based cryptography. In: Proceedings of the Workshop on Coding and Cryptography, Bergen, 2005. 81\u201391"},{"key":"2670_CR31","first-page":"2747","volume-title":"Proceedings of International Symposium on Information Theory, Hong Kong","author":"A Hauteville","year":"2015","unstructured":"Hauteville A, Tillich J P. New algorithms for decoding in the rank metric and an attack on the LRPC cryptosystem. In: Proceedings of International Symposium on Information Theory, Hong Kong, 2015. 2747\u20132751"},{"key":"2670_CR32","first-page":"482","volume-title":"Proceedings of EUROCRYPT, Brighton","author":"E M Gabidulin","year":"1991","unstructured":"Gabidulin E M, Paramonov A V, Tretjakov O V. Ideals over a non-commutative ring and thier applications in cryptology. In: Proceedings of EUROCRYPT, Brighton, 1991. 482\u2013489"},{"key":"2670_CR33","doi-asserted-by":"publisher","first-page":"7245","DOI":"10.1109\/TIT.2016.2616127","volume":"62","author":"P Gaborit","year":"2016","unstructured":"Gaborit P, Zemor G. On the hardness of the decoding and the minimum distance problems for rank codes. IEEE Trans Inform Theor, 2016, 62: 7245\u20137252","journal-title":"IEEE Trans Inform Theor"},{"key":"2670_CR34","first-page":"1","volume-title":"Dissertation for Ph.D. Degree","author":"H Bartz","year":"2017","unstructured":"Bartz H. Algebraic decoding of subspace and rank-metric codes. Dissertation for Ph.D. Degree. Germany: Technical University Munich, 2017. 1\u2013184"},{"key":"2670_CR35","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 Inform Theor, 2016, 62: 1006\u20131019","journal-title":"IEEE Trans Inform Theor"},{"key":"2670_CR36","first-page":"2421","volume-title":"Proceedings of International Symposium on Information Theory, Vail","author":"N Aragon","year":"2018","unstructured":"Aragon N, Gaborit P, Hauteville A, et al. A new algorithm for solving the rank syndrome decoding problem. In: Proceedings of International Symposium on Information Theory, Vail, 2018. 2421\u20132425"},{"key":"2670_CR37","doi-asserted-by":"publisher","first-page":"6204","DOI":"10.1109\/TIT.2015.2475738","volume":"61","author":"Q Guo","year":"2015","unstructured":"Guo Q, Johansson T, Londahl C. A new algorithm for solving ring-LPN with a reducible polynomial. IEEE Trans Inform Theor, 2015, 61: 6204\u20136212","journal-title":"IEEE Trans Inform Theor"},{"key":"2670_CR38","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s10623-015-0099-x","volume":"80","author":"C Londahl","year":"2016","unstructured":"Londahl C, Johansson T, Shooshtari M K, et al. Squaring attacks on McEliece public-key cryptosystems using quasicyclic codes of even dimension. Des Codes Cryptogr, 2016, 80: 359\u2013377","journal-title":"Des Codes Cryptogr"},{"key":"2670_CR39","first-page":"51","volume-title":"Proceedings of PQCrypto, Taipei","author":"N Sendrier","year":"2011","unstructured":"Sendrier N. Decoding one out of many. In: Proceedings of PQCrypto, Taipei, 2011. 51\u201367"},{"key":"2670_CR40","first-page":"280","volume-title":"Proceedings of CRYPTO, Santa Barbara","author":"J C Faugere","year":"2008","unstructured":"Faugere J C, Levy-dit-Vehel F, Perret L. Cryptanalysis of MinRank. In: Proceedings of CRYPTO, Santa Barbara, 2008. 280\u2013296"},{"key":"2670_CR41","first-page":"257","volume-title":"Proceedings of Symbolic and Algebraic Computation, International Symposium, Munich","author":"J C Faugere","year":"2010","unstructured":"Faugere J C, Din M S E, Spaenlehauer P J. Computing loci of rank defects of linear matrices using Grobner bases and applications to cryptology. In: Proceedings of Symbolic and Algebraic Computation, International Symposium, Munich, 2010. 257\u2013264"},{"key":"2670_CR42","volume-title":"Wave: a new code-based signature scheme","author":"T Debris-Alazard","year":"2018","unstructured":"Debris-Alazard T, Sendrier N, Tillich J P. Wave: a new code-based signature scheme. 2018. arXiv: 1810.07554"},{"key":"2670_CR43","first-page":"161","volume-title":"Proceedings of the 6th IMA International Conference on Cryptography and Coding, Cirencester","author":"G Kabatianskii","year":"1997","unstructured":"Kabatianskii G, Krouk E, Smeets B. A digital signature scheme based on random error-correcting codes. In: Proceedings of the 6th IMA International Conference on Cryptography and Coding, Cirencester, 1997. 161\u2013167"},{"key":"2670_CR44","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-540-73074-3_18","volume-title":"Proceedings ofthe 1st International Workshop on Arithmetic of Finite Fields, Madrid","author":"P L Cayrel","year":"2007","unstructured":"Cayrel P L, Otmani A, Vergnaud D. On Kabatianskii-Krouk-Smeets signatures. In: Proceedings ofthe 1st International Workshop on Arithmetic of Finite Fields, Madrid, 2007. 237\u2013251"},{"key":"2670_CR45","first-page":"191","volume-title":"Proceedings of International Symposium on Information Theory, Nice","author":"P Gaborit","year":"2007","unstructured":"Gaborit P, Girault M. Lightweight code-based identification and signature. In: Proceedings of International Symposium on Information Theory, Nice, 2007. 191\u2013195"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-019-2670-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-019-2670-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-019-2670-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,10]],"date-time":"2021-02-10T07:34:19Z","timestamp":1612942459000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-019-2670-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,11]]},"references-count":45,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["2670"],"URL":"https:\/\/doi.org\/10.1007\/s11432-019-2670-7","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,11]]},"assertion":[{"value":"9 July 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 September 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 February 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"132103"}}