{"id":271,"date":"2021-06-28T07:15:15","date_gmt":"2021-06-28T07:15:15","guid":{"rendered":"https:\/\/projects.lsv.ens-paris-saclay.fr\/confsrentree\/?page_id=271"},"modified":"2022-10-31T19:16:50","modified_gmt":"2022-10-31T19:16:50","slug":"introduction-to-efficient-and-secure-arithmetic-circuits","status":"publish","type":"page","link":"https:\/\/projects.lsv.ens-paris-saclay.fr\/confsrentree\/?page_id=271","title":{"rendered":"Introduction to Efficient and Secure Arithmetic Circuits"},"content":{"rendered":"\n<p><img loading=\"lazy\" decoding=\"async\" class=\"alignright\" src=\"https:\/\/www-labsticc.univ-ubs.fr\/~tisseran\/img\/arnaud.png\" width=\"150\" height=\"300\"><\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><a href=\"https:\/\/www.arnaud-tisserand.fr\/\">Arnaud Tisserand<\/a>, <a href=\"https:\/\/www.labsticc.fr\">Lab-STICC<\/a>, <a href=\"https:\/\/www.cnrs.fr\/\">CNRS<\/a>, Lorient<\/h2>\n\n\n\n<p>Slides in English and presentation in French (or English if required).<\/p>\n\n\n\n<div class=\"wp-block-file\"><a id=\"wp-block-file--media-173213c9-2cc3-4ca1-9061-4340d75bcbb5\" href=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/confsrentree\/wp-content\/uploads\/2021\/09\/slides-arith-circuits-ens21_compressed.pdf\">The slides are here<\/a><a href=\"https:\/\/projects.lsv.ens-paris-saclay.fr\/confsrentree\/wp-content\/uploads\/2021\/09\/slides-arith-circuits-ens21_compressed.pdf\" class=\"wp-block-file__button\" download aria-describedby=\"wp-block-file--media-173213c9-2cc3-4ca1-9061-4340d75bcbb5\">Download<\/a><\/div>\n\n\n\n<p>(<a href=\"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/\">Creative Commons<\/a> Attribution &#8211; NonCommercial 4.0 International License.)<\/p>\n\n\n\n<p>The videos are on <a href=\"https:\/\/ecampus.paris-saclay.fr\/course\/view.php?id=63482#section-4\">eCampus<\/a>.<\/p>\n\n\n\n<p>Processors and many electronic circuits have units dedicated to arithmetic computations such as addition\/subtraction, multiplication or division. Some units are directly accessible in the instruction set of the processor while others are buried into different circuit blocks (e.g., memory address generation, cryptographic accelerator).<\/p>\n\n\n\n<p>Designing arithmetic units requires to take into account different and<br>sometimes conflicting objectives and constraints: ensuring quality (e.g., good accuracy, overflow detection), providing fast operations, requiring small silicon area and small energy, or, in the case of embedded systems, reducing some vulnerabilities to physical attacks.<\/p>\n\n\n\n<p>The first part of the conference will deal with efficiency. After a few<br>reminders on digital circuits design, I will present basic arithmetic units for<br>integer addition and multiplication. Then, I will introduce problems and<br>solution examples related to high-speed arithmetic circuits and energy<br>reduction. I will show how other representations of numbers help to perform more efficient computations.<\/p>\n\n\n\n<p>The last part of the conference will deal with some security aspects related to physical attacks. First I will introduce attacks based on observation (i.e.,<br>side channel attacks) or perturbation (i.e., fault injection attacks) of the<br>circuit. Then I will present attack examples. Finally I will present<br>protection examples using &#8220;exotic&#8221; representations of numbers and adapted<br>algorithms and implementations.<\/p>\n\n\n\n<p>During the conference, I will use historical and current examples from research results and industry to illustrate some points.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Arnaud Tisserand, Lab-STICC, CNRS, Lorient Slides in English and presentation in French (or English if required). (Creative Commons Attribution &#8211; NonCommercial 4.0 International License.) The videos are on eCampus. Processors and many electronic circuits have units dedicated to arithmetic computations such as addition\/subtraction, multiplication or division. Some units are directly accessible in the instruction set [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-271","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/confsrentree\/index.php?rest_route=\/wp\/v2\/pages\/271","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/confsrentree\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/confsrentree\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/confsrentree\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/confsrentree\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=271"}],"version-history":[{"count":22,"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/confsrentree\/index.php?rest_route=\/wp\/v2\/pages\/271\/revisions"}],"predecessor-version":[{"id":434,"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/confsrentree\/index.php?rest_route=\/wp\/v2\/pages\/271\/revisions\/434"}],"wp:attachment":[{"href":"https:\/\/projects.lsv.ens-paris-saclay.fr\/confsrentree\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=271"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}