Prof. Sylvain Guilley
Secure-IC, France
+2
'%3e%3cpath%20d='M22.1642%2019.0924C21.7317%2018.068%2021.1041%2017.1375%2020.3163%2016.3527C19.5309%2015.5656%2018.6006%2014.9381%2017.5766%2014.5048C17.5674%2014.5002%2017.5582%2014.4979%2017.5491%2014.4933C18.9774%2013.4616%2019.9059%2011.7811%2019.9059%209.88504C19.9059%206.74408%2017.3611%204.19922%2014.2201%204.19922C11.0792%204.19922%208.53429%206.74408%208.53429%209.88504C8.53429%2011.7811%209.46282%2013.4616%2010.8912%2014.4956C10.882%2014.5002%2010.8728%2014.5025%2010.8636%2014.5071C9.83652%2014.9404%208.91487%2015.5617%208.1239%2016.355C7.33685%2017.1404%206.70933%2018.0707%206.276%2019.0947C5.85031%2020.0972%205.62072%2021.172%205.59967%2022.2609C5.59905%2022.2853%205.60335%2022.3097%205.61229%2022.3325C5.62123%2022.3553%205.63465%2022.376%205.65174%2022.3935C5.66883%2022.4111%205.68926%2022.425%205.71182%2022.4345C5.73437%2022.444%205.7586%2022.4489%205.78308%2022.4489H7.15868C7.25956%2022.4489%207.3398%2022.3686%207.3421%2022.2701C7.38795%2020.5001%208.09868%2018.8425%209.35506%2017.5861C10.655%2016.2862%2012.3814%2015.5709%2014.2201%2015.5709C16.0588%2015.5709%2017.7852%2016.2862%2019.0852%2017.5861C20.3415%2018.8425%2021.0523%2020.5001%2021.0981%2022.2701C21.1004%2022.3709%2021.1807%2022.4489%2021.2815%2022.4489H22.6571C22.6816%2022.4489%2022.7058%2022.444%2022.7284%2022.4345C22.751%2022.425%2022.7714%2022.4111%2022.7885%2022.3935C22.8056%2022.376%2022.819%2022.3553%2022.8279%2022.3325C22.8369%2022.3097%2022.8412%2022.2853%2022.8406%2022.2609C22.8176%2021.165%2022.5907%2020.0989%2022.1642%2019.0924ZM14.2201%2013.8284C13.1678%2013.8284%2012.1773%2013.418%2011.4322%2012.6729C10.6871%2011.9278%2010.2767%2010.9374%2010.2767%209.88504C10.2767%208.83271%2010.6871%207.84227%2011.4322%207.09715C12.1773%206.35204%2013.1678%205.94165%2014.2201%205.94165C15.2724%205.94165%2016.2629%206.35204%2017.008%207.09715C17.7531%207.84227%2018.1635%208.83271%2018.1635%209.88504C18.1635%2010.9374%2017.7531%2011.9278%2017.008%2012.6729C16.2629%2013.418%2015.2724%2013.8284%2014.2201%2013.8284Z'%20fill='%238590A2'/%3e%3c/g%3e%3c/svg%3e)
Co-authors
Following
Followers
Research Focus & Metrics
Explore full metrics on Scilit
Academic Career Length
23Years (2004-Present)
(Calculated once Scilit publication data is synced: current year − year of first publication + 1)
Representative Publications
View All Publications1 January 2016 in Advances in Mathematics of Communications
Journal Article
Claude CarletSylvain GuilleyWe recall why linear codes with complementary duals (LCD codes) play a role in counter-measures to passive and active side-channel analyses on embedded cryptosystems. The rate and the minimum distance of such LCD codes must be as large as possible. We recall the known primary construction of such codes with cyclic codes, and investigate other constructions, with expanded Reed-Solomon codes and generalized residue codes, for which we study the idempotents. These constructions do not allow to reach all the desired parameters. We study then those secondary constructions which preserve the LCD property, and we characterize conditions under which codes obtained by direct sum, direct product, puncturing, shortening, extending codes, or obtained by the Plotkin sum, can be LCD.
11 November 2023 in Computer Communications
Journal Article
CGCarlos Rubio García
Carlos Rubio García
Simon RommelSTSofiane Takarabt
Sofiane Takarabt
JOJuan Jose Vegas Olmos
Juan Jose Vegas Olmos
Sylvain Guilley
Idelfonso Tafur Monroy +1
1 January 2004
Book Chapter
1 December 2016 in Evolutionary Computation
Journal Article
SPStjepan Picek
Stjepan PicekClaude CarletSylvain GuilleyJMJulian F. Miller
Julian F. MillerDJDomagoj Jakobovic
Domagoj JakobovicThe role of Boolean functions is prominent in several areas including cryptography, sequences, and coding theory. Therefore, various methods for the construction of Boolean functions with desired properties are of direct interest. New motivations on the role of Boolean functions in cryptography with attendant new properties have emerged over the years. There are still many combinations of design criteria left unexplored and in this matter evolutionary computation can play a distinct role. This article concentrates on two scenarios for the use of Boolean functions in cryptography. The first uses Boolean functions as the source of the nonlinearity in filter and combiner generators. Although relatively well explored using evolutionary algorithms, it still presents an interesting goal in terms of the practical sizes of Boolean functions. The second scenario appeared rather recently where the objective is to find Boolean functions that have various orders of the correlation immunity and minimal Hamming weight. In both these scenarios we see that evolutionary algorithms are able to find high-quality solutions where genetic programming performs the best.
29 September 2017 in IEEE Transactions on Computers
Journal Article
AHAnnelie Heuser
Annelie HeuserSPStjepan Picek
Stjepan PicekSylvain GuilleyNMNele Mentens
Nele MentensSide-channel attacks represent a powerful category of attacks against cryptographic devices. Still, side-channel analysis for lightweight ciphers is much less investigated than for instance for AES. Although intuition may lead to the conclusion that lightweight ciphers are weaker in terms of side-channel resistance, that remains to be confirmed and quantified. In this paper, we consider various side-channel analysis metrics which should provide an insight on the resistance of lightweight ciphers against side-channel attacks. In particular, for the non-profiled scenario we use the theoretical confusion coefficient and empirical optimal distinguisher. Our study considers side-channel attacks on the first, the last, or both rounds simultaneously. Furthermore, we conduct a profiled side-channel analysis using various machine learning attacks to recover 4-bit and 8-bit intermediate states of the cipher. Our results show that the difference between AES and lightweight ciphers is smaller than one would expect, and even find scenarios in which lightweight ciphers may be more resistant. Interestingly, we observe that the studied 4-bit S-boxes have a different side-channel resilience, while the difference in the 8-bit ones is only theoretically present.
About Me
Sylvain Guilley is General Manager and CTO at Secure-IC, a French company offering security for embedded systems.
Secure-IC's flagship product is the multi-certified Securyzr integrated Secure Element (iSE).
Sylvain is also professor at TELECOM-Paris, research associate at Ecole Normale Sup\'erieure (ENS), and adjunct professor at the Chinese Academy of Sciences (CAS, Beijing).
His research interests are trusted computing, cyber-physical security, secure prototyping in FPGA and ASIC, and formal / mathematical methods.
Since 2012, he organizes the PROOFS workshop (http://www.proofs-workshop.org/2020/), which brings together researchers whose objective is to increase the trust in the security of embedded systems.
Sylvain is also lead editor of international standards, such as ISO/IEC 20897 (Physically Unclonable Functions), ISO/IEC 20085 (Calibration of non-invasive testing tools), and ISO/IEC 24485 (White Box Cryptography).
He is leading the topic ``High Level Principles for Design \& Architecture'' in the editing team of TR68 (Singapore, Standards Development Organisation), and is member of the French BNA (Bureau de Normalisation de l'Automobile).
Sylvain is associate editor of the Springer Journal of Cryptography Engineering (JCEN).
He has co-authored 250+ research papers and filed 40+ invention patents.
He is member of the IACR, the IEEE and senior member of the CryptArchi club.
He is an alumnus from Ecole Polytechnique and TELECOM-Paris.