{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:13:45Z","timestamp":1760202825596},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030259211"},{"type":"electronic","value":"9783030259228"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-25922-8_3","type":"book-chapter","created":{"date-parts":[[2019,7,20]],"date-time":"2019-07-20T15:02:23Z","timestamp":1563634943000},"page":"44-68","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Introducing Arithmetic Failures to Accelerate QC-MDPC Code-Based Cryptography"],"prefix":"10.1007","author":[{"given":"Antonio","family":"Guimar\u00e3es","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edson","family":"Borin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Diego F.","family":"Aranha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,21]]},"reference":[{"key":"3_CR1","unstructured":"Aragon, N., et al.: BIKE: bit flipping key encapsulation, December 2017. https:\/\/hal.archives-ouvertes.fr\/hal-01671903 . Submission to the NIST post quantum standardization process. Website: http:\/\/bikesuite.org\/"},{"key":"3_CR2","unstructured":"Barreto, P.S.L.M., et al.: Cake: code-based algorithm for key encapsulation. Cryptology ePrint Archive, Report 2017\/757 (2017). http:\/\/eprint.iacr.org\/2017\/757"},{"issue":"3","key":"3_CR3","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 (corresp.). IEEE Trans. Inf. Theory 24(3), 384\u2013386 (1978). https:\/\/doi.org\/10.1109\/TIT.1978.1055873","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3_CR4","unstructured":"Bernstein, D.J.: SUPERCOP: system for unified performance evaluation related to cryptographic operations and primitives (2009)"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-319-72565-9_12","volume-title":"Selected Areas in Cryptography \u2013 SAC 2017","author":"DJ Bernstein","year":"2018","unstructured":"Bernstein, D.J., Chuengsatiansup, C., Lange, T., van Vredendaal, C.: NTRU prime: reducing attack surface at low cost. In: Adams, C., Camenisch, J. (eds.) SAC 2017. LNCS, vol. 10719, pp. 235\u2013260. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-72565-9_12"},{"issue":"8","key":"3_CR6","doi-asserted-by":"publisher","first-page":"1010","DOI":"10.1109\/12.238496","volume":"42","author":"H Brunner","year":"1993","unstructured":"Brunner, H., Curiger, A., Hofstetter, M.: On computing multiplicative inverses in GF( $$2^m$$ ). IEEE Trans. Comput. 42(8), 1010\u20131015 (1993). https:\/\/doi.org\/10.1109\/12.238496","journal-title":"IEEE Trans. Comput."},{"key":"3_CR7","unstructured":"Ceze, L., et al.: Disciplined approximate computing: from language to hardware, and beyond. Personal Web-page, https:\/\/homes.cs.washington.edu\/~luisceze\/ceze-approx-overview.pdf"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-662-53140-2_14","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2016","author":"T Chou","year":"2016","unstructured":"Chou, T.: QcBits: constant-time small-key code-based cryptography. In: Gierlichs, B., Poschmann, A.Y. (eds.) CHES 2016. LNCS, vol. 9813, pp. 280\u2013300. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53140-2_14"},{"key":"3_CR9","doi-asserted-by":"publisher","unstructured":"Drucker, N., Gueron, S., Krasnov, V.: Fast multiplication of binary polynomials with the forthcoming vectorized VPCLMULQDQ instruction. In: 2018 IEEE 25th Symposium on Computer Arithmetic (ARITH), pp. 115\u2013119, June 2018. https:\/\/doi.org\/10.1109\/ARITH.2018.8464777","DOI":"10.1109\/ARITH.2018.8464777"},{"key":"3_CR10","doi-asserted-by":"publisher","unstructured":"Drucker, N., Gueron, S.: A toolbox for software optimization of QC-MDPCcode-based cryptosystems. J. Cryptogr. Eng. (2019). https:\/\/doi.org\/10.1007\/s13389-018-00200-4","DOI":"10.1007\/s13389-018-00200-4"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-319-79063-3_3","volume-title":"Post-Quantum Cryptography","author":"E Eaton","year":"2018","unstructured":"Eaton, E., Lequesne, M., Parent, A., Sendrier, N.: QC-MDPC: a timing attack and\u00a0a\u00a0CCA2 KEM. In: Lange, T., Steinwandt, R. (eds.) PQCrypto 2018. LNCS, vol. 10786, pp. 47\u201376. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-79063-3_3"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-642-13190-5_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"J-C Faug\u00e8re","year":"2010","unstructured":"Faug\u00e8re, J.-C., Otmani, A., Perret, L., Tillich, J.-P.: Algebraic cryptanalysis of McEliece variants with compact keys. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 279\u2013298. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_14"},{"key":"3_CR13","unstructured":"Flammenkamp, A.: Shortest addition chains. Achim\u2019s WWW Domain (2018). http:\/\/wwwhomes.uni-bielefeld.de\/achim\/addition_chain.html"},{"key":"3_CR14","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/4347.001.0001","volume-title":"Low-Density Parity-Check Codes","author":"R Gallager","year":"1963","unstructured":"Gallager, R.: Low-Density Parity-Check Codes. MIT press, Cambridge (1963)"},{"issue":"3","key":"3_CR15","first-page":"24","volume":"6","author":"VD Goppa","year":"1970","unstructured":"Goppa, V.D.: A new class of linear correcting codes. Problemy Peredachi Informatsii 6(3), 24\u201330 (1970)","journal-title":"Problemy Peredachi Informatsii"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Guimar\u00e3es, A., Aranha, D.F., Borin, E.: Optimizing the decoding process of a post-quantum cryptographic algorithm. In: XVIII Simp\u00f3sio em Sistemas Computacionais de Alto Desempenho-WSCAD, vol. 18, no. 1\/2017, pp. 160\u2013171 (2017)","DOI":"10.5753\/wscad.2017.247"},{"key":"3_CR17","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.5089","author":"A Guimar\u00e3es","year":"2018","unstructured":"Guimar\u00e3es, A., Aranha, D.F., Borin, E.: Optimized implementation of QC-MDPC code-based cryptography. Concurr. Comput. Pract. Exp. (2018). https:\/\/doi.org\/10.1002\/cpe.5089","journal-title":"Concurr. Comput. Pract. Exp."},{"key":"3_CR18","volume-title":"Coding and Information Theory","author":"RW Hamming","year":"1986","unstructured":"Hamming, R.W.: Coding and Information Theory, 2nd edn. Prentice-Hall Inc., Upper Saddle River (1986)","edition":"2"},{"key":"3_CR19","series-title":"Springer Professional Computing","doi-asserted-by":"publisher","DOI":"10.1007\/B97644","volume-title":"Guide to Elliptic Curve Cryptography","author":"D Hankerson","year":"2004","unstructured":"Hankerson, D., Menezes, A.J., Vanstone, S.: Guide to Elliptic Curve Cryptography. SPC. Springer, New York (2004). https:\/\/doi.org\/10.1007\/B97644"},{"issue":"3","key":"3_CR20","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0890-5401(88)90024-7","volume":"78","author":"T Itoh","year":"1988","unstructured":"Itoh, T., Tsujii, S.: A fast algorithm for computing multiplicative inverses in GF( $$2^m$$ ) using normal bases. Inf. Comput. 78(3), 171\u2013177 (1988). https:\/\/doi.org\/10.1016\/0890-5401(88)90024-7","journal-title":"Inf. Comput."},{"issue":"1","key":"3_CR21","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1145\/3093337.3037718","volume":"45","author":"Djordje Jevdjic","year":"2017","unstructured":"Jevdjic, D., Strauss, K., Ceze, L., Malvar, H.S.: Approximate storage of compressed and encrypted videos, vol. 45, pp. 361\u2013373. ACM, New York, April 2017. https:\/\/doi.org\/10.1145\/3093337.3037718","journal-title":"ACM SIGARCH Computer Architecture News"},{"key":"3_CR22","doi-asserted-by":"publisher","unstructured":"Kou, Y., Xu, J., Tang, H., Lin, S., Abdel-Ghaffar, K.: On circulant low density parity check codes. In: Proceedings IEEE International Symposium on Information Theory, p. 200 (2002). https:\/\/doi.org\/10.1109\/ISIT.2002.1023472","DOI":"10.1109\/ISIT.2002.1023472"},{"issue":"3","key":"3_CR23","doi-asserted-by":"publisher","first-page":"44:1","DOI":"10.1145\/2700102","volume":"14","author":"IV Maurich","year":"2015","unstructured":"Maurich, I.V., Oder, T., G\u00fcneysu, T.: Implementing QC-MDPC McEliece encryption. ACM Trans. Embed. Comput. Syst. 14(3), 44:1\u201344:27 (2015). https:\/\/doi.org\/10.1145\/2700102","journal-title":"ACM Trans. Embed. Comput. Syst."},{"key":"3_CR24","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. Deep Space Network Progress Report 44, pp. 114\u2013116 (1978)"},{"key":"3_CR25","doi-asserted-by":"publisher","unstructured":"Misoczki, R., Tillich, J.P., Sendrier, N., Barreto, P.S.L.M.: MDPC-McEliece: new McEliece variants from moderate density parity-check codes. In: 2013 IEEE International Symposium on Information Theory, pp. 2069\u20132073, July 2013. https:\/\/doi.org\/10.1109\/ISIT.2013.6620590","DOI":"10.1109\/ISIT.2013.6620590"},{"key":"3_CR26","doi-asserted-by":"publisher","unstructured":"Monico, C., Rosenthal, J., Shokrollahi, A.: Using low density parity check codes in the McEliece cryptosystem. In: 2000 IEEE International Symposium on Information Theory, p. 215 (2000). https:\/\/doi.org\/10.1109\/ISIT.2000.866513","DOI":"10.1109\/ISIT.2000.866513"},{"issue":"2","key":"3_CR27","first-page":"159","volume":"15","author":"H Niederreiter","year":"1986","unstructured":"Niederreiter, H.: Knapsack-type cryptosystems and algebraic coding theory. Prob. Control Inf. Theory 15(2), 159\u2013166 (1986)","journal-title":"Prob. Control Inf. Theory"},{"key":"3_CR28","unstructured":"NIST: Submission requirements and evaluation criteria for the post-quantum cryptography standardization process. NIST web page (2016). http:\/\/csrc.nist.gov\/groups\/ST\/post-quantum-crypto\/documents\/call-for-proposals-final-dec-2016.pdf"},{"issue":"1","key":"3_CR29","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/0022-314X(80)90084-0","volume":"12","author":"MO Rabin","year":"1980","unstructured":"Rabin, M.O.: Probabilistic algorithm for testing primality. J. Number Theory 12(1), 128\u2013138 (1980). https:\/\/doi.org\/10.1016\/0022-314X(80)90084-0","journal-title":"J. Number Theory"},{"issue":"2","key":"3_CR30","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978). https:\/\/doi.org\/10.1145\/359340.359342","journal-title":"Commun. ACM"},{"key":"3_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-66787-4_1","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2017","author":"M Rossi","year":"2017","unstructured":"Rossi, M., Hamburg, M., Hutter, M., Marson, M.E.: A side-channel assisted cryptanalytic attack against QcBits. In: Fischer, W., Homma, N. (eds.) CHES 2017. LNCS, vol. 10529, pp. 3\u201323. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66787-4_1"},{"issue":"5","key":"3_CR32","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997). https:\/\/doi.org\/10.1137\/S0097539795293172","journal-title":"SIAM J. Comput."},{"key":"3_CR33","unstructured":"Shoup, V.: Number Theory C++ Library (NTL) (2003)"},{"key":"3_CR34","series-title":"The Wadsworth & Brooks\/Cole Mathematics Series","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-1-4615-9763-6_1","volume-title":"What Is Enumerative Combinatorics?","author":"RP Stanley","year":"1986","unstructured":"Stanley, R.P.: What Is Enumerative Combinatorics?. The Wadsworth & Brooks\/Cole Mathematics Series, vol. 1, pp. 1\u201363. Springer, Boston (1986). https:\/\/doi.org\/10.1007\/978-1-4615-9763-6_1"},{"issue":"3","key":"3_CR35","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/0021-9991(67)90047-2","volume":"1","author":"J Stein","year":"1967","unstructured":"Stein, J.: Computational problems associated with Racah algebra. J. Comput. Phys. 1(3), 397\u2013405 (1967). https:\/\/doi.org\/10.1016\/0021-9991(67)90047-2","journal-title":"J. Comput. Phys."},{"key":"3_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-540-88403-3_15","volume-title":"Post-Quantum Cryptography","author":"F Strenzke","year":"2008","unstructured":"Strenzke, F., Tews, E., Molter, H.G., Overbeck, R., Shoufan, A.: Side channels in the McEliece PKC. In: Buchmann, J., Ding, J. (eds.) PQCrypto 2008. LNCS, vol. 5299, pp. 216\u2013229. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88403-3_15"},{"issue":"3","key":"3_CR37","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1109\/TC.2004.1261843","volume":"53","author":"CH Wu","year":"2004","unstructured":"Wu, C.H., Wu, C.M., Shieh, M.D., Hwang, Y.T.: High-speed, low-complexity systolic designs of novel iterative division algorithms in GF( $$2^m$$ ). IEEE Trans. Comput. 53(3), 375\u2013380 (2004). https:\/\/doi.org\/10.1109\/TC.2004.1261843","journal-title":"IEEE Trans. Comput."}],"container-title":["Lecture Notes in Computer Science","Code-Based Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-25922-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,24]],"date-time":"2022-09-24T08:54:08Z","timestamp":1664009648000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-25922-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030259211","9783030259228"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-25922-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"21 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CBC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Code-Based Cryptography Workshop","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Darmstadt","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cbc0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cbc2019.dii.univpm.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}