Personal Page of Léo Perrin

Table of Contents

Who Am I?

I am a post-doc at Inria, in the team SECRET. I work on symmetric cryptography and Boolean functions. I have previously worked/studied at the following places.

You may reach me at mylastname dot myfirstname at gmail dot com.

Things I do/Have Done

Research

Some of my results are summarized here. My latest results about the Russian S-box are summarized in more details here. I also try to keep track of which symmetric algorithms have been standardized; the result is here (work in progress).

Software Development

  • Sage library for studying Boolean functions: SboxU. It is very much a work in progress.
  • I implemented a verifier for the verificatum electronic vote platform. I sold it to a subcontractor of the Norwegian Ministry of Local Government and Regional Development (KRD) who used it in the Norwegian parliamentary elections of 2013. It is available on github.

Committee/Editorial Board

Awards

  • Prix Rolf Tarrach: For my PhD thesis [2], I was awarded the Prix Rolf Tarrach; formerly known as the "prix de la meilleure thèse".
  • PRINCE Challenge: I am co-winner of the first round of the PRINCE challenge, a cryptanalysis competition setup by the NXP company. The corresponding paper [13] was accepted at FSE'15 and was recognized as a top 3 contribution.
  • Best Paper Award: my paper Partitions in the S-Box of Streebog and Kuznyechik [10] was selected as the best paper presented at FSE'19.

Publications List

All my publications are listed below. When available, I also provide a link to the corresponding conference presentation. See also google scholar.

Memoirs

  1. On the properties of S-boxes. Master thesis done in the crypto group at Aalto University under the supervision of Céline Blondeau. Defended in March 2013.
  2. Cryptanalysis, Reverse-Engineering and Design of Symmetric Cryptographic Algorithms. PhD thesis in computer science done in the cryptoLux group from the university of Luxembourg under the supervision of Alex Biryukov. Defended in April 2017. It was awarded the Rolf Tarrach price. pdf at uni.lu. slides.

Journal Papers

  1. Céline Blondeau and Léo Perrin. More differentially 6-uniform power functions. Designs, Codes and Cryptography, 73(2):487–505, 2014. link to springer.com.
  2. Alex Biryukov, Dmitry Khovratovich, and Léo Perrin. Multiset-algebraic cryptanalysis of reduced Kuznyechik, Khazad, and secret SPNs. IACR Transactions on Symmetric Cryptology, 2016(2):226–247, 2017. link to tosc.iacr.org.
  3. Léo Perrin and Aleksei Udovenko. Exponential S-boxes: a link between the S-boxes of BelT and Kuznyechik/Streebog. IACR Transactions on Symmetric Cryptology, 2016(2):99–124, 2017. link to tosc.iacr.org.
  4. Anne Canteaut, Sébastien Duval, and Léo Perrin. A generalisation of Dillon's APN permutation with the best known differential and nonlinear properties for all fields of size $2^{4k+2}$. IEEE Transactions on Information Theory, 63(11):7575–7591, Nov 2017. link to eprint.iacr.org.
  5. Dumitru-Daniel Dinu, Yann Le Corre, Dmitry Khovratovich, Léo Perrin, Johann Großschädl and Alex Biryukov. Triathlon of Lightweight Block Ciphers for the Internet of Things. Journal of Cryptographic Engineering, pp. 1–20, Jul 2018. link to eprint.iacr.org.
  6. Anne Canteaut, and Léo Perrin. On CCZ-Equivalence, Extended-Affine Equivalence, and Function Twisting. Finite Fields and their Applications, 26:209–246, Mar 2019. link to eprint.iacr.org.
  7. Anne Canteaut, Léo Perrin and Shizhu Tian. If a Generalised Butterfly is APN then it Operates on 6 Bits. Cryptography and Communications. To appear. link to eprint.iacr.org.
  8. Léo Perrin. Partitions in the S-Box of Streebog and Kuznyechik IACR Transactions on Symmetric Cryptology, 2019(1), 302–329, 2019. link to tosc.iacr.org.

