{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T17:58:13Z","timestamp":1773511093310,"version":"3.50.1"},"reference-count":24,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2018,9,18]],"date-time":"2018-09-18T00:00:00Z","timestamp":1537228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cryptography"],"abstract":"<jats:p>Multiplications in     G F (  2 N  )     can be securely optimized for cryptographic applications when the integer N is small and does not match machine words (i.e.,     N &lt; 32    ). In this paper, we present a set of optimizations applied to DAGS, a code-based post-quantum cryptographic algorithm and one of the submissions to the National Institute of Standards and Technology\u2019s (NIST) Post-Quantum Cryptography (PQC) standardization call.<\/jats:p>","DOI":"10.3390\/cryptography2030025","type":"journal-article","created":{"date-parts":[[2018,9,18]],"date-time":"2018-09-18T11:52:29Z","timestamp":1537271549000},"page":"25","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["On the Performance and Security of Multiplication in GF(2N)"],"prefix":"10.3390","volume":"2","author":[{"given":"Jean-Luc","family":"Danger","sequence":"first","affiliation":[{"name":"LTCI, T\u00e9l\u00e9com ParisTech, Universit\u00e9 Paris-Saclay, 75013 Paris, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2873-3479","authenticated-orcid":false,"given":"Youssef","family":"El Housni","sequence":"additional","affiliation":[{"name":"Secure-IC S.A.S., 35510 Cesson-S\u00e9vign\u00e9, France"}]},{"given":"Adrien","family":"Facon","sequence":"additional","affiliation":[{"name":"Secure-IC S.A.S., 35510 Cesson-S\u00e9vign\u00e9, France"},{"name":"D\u00e9partement d\u2019Informatique, \u00c9cole Normale Sup\u00e9rieure, CNRS, PSL Research University, 75005 Paris, France"}]},{"given":"Cheikh T.","family":"Gueye","sequence":"additional","affiliation":[{"name":"D\u00e9partement Math\u00e9matique et Informatique, Universit\u00e9 Cheikh Anta Diop, Dakar 5005, Senegal"}]},{"given":"Sylvain","family":"Guilley","sequence":"additional","affiliation":[{"name":"LTCI, T\u00e9l\u00e9com ParisTech, Universit\u00e9 Paris-Saclay, 75013 Paris, France"},{"name":"Secure-IC S.A.S., 35510 Cesson-S\u00e9vign\u00e9, France"},{"name":"D\u00e9partement d\u2019Informatique, \u00c9cole Normale Sup\u00e9rieure, CNRS, PSL Research University, 75005 Paris, France"}]},{"given":"Sylvie","family":"Herbel","sequence":"additional","affiliation":[{"name":"Secure-IC S.A.S., 35510 Cesson-S\u00e9vign\u00e9, France"}]},{"given":"Ousmane","family":"Ndiaye","sequence":"additional","affiliation":[{"name":"D\u00e9partement Math\u00e9matique et Informatique, Universit\u00e9 Cheikh Anta Diop, Dakar 5005, Senegal"}]},{"given":"Edoardo","family":"Persichetti","sequence":"additional","affiliation":[{"name":"Department of Mathematical Sciences, Florida Atlantic University, Boca Raton, FL 33431, USA"}]},{"given":"Alexander","family":"Schaub","sequence":"additional","affiliation":[{"name":"LTCI, T\u00e9l\u00e9com ParisTech, Universit\u00e9 Paris-Saclay, 75013 Paris, France"}]}],"member":"1968","published-online":{"date-parts":[[2018,9,18]]},"reference":[{"key":"ref_1","unstructured":"Paar, C. (1994). Efficient VLSI architectures for Bit-Parallel Computation in Galois Fields. [Ph.D. Thesis, Institute for Experimental Mathematics]. Available online: https:\/\/tinyurl.com\/yc7hmfmo."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"1391","DOI":"10.1109\/TC.2003.1244937","article-title":"Constructing composite field representations for efficient conversion","volume":"52","author":"Sunar","year":"2003","journal-title":"IEEE Trans. Comput."},{"key":"ref_3","unstructured":"(2018, September 18). Round 1 Submissions (30\/11\/2017)\u2014Post-Quantum Cryptography, Available online: https:\/\/csrc.nist.gov\/Projects\/Post-Quantum-Cryptography\/Round-1-Submissions."},{"key":"ref_4","unstructured":"(2018, September 18). DAGS project. Available online: http:\/\/www.dags-project.org."},{"key":"ref_5","unstructured":"NIST\/ITL\/CSD (2018, September 18). Advanced Encryption Standard (AES). FIPS PUB 197, 11\/26\/2001. (Also ISO\/IEC 18033-3:2010), Available online: http:\/\/nvlpubs.nist.gov\/nistpubs\/FIPS\/NIST.FIPS.197.pdf."},{"key":"ref_6","first-page":"114","article-title":"A public-key cryptosystem based on algebraic coding theory","volume":"42\u201344","author":"McEliece","year":"1978","journal-title":"JPL DSN Prog. Rep."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","article-title":"A method for obtaining digital signatures and public-key cryptosystems","volume":"21","author":"Rivest","year":"1978","journal-title":"Commun. ACM"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","article-title":"New directions in cryptography","volume":"22","author":"Diffie","year":"1976","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Bardet, M., Chaulet, J., Dragoi, V., Otmani, A., and Tillich, J.P. (2016, January 24\u201326). Cryptanalysis of the McEliece public key cryptosystem based on polar codes. Proceedings of the 7th International Conference on Post-Quantum Cryptography (PQCrypto 2016), Fukuoka, Japan.","DOI":"10.1007\/978-3-319-29360-8_9"},{"key":"ref_10","unstructured":"(2018, September 18). Post-Quantum Cryptography Challenge (ongoing), Available online: https:\/\/csrc.nist.gov\/Projects\/Post-Quantum-Cryptography\/Round-1-Submissions."},{"key":"ref_11","unstructured":"Yarom, Y., and Falkner, K. (2014, January 20\u201322). FLUSH+RELOAD: A High Resolution, Low Noise, L3 Cache Side-Channel Attack. Proceedings of the 23rd USENIX Security Symposium (USENIX Security 14), San Diego, CA, USA."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Facon, A., Guilley, S., Lec\u2019hvien, M., Schaub, A., and Souissi, Y. (2018, January 2\u20134). Detecting cache-timing vulnerabilities in post-quantum cryptography algorithms. Proceedings of the 3rd IEEE International Verification and Security Workshop, Hotel Cap Roig, Platja d\u2019Aro, Costa Brava, Spain.","DOI":"10.1109\/IVSW.2018.8494855"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Lidl, R., and Niederreiter, H. (1997). Finite Fields, Cambridge University Press.","DOI":"10.1017\/CBO9780511525926"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s00145-009-9049-y","article-title":"Efficient Cache Attacks on AES, and Countermeasures","volume":"23","author":"Tromer","year":"2010","journal-title":"J. Cryptol."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Acii\u00e7mez, O., Ko\u00e7, \u00c7.K., and Seifert, J.P. (2007, January 20\u201322). On the power of simple branch prediction analysis. Proceedings of the 2nd ACM Symposium on Information, Computer and Communications Security, Singapore.","DOI":"10.1145\/1229285.1266999"},{"key":"ref_16","unstructured":"Acii\u00e7mez, O., Ko\u00e7, \u00c7.K., and Seifert, J. (2007, January 5\u20139). Predicting Secret Keys Via Branch Prediction. Proceedings of the Cryptographers\u2019 Track at the RSA Conference 2007, San Francisco, CA, USA."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Biham, E. (1997, January 20\u201322). A Fast New DES Implementation in Software. Proceedings of the the Fourth International Workshop on Fast Software Encryption, Haifa, Israel.","DOI":"10.1007\/BFb0052329"},{"key":"ref_18","unstructured":"Matsui, M., and Nakajima, J. (2007, January 10\u201313). On the Power of Bitslice Implementation on Intel Core2 Processor. Proceedings of the Cryptographic Hardware and Embedded Systems, Vienna, Austria."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","article-title":"On the Inherent Intractability of Certain Coding Problems","volume":"24","author":"Berlekamp","year":"1978","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Misoczki, R., and Barreto, P.S.L.M.B. (2009, January 13\u201314). Compact McEliece Keys from Goppa Codes. Proceedings of the 16th Workshop on Selected Areas in Cryptography (SAC 2009), Calgary, AB, Canada.","DOI":"10.1007\/978-3-642-05445-7_24"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1515\/jmc-2011-0099","article-title":"Compact McEliece keys based on quasi-dyadic Srivastava codes","volume":"6","author":"Persichetti","year":"2012","journal-title":"J. Math. Cryptol."},{"key":"ref_22","unstructured":"Faug\u00e8re, J.C., Otmani, A., Perret, L., and Tillich, J.P. (June, January 30). Algebraic Cryptanalysis of McEliece Variants with Compact Keys. Proceedings of the 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, French Riviera, France."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1109\/TIT.1962.1057777","article-title":"The use of information sets in decoding cyclic codes","volume":"8","author":"Prange","year":"1962","journal-title":"IRE Trans. Inf. Theory"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Peters, C. (2010, January 25\u201328). Information-Set Decoding for Linear Codes over Fq. Proceedings of the The Third International Workshop on Post-Quantum Cryptography, Darmstadt, Germany.","DOI":"10.1007\/978-3-642-12929-2_7"}],"container-title":["Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2410-387X\/2\/3\/25\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:21:17Z","timestamp":1760196077000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2410-387X\/2\/3\/25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,18]]},"references-count":24,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2018,9]]}},"alternative-id":["cryptography2030025"],"URL":"https:\/\/doi.org\/10.3390\/cryptography2030025","relation":{},"ISSN":["2410-387X"],"issn-type":[{"value":"2410-387X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9,18]]}}}