{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T03:26:00Z","timestamp":1780457160261,"version":"3.54.1"},"reference-count":19,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2022]]},"abstract":"<jats:p xml:lang=\"fr\">&lt;p style='text-indent:20px;'&gt;In this paper, we present a practicable chosen ciphertext timing attack retrieving the secret key of HQC. The attack exploits a correlation between the weight of the error to be decoded and the running time of the decoding algorithm of BCH codes. For the 128-bit security parameters of HQC, the attack runs in less than a minute on a desktop computer using roughly 6000 decoding requests and has a success probability of approximately 93 percent. To prevent this attack, we provide an implementation of a constant time algorithm for the decoding of BCH codes. Our implementation of the countermeasure achieves a constant time execution of the decoding process without a significant performance penalty.&lt;\/p&gt;<\/jats:p>","DOI":"10.3934\/amc.2020126","type":"journal-article","created":{"date-parts":[[2020,12,18]],"date-time":"2020-12-18T02:00:49Z","timestamp":1608256849000},"page":"621","source":"Crossref","is-referenced-by-count":5,"title":["A practicable timing attack against HQC and its countermeasure"],"prefix":"10.3934","volume":"16","author":[{"given":"Guillaume","family":"Wafo-Tapa","sequence":"first","affiliation":[{"name":"Worldline, ZI Rue de la pointe, 59113 Seclin, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Slim","family":"Bettaieb","sequence":"additional","affiliation":[{"name":"Worldline, ZI Rue de la pointe, 59113 Seclin, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lo\u00efc","family":"Bidoux","sequence":"additional","affiliation":[{"name":"Worldline, ZI Rue de la pointe, 59113 Seclin, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Philippe","family":"Gaborit","sequence":"additional","affiliation":[{"name":"University of Limoges, XLIM-DMI, 123, Av. Albert Thomas, 87060 Limoges, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Etienne","family":"Marcatel","sequence":"additional","affiliation":[{"name":"Atos Trustway, Avenue Jean Jaur\u00e8s, 78340 Les Clayes-sous-Bois, University of Grenoble Alpes, CNRS, IF, 38000 Grenoble, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2020126-1","unstructured":"C. Aguilar-Melchor, N. Aragon, S. Bettaieb, L. Bidoux, O. Blazy, J.-C. Deneuville, P. Gaborit, E. Persichetti and G. Z\u00e9mor, <i>Hamming Quasi-Cyclic (HQC)<\/i>, 2017."},{"key":"key-10.3934\/amc.2020126-2","unstructured":"C. Aguilar-Melchor, N. Aragon, S. Bettaieb, L. Bidoux, O. Blazy, J.-C. Deneuville, P. Gaborit and G. Z\u00e9mor, <i>Rank Quasi-Cyclic (RQC)<\/i>, 2017."},{"key":"key-10.3934\/amc.2020126-3","doi-asserted-by":"publisher","unstructured":"C. Aguilar-Melchor, O. Blazy, J.-C. Deneuville, P. Gaborit, G. Z\u00e9mor.Efficient encryption from random quasi-cyclic codes, <i>IEEE Transactions on Information Theory<\/i>, <b>64<\/b> (2018), 3927-3943.","DOI":"10.1109\/TIT.2018.2804444"},{"key":"key-10.3934\/amc.2020126-4","doi-asserted-by":"publisher","unstructured":"S. Bettaieb, L. Bidoux, P. Gaborit and E. Marcatel, Preventing timing attacks against RQC using constant time decoding of Gabidulin codes, in <i>International Conference on Post-Quantum Cryptography<\/i>, Springer, (2019), 371\u2013386.","DOI":"10.1007\/978-3-030-25510-7_20"},{"key":"key-10.3934\/amc.2020126-5","unstructured":"E. R. Berlekamp, <i>Non-binary BCH Decoding<\/i>, Technical report, North Carolina State University. Dept. of Statistics, 1966."},{"key":"key-10.3934\/amc.2020126-6","doi-asserted-by":"publisher","unstructured":"D. J. Bernstein, T. Chou and P. Schwabe, Mcbits: Fast constant-time code-based cryptography, in <i>International Workshop on Cryptographic Hardware and Embedded Systems<\/i>, Springer, (2013), 250\u2013272.","DOI":"10.1007\/978-3-642-40349-1_15"},{"key":"key-10.3934\/amc.2020126-7","doi-asserted-by":"publisher","unstructured":"D. J. Bernstein and B-Y. Yang, Fast constant-time gcd computation and modular inversion, in <i>IACR Transactions on Cryptographic Hardware and Embedded Systems<\/i>, (2019), 340\u2013398.","DOI":"10.46586\/tches.v2019.i3.340-398"},{"key":"key-10.3934\/amc.2020126-8","doi-asserted-by":"publisher","unstructured":"T. Chou, McBits revisited, in <i>International Conference on Cryptographic Hardware and Embedded Systems<\/i>, Springer, (2017), 213\u2013231.","DOI":"10.1007\/978-3-319-66787-4_11"},{"key":"key-10.3934\/amc.2020126-9","doi-asserted-by":"publisher","unstructured":"R. Chandra. Bose, D. K. Ray-Chaudhuri.On a class of error correcting binary group codes, <i>Information and Control<\/i>, <b>3<\/b> (1960), 68-79.","DOI":"10.1016\/S0019-9958(60)90287-4"},{"key":"key-10.3934\/amc.2020126-10","unstructured":"J.-P. D'Anvers, F. Vercauteren and Ingrid Verbauwhede, On the impact of decryption failures on the security of LWE\/LWR based schemes, IACR Cryptology ePrint Archive, (2018), 1089."},{"key":"key-10.3934\/amc.2020126-11","unstructured":"\u00c8. M. Gabidulin.Theory of codes with maximum rank distance, <i>Problemy Peredachi Informatsii<\/i>, <b>21<\/b> (1985), 3-16."},{"key":"key-10.3934\/amc.2020126-12","doi-asserted-by":"publisher","unstructured":"S. Gao, T. Mateer.Additive fast fourier transforms over finite fields, <i>IEEE Transactions on Information Theory<\/i>, <b>56<\/b> (2010), 6265-6272.","DOI":"10.1109\/TIT.2010.2079016"},{"key":"key-10.3934\/amc.2020126-13","unstructured":"A. Hocquenghem.Codes correcteurs d'erreurs, <i>Chiffres<\/i>, <b>2<\/b> (1959), 147-156."},{"key":"key-10.3934\/amc.2020126-14","doi-asserted-by":"crossref","unstructured":"D. Hofheinz, K. H\u00f6velmanns and E. Kiltz, A modular analysis of the Fujisaki-Okamoto transformation, in <i>Theory of Cryptography Conference<\/i>, Springer, (2017), 341\u2013371.","DOI":"10.1007\/978-3-319-70500-2_12"},{"key":"key-10.3934\/amc.2020126-15","doi-asserted-by":"publisher","unstructured":"L. L. Joiner and J. J. Komo, Decoding binary BCH codes, in <i>Southeastcon '95<\/i>, 1995.","DOI":"10.1109\/SECON.1995.513059"},{"key":"key-10.3934\/amc.2020126-16","unstructured":"S. Lin and D. J. Costello, in <i>Error control coding<\/i>, Prentice Hall Englewood Cliffs, (2004).,"},{"key":"key-10.3934\/amc.2020126-17","unstructured":"X. Lu, Y. Liu, Z. Zhang, D. Jia, H. Xue, J. He, B. Li, K. Wang, Z. Liu and H. Yang, \nLAC: Practical Ring-LWE based Public-Key Encryption with Byte-Level Modulus, IACR\nCryptology ePrint Archive, (2018), 1009."},{"key":"key-10.3934\/amc.2020126-18","doi-asserted-by":"publisher","unstructured":"M. Walters and S. Sinha Roy, Constant-time BCH Error-Correcting Code, in <i>2020 IEEE International Symposium on Circuits and Systems (ISCAS)<\/i>, Sevilla, (2020), 1\u20135.","DOI":"10.1109\/ISCAS45731.2020.9180846"},{"key":"key-10.3934\/amc.2020126-19","doi-asserted-by":"crossref","unstructured":"Y. Xu.Implementation of Berlekamp-Massey algorithm without inversion, <i>IEE Proceedings I-Communications, Speech and Vision<\/i>, <b>138<\/b> (1991), 138-140.","DOI":"10.1049\/ip-i-2.1991.0018"}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"link":[{"URL":"http:\/\/aimsciences.org\/\/article\/doi\/10.3934\/amc.2020126?viewType=html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,29]],"date-time":"2022-06-29T09:26:19Z","timestamp":1656494779000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/article\/doi\/10.3934\/amc.2020126"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022]]}},"alternative-id":["1930-5346_2022_3_621"],"URL":"https:\/\/doi.org\/10.3934\/amc.2020126","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"value":"1930-5346","type":"print"},{"value":"1930-5338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}