Proceedings of International Peer-Reviewed Conferences

  1. Léo Perrin and Dmitry Khovratovich. Collision spectrum, entropy loss, T-sponges, and cryptanalysis of GLUON-64. In Carlos Cid and Christian Rechberger, editors, Fast Software Encryption – FSE 2014, volume 8540 of Lecture Notes in Computer Science, pages 82–103. Springer, Heidelberg, March 2015. link to eprint.iacr.org.
  2. Alex Biryukov, Patrick Derbez, and Léo Perrin. Differential analysis and meet-in-the-middle attack against round-reduced TWINE. In Gregor Leander, editor. Fast Software Encryption – FSE 2015, volume 9054 of Lecture Notes in Computer Science. Springer, Heidelberg, March 2015. link to eprint.iacr.org; Presentation by myself: link to youtube.
  3. Patrick Derbez and Léo Perrin. Meet-in-the-middle attacks and structural analysis of round-reduced PRINCE. In Gregor Leander, editor. Fast Software Encryption – FSE 2015, volume 9054 of Lecture Notes in Computer Science. Springer, Heidelberg, March 2015. link to eprint.iacr.org; presentation by Patrick Derbez: link to youtube.
  4. Alex Biryukov, Gaëtan Leurent, and Léo Perrin. Cryptanalysis of Feistel networks with secret round functions. In Orr Dunkelman and Liam Keliher, editors, Selected Areas in Cryptography – SAC 2015, volume 9566 of Lecture Notes in Computer Science, pages 102–121, Cham, 2016. Springer International Publishing. link to eprint.iacr.org.
  5. Alex Biryukov and Léo Perrin. On reverse-engineering S-boxes with hidden design criteria or structure. In Rosario Gennaro and Matthew J. B. Robshaw, editors, Advances in Cryptology – CRYPTO 2015, Part I, volume 9215 of Lecture Notes in Computer Science, pages 116–140. Springer, Heidelberg, August 2015. link to eprint.iacr.org.
  6. Alex Biryukov, Léo Perrin, and Aleksei Udovenko. Reverse-engineering the S-box of streebog, kuznyechik and STRIBOBr1. In Marc Fischlin and Jean-Sébastien Coron, editors, Advances in Cryptology – EUROCRYPT 2016, Part I, volume 9665 of Lecture Notes in Computer Science, pages 372–402. Springer, Heidelberg, May 2016. link to eprint.iacr.org.
  7. Léo Perrin and Aleksei Udovenko. Algebraic insights into the secret feistel network. In Thomas Peyrin, editor, Fast Software Encryption – FSE 2016, volume 9783 of Lecture Notes in Computer Science, pages 378–398. Springer, Heidelberg, March 2016. link to eprint.iacr.org.
  8. Léo Perrin, Aleksei Udovenko, and Alex Biryukov. Cryptanalysis of a theorem: Decomposing the only known solution to the big APN problem. In Matthew Robshaw and Jonathan Katz, editors, Advances in Cryptology – CRYPTO 2016, Part II, volume 9815 of Lecture Notes in Computer Science, pages 93–122. Springer, Heidelberg, August 2016. link to eprint.iacr.org; Presentation by Aleskei Udovenko: link to youtube.
  9. Daniel Dinu, Léo Perrin, Aleksei Udovenko, Vesselin Velichkov, Johann Großschädl, and Alex Biryukov. Design strategies for ARX with provable bounds: Sparx and LAX. In Jung Hee Cheon and Tsuyoshi Takagi, editors, Advances in Cryptology – ASIACRYPT 2016, Part I, volume 10031 of Lecture Notes in Computer Science, pages 484–513. Springer, Heidelberg, December 2016. link to eprint.iacr.org.
  10. Alex Biryukov and Léo Perrin. Symmetrically and Asymmetrically Hard Cryptography. In Tsuyoshi Takagi and Thomas Peyrin, editors, Advances in Cryptology – ASIACRYPT 2017, Part III, volume 10626 of Lecture Notes in Computer Science, pages 417–445. Springer, Heidelberg, December 2017. link to eprint.iacr.org; Presentation by myself: link to youtube.

Other Publications

  1. Adi Shamir, Alex Biryukov, and Léo Perrin. Summary of an Open Discussion on IoT and Lightweight Cryptography. Proceedings of Early Symmetric Crypto workshop, 2017. link to uni.lu
  2. Alex Biryukov, and Léo Perrin. State of the Art in Lightweight Symmetric Cryptography. Eprint report, 2017. link to eprint.iacr.org

Invited Talks/Seminars

Invitation Only International Workshops

  • Dagstuhl 18021: Generalized Feistel Networks with Optimal Diffusion. Dagstuhl Seminar 18021 (Symmetric Cryptography), Dagstuhl, Germany, January 18. website
  • ESC'17: On the Scope of Lightweight Cryptography. Early Symmetric Crypto (ESC), Canach, Luxembourg, January 17. website; slides
  • Dagstuhl 16021: S-Box Reverse-Engineering: Recovering Design Criteria, Hidden Structures and New Boolean Function Result. Dagstuhl Seminar 16021 (Symmetric Cryptography), Dagstuhl, Germany, January 2016. website
  • ESC'15: On reverse-engineering S-boxes with hidden design criteria or structure. Early Symmetric Crypto (ESC), Clervaux, Luxembourg, January 2015. website; slides

Other Workshop and Conferences

  • BFA 2018: On CCZ-Equivalence, Extended Affine-Equivalence and Function Twisting. Boolean Functions and their Applications 2018, Loen, Norway, June 2018. website; abstract; slides
  • CECC'18: On S-Box Reverse-Engineering. Central European Conference on Cryptology 2018, Smolenice, Slovakia, June 2018. website; slides
  • Cryptacus 2017: State of the Art in Lightweight Symmetric Cryptography. Cryptacus Workshop, Nijmegen, Netherlands, November 2017. website; slides
  • BFA 2017: On S-Box Reverse-Engineering: from Cryptanalysis to the Big APN Problem. Boolean Functions and their Applications 2017, Bergen, Norway, July 17. website; slides
  • CryptoAction Symposium II: On S-Box Reverse-Engineering. CryptoAction Symposium II, Amsterdam, Netherlands, March 2017. website

Local Seminars

  • CARAMBA Seminar: S-Box Decomposition and Some Applications. CARAMBA team, Nancy, France, January 2019. slides
  • CRYPTO Seminar: Vector Spaces Search and its Applications in Boolean Functions. UVSQ, Versailles, France, November 2018.
  • CCA: Rétro-ingénierie de boîtes-S. Séminaire Codage, Cryptologie, Algorithmes (CCA), Paris, France, July 2017. website
  • Inria Seminar: Cryptanalysis of a Theorem: Decomposing the Only Known Solution to the Big APN Problem. INRIA, Paris, France, June 2017.

Miscellaneous

  • I have a qualification from 2018 to be maître de conférence in Section 27 (Computer Science).
  • If you are trying to explain cryptography to non-scientists, you may want to have a look at the material I contributed to while I was in Luxembourg (available on the cryptolux wiki).
  • I rely on emacs a lot in my day-to-day work. In fact, I write this page as an org document which is then exported to HTML. The CSS is the excellent and easy to setup ReadTheOrg by Fabrice Niessen. It is on github.
  • My Erdos number is equal to 3.

Author: Leo Perrin

Created: 2019-03-23 sam. 09:50

Emacs 24.5.1 (Org mode 8.2.5a)

Validate