{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T15:57:51Z","timestamp":1770134271936,"version":"3.49.0"},"reference-count":52,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2015,4,21]],"date-time":"2015-04-21T00:00:00Z","timestamp":1429574400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"crossref","award":["306935\/2012-0"],"award-info":[{"award-number":["306935\/2012-0"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["306935\/2012-0"],"award-info":[{"award-number":["306935\/2012-0"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Embed. Comput. Syst."],"published-print":{"date-parts":[[2015,5,21]]},"abstract":"<jats:p>Asymmetric cryptographic primitives are essential to enable secure communications in public networks or public mediums. Such primitives can be deployed as software libraries or hardware co-processors, the latter being more commonly employed in systems on chip (SoC) scenarios, embedded devices, or application-specific servers. Unfortunately, the most commonly available solutions, based on RSA or elliptic curve cryptography (ECC), are highly processing intensive due to the underlying extended-precision modular arithmetic. Consequently, they are not available on highly constrained platforms. Aiming to tackle this issue, we here investigate an alternative asymmetric encryption scheme that relies on lightweight arithmetic: McEliece. This scheme is especially appealing because, being based on error correction codes, it displays a simpler arithmetic and leads to better performance when compared to RSA or ECC. To evaluate the implementation of this scheme in hardware, we propose and analyze a flexible architecture whose security level and time versus area usage characteristics can be reconfigured as desired. The proposed architecture is suitable to all usual security levels, ranging from 80 to 256 bits. It is also very efficient, being able to perform data decryption with binary Goppa codes in 56\u00b5s with 3,402 slices on a Xilinx Spartan-3AN FPGA, whereas the best-known result in the literature for the same FPGA is 115\u00b5s with 7,331 slices. Alternatively, the architecture can operate with quasi-dyadic Goppa (QD-Goppa) codes, which involves smaller keys than traditional binary Goppa codes. In the latter case, for an 80-bit security level, the decryption operation can take from 1.1ms with 1,129 slices to 68\u00b5s with 8,268 sices. By choosing a more hardware-friendly decoding algorithm, focusing hardware resources on most bottleneck operations and sharing hardware resource for two different algorithms, better results than the those in the literature were obtained.<\/jats:p>","DOI":"10.1145\/2736284","type":"journal-article","created":{"date-parts":[[2015,4,22]],"date-time":"2015-04-22T13:57:35Z","timestamp":1429711055000},"page":"1-32","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Optimized and Scalable Co-Processor for McEliece with Binary Goppa Codes"],"prefix":"10.1145","volume":"14","author":[{"given":"Pedro Maat C.","family":"Massolino","sequence":"first","affiliation":[{"name":"University of Sao Paulo, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paulo S. L. M.","family":"Barreto","sequence":"additional","affiliation":[{"name":"University of Sao Paulo, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wilson V.","family":"Ruggiero","sequence":"additional","affiliation":[{"name":"University of Sao Paulo, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,4,21]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1049\/el:20050769"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034058"},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"E. Barker W. Barker W. Burr W. Polk and M. Smid. 2012. Recommendation for Key Management\u2014Part 1: General (Revision 3). Technical Report. National Institute of Standards and Technology Gaithersburg MD.   E. Barker W. Barker W. Burr W. Polk and M. Smid. 2012. Recommendation for Key Management\u2014Part 1: General (Revision 3). Technical Report. National Institute of Standards and Technology Gaithersburg MD.","DOI":"10.6028\/NIST.SP.800-57p1r3"},{"key":"e_1_2_1_4_1","unstructured":"P. S. L. M. Barreto. 2011. Constru\u00e7\u00e3o de Par\u00e3metros e Algoritmos Eficiente para Criptossietmas P\u00f3s-Qu\u00e2nticos Baseados em Teoria dos C\u00f3digos.  P. S. L. M. Barreto. 2011. Constru\u00e7\u00e3o de Par\u00e3metros e Algoritmos Eficiente para Criptossietmas P\u00f3s-Qu\u00e2nticos Baseados em Teoria dos C\u00f3digos."},{"key":"e_1_2_1_5_1","volume-title":"Information Security and Cryptology. Lecture Notes in Computer Science","volume":"6584","author":"Barreto P. S. L. M."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25405-5_12"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40349-1_15"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88403-3_3"},{"key":"e_1_2_1_9_1","volume-title":"Advances in Cryptology\u2014EUROCRYPT","author":"Bertoni G.","year":"2013"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13389-014-0070-1"},{"key":"e_1_2_1_11_1","volume-title":"Proceedings of the Western European Workshop on Research in Cryptology.","author":"Biswas B."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1996.0125"},{"key":"e_1_2_1_13_1","volume-title":"Researchers Inch Toward Quantum Computer. Retrieved","author":"Chang K.","year":"2012"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04138-9_4"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04138-9_4"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_14"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2014.6865756"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASAP.2012.16"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2012.271"},{"key":"e_1_2_1_24_1","first-page":"24","article-title":"A new class of linear error correcting codes","volume":"6","author":"Goppa V. D.","year":"1970","journal-title":"Problemy Peredachi Informatsii"},{"key":"e_1_2_1_25_1","volume-title":"Cryptographic Hardware and Embedded Systems\u2014CHES","author":"Gura N.","year":"2004"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055730"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13389-013-0056-4"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40349-1_16"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.272496"},{"key":"e_1_2_1_30_1","volume-title":"The Theory of Error-Correcting Codes","author":"MacWilliams F. J."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1969.1054260"},{"key":"e_1_2_1_32_1","volume-title":"Proceedings of the IEEE 5th Latin American Symposium on Circuits and Systems (LASCAS). IEEE","author":"Massolino P. M. C.","year":"2014"},{"key":"e_1_2_1_33_1","unstructured":"R. McEliece. 1978. A Public-Key Cryptosystem Based on Algebraic Coding Theory. Deep Space Network Progress Report DSN PR 42--44. http:\/\/ipnpr.jpl.nasa.gov\/progress report2\/42-44\/44N.PDF.  R. McEliece. 1978. A Public-Key Cryptosystem Based on Algebraic Coding Theory. Deep Space Network Progress Report DSN PR 42--44. http:\/\/ipnpr.jpl.nasa.gov\/progress report2\/42-44\/44N.PDF."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/18262.25413"},{"key":"e_1_2_1_35_1","volume-title":"Umafam\u00edlia de c\u00f3digos corretores de erro para criptossistemas eficientes baseados em decodifica\u00e7\u00e3o de s\u00edndromes. Master\u2019s thesis. Escola Polit\u00e9cnica","author":"Misoczki R.","year":"2010"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-05445-7_24"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620590"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-011-0153-2"},{"key":"e_1_2_1_40_1","first-page":"159","article-title":"Knapsack-type cryptosystems and algebraic coding theory","volume":"15","author":"Niederreiter H.","year":"1986","journal-title":"Problems of Control and Information Theory"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055350"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1960.1057586"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33027-8_29"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055732"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144598347011"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2010.115"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2010.04.010"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12929-2_8"},{"key":"e_1_2_1_50_1","volume-title":"Retrieved","author":"Strenzke F.","year":"2011"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88403-3_15"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(75)90090-X"},{"key":"e_1_2_1_53_1","doi-asserted-by":"crossref","unstructured":"D. Suzuki and T. Matsumoto. 2011. How to maximize the potential of FPGA-based DSPs for modular exponentiation. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences E94-A 1 211--222.  D. Suzuki and T. Matsumoto. 2011. How to maximize the potential of FPGA-based DSPs for modular exponentiation. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences E94-A 1 211--222.","DOI":"10.1587\/transfun.E94.A.211"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055449"},{"key":"e_1_2_1_55_1","volume-title":"Proceedings of the Design, Automation, and Test in Europe Conference and Exhibition (DATE). IEEE","author":"von Maurich I."},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1964.263830"}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2736284","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2736284","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:12:30Z","timestamp":1750227150000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2736284"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,21]]},"references-count":52,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,5,21]]}},"alternative-id":["10.1145\/2736284"],"URL":"https:\/\/doi.org\/10.1145\/2736284","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"value":"1539-9087","type":"print"},{"value":"1558-3465","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,21]]},"assertion":[{"value":"2014-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-02-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-04-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}