Yann Rotella
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Yann Rotella has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Christina Boura
Université Paris-Saclay, Université de Versailles, Centre National de la Recherche Scientifique (CNRS), Laboratoire de mathématiques de Versailles, 78000, Versailles, France
3 shared publications - Margot Funk
Université Paris-Saclay, UVSQ, CNRS, Laboratoire de Mathématiques de Versailles
2 shared publications - Christina Boura
IRIF, CNRS, Université Paris Cité, Paris, France
1 shared publication - Christof Beierle
Ruhr University Bochum
1 shared publication - David Rupprecht
Radix Security, Bochum, Germany
1 shared publication - Gaëtan Leurent
INRIA
1 shared publication
Latest Publications
- Open Access
- 25 September 2025
- Published by Universitatsbibliothek der Ruhr-Universitat Bochum in IACR Transactions on Symmetric Cryptology
- Vol. 2025 (3) , 289-336
SoK: On Shallow Weak PRFs
A growing number of advanced cryptographic protocols and constructions rely on symmetric primitives known as weak pseudo-random functions (wPRFs). These functions differ significantly from traditional PRFs: they operate in constrained models where inputs are sampled uniformly at random and are not chosen by the adversary. In practice, many of these functions are implemented as shallow, non-iterated constructions with simple circuit representations.This Systematization of Knowledge (SoK) provides a unified view of shallow wPRFs (swPRFs), which we define as wPRFs computable by low-depth circuits and primarily used in different secure computation protocols. We identify and classify four main families of swPRFs—alternating moduli wPRFs, Goldreich’s PRG family, and the VDLPN and EALPN constructions—presenting formal definitions, algorithmic descriptions, known variants, cryptanalytic results, and concrete parameter sets for each.In addition to surveying the literature, our goal is to shift the focus from asymptotic analyses to concrete cryptanalysis. To this end, we provide a set of cryptanalytic challenges along with reference SAGE implementations for all the primitives discussed. We aim to encourage the symmetric cryptography community—particularly cryptanalysts— to rigorously evaluate the practical security levels offered by swPRFs, as concrete analyses are currently lacking. Given their growing use in high-level protocols and constructions, any cryptanalytic breakthrough on these primitives could directly affect the security of the broader cryptographic systems that rely on them.
- 25 September 2025
- Published by Universitatsbibliothek der Ruhr-Universitat Bochum in IACR Transactions on Symmetric Cryptology
- Vol. 2025 (3) , 289-336
Open AccessSoK: On Shallow Weak PRFs
A growing number of advanced cryptographic protocols and constructions rely on symmetric primitives known as weak pseudo-random functions (wPRFs). These functions differ significantly from traditional PRFs: they operate in constrained models where inputs are sampled uniformly at random and are not chosen by the adversary. In practice, many of these functions are implemented as shallow, non-iterated constructions with simple circuit representations.This Systematization of Knowledge (SoK) provides a unified view of shallow wPRFs (swPRFs), which we define as wPRFs computable by low-depth circuits and primarily used in different secure computation protocols. We identify and classify four main families of swPRFs—alternating moduli wPRFs, Goldreich’s PRG family, and the VDLPN and EALPN constructions—presenting formal definitions, algorithmic descriptions, known variants, cryptanalytic results, and concrete parameter sets for each.In addition to surveying the literature, our goal is to shift the focus from asymptotic analyses to concrete cryptanalysis. To this end, we provide a set of cryptanalytic challenges along with reference SAGE implementations for all the primitives discussed. We aim to encourage the symmetric cryptography community—particularly cryptanalysts— to rigorously evaluate the practical security levels offered by swPRFs, as concrete analyses are currently lacking. Given their growing use in high-level protocols and constructions, any cryptanalytic breakthrough on these primitives could directly affect the security of the broader cryptographic systems that rely on them.
- 12 May 2024
- Published by Springer Nature
- p. 96-115
Differential Analysis of the Ternary Hash Function Troika
- 12 May 2024
- Published by Springer Nature
- p. 96-115
Differential Analysis of the Ternary Hash Function Troika
- Open Access
Differential analysis of the ternary hash function Troika
Come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.
Open AccessDifferential analysis of the ternary hash function Troika
Come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.
- 9 August 2023
- Published by Springer Nature
- p. 607-627
On the Security of Keyed Hashing Based on Public Permutations
- 9 August 2023
- Published by Springer Nature
- p. 607-627
On the Security of Keyed Hashing Based on Public Permutations
- 16 June 2021
- Published by Springer Nature
- p. 155-183
Cryptanalysis of the GPRS Encryption Algorithms GEA-1 and GEA-2
- 16 June 2021
- Published by Springer Nature
- p. 155-183
Cryptanalysis of the GPRS Encryption Algorithms GEA-1 and GEA-2