{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:53:22Z","timestamp":1773377602492,"version":"3.50.1"},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849628","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"1927-1931","source":"Crossref","is-referenced-by-count":3,"title":["Speeding up decoding a code with a non-trivial automorphism group up to an exponential factor"],"prefix":"10.1109","author":[{"given":"Rodolfo","family":"Canto-Torres","sequence":"first","affiliation":[{"name":"INRIA, Paris, 75012, France"}]},{"given":"Jean-Pierre","family":"Tillich","sequence":"additional","affiliation":[{"name":"INRIA, Paris, 75012, France"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875127"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-015-0099-x"},{"key":"ref12","article-title":"MDPC-McEliece: New McEliece variants from moderate density parity-check codes","volume":"2012","author":"misoczki","year":"2012","journal-title":"IACR Cryptology ePrint Archive Report"},{"key":"ref13","first-page":"234","article-title":"On cellular code and their cryptographic applications","author":"loidreau","year":"2014","journal-title":"Proceedings of ACCT14 (algebraic and combinatorial coding theory)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0019850"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_31"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-79063-3_2"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2493539"},{"key":"ref18","first-page":"193","article-title":"Permutation decoding : Towards an approach using algebraic properties of the ?-subcode","author":"legeay","year":"2011","journal-title":"in WCC 2011"},{"key":"ref19","article-title":"Utilisation du groupe de permutations d’un code correcteur pour améliorer l’efficacité du décodage","author":"legeay","year":"2012","journal-title":"Ph D dissertation University of Rennes 1"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02384-2_6"},{"key":"ref3","first-page":"81","article-title":"Shorter keys for code based cryptography","author":"gaborit","year":"2005","journal-title":"Proceedings of of the 2005 International Workshop on Coding and Cryptography (WCC 2005)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25405-5_12"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-05445-7_24"},{"key":"ref8","first-page":"69","article-title":"Cryptanalysis of McEliece cryp-tosystem based on quasi-cyclic LDPC codes","author":"otmani","year":"2008","journal-title":"Proceedings of First International Conference on Symbolic Computation and Cryptography"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1515\/jmc-2011-0099"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620590"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1049\/iet-ifs.2012.0127"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_14"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25405-5_4"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46800-5_9"},{"key":"ref23","article-title":"Dags: Reloaded revisiting dyadic key encapsulation","author":"banegas","year":"2018","journal-title":"Cryptology ePrint Archive Report"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849628.pdf?arnumber=8849628","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:33Z","timestamp":1773347673000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849628\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849628","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}