Communication publiée dans un ouvrage (Colloques, congrès, conférences scientifiques et actes)
Generalized Feistel Ciphers for Efficient Prime Field Masking
Grassi, Lorenzo; Masure, Loïc; MEAUX, Pierrick et al.
2024In Joye, Marc (Ed.) Advances in Cryptology – EUROCRYPT 2024 - 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings
Peer reviewed
 

Documents


Texte intégral
2024-431.pdf
Postprint Auteur (1.07 MB)
Télécharger

Tous les documents dans ORBilu sont protégés par une licence d'utilisation.

Envoyer vers



Détails



Mots-clés :
Block ciphers; Feistel ciphers; Generalized feistel; Generalized Feistel structure; In contexts; Lower noise; Non linear; Prime field; Side-channel attacks; Square operations; Theoretical Computer Science; Computer Science (all)
Résumé :
[en] A recent work from Eurocrypt 2023 suggests that prime-field masking has excellent potential to improve the efficiency vs. security tradeoff of masked implementations against side-channel attacks, especially in contexts where physical leakages show low noise. We pick up on the main open challenge that this seed result leads to, namely the design of an optimized prime cipher able to take advantage of this potential. Given the interest of tweakable block ciphers with cheap inverses in many leakage-resistant designs, we start by describing the FPM (Feistel for Prime Masking) family of tweakable block ciphers based on a generalized Feistel structure. We then propose a first instantiation of FPM, which we denote as small-pSquare. It builds on the recent observation that the square operation (which is non-linear in Fp) can lead to masked gadgets that are more efficient than those for multiplication, and is tailored for efficient masked implementations in hardware. We analyze the mathematical security of the FPM family of ciphers and the small-pSquare instance, trying to isolate the parts of our study that can be re-used for other instances. We additionally evaluate the implementation features of small-pSquare by comparing the efficiency vs. security tradeoff of masked FPGA circuits against those of a state-of-the art binary cipher, namely SKINNY, confirming significant gains in relevant contexts.
Disciplines :
Sciences informatiques
Auteur, co-auteur :
Grassi, Lorenzo;  Ruhr University Bochum, Bochum, Germany
Masure, Loïc;  LIRMM, Univ. Montpellier, CNRS, Montpellier, France
MEAUX, Pierrick  ;  University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > PI Coron
Moos, Thorben;  Crypto Group, ICTEAM Institute, UCLouvain, Louvain-la-Neuve, Belgium
Standaert, François-Xavier;  Crypto Group, ICTEAM Institute, UCLouvain, Louvain-la-Neuve, Belgium
Co-auteurs externes :
yes
Langue du document :
Anglais
Titre :
Generalized Feistel Ciphers for Efficient Prime Field Masking
Date de publication/diffusion :
2024
Nom de la manifestation :
Eurocrypt
Lieu de la manifestation :
Zurich, Che
Date de la manifestation :
26-05-2024 => 30-05-2024
Titre de l'ouvrage principal :
Advances in Cryptology – EUROCRYPT 2024 - 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings
Editeur scientifique :
Joye, Marc
Maison d'édition :
Springer Science and Business Media Deutschland GmbH
ISBN/EAN :
978-3-03-158733-7
Peer reviewed :
Peer reviewed
N° du Fonds :
ERC Advanced Grant 787390
Subventionnement (détails) :
Lorenzo Grassi was supported by the German Research Foundation (DFG) within the framework of the Excellence Strategy of the Federal Government and the States \u2013 EXC 2092 CaSa \u2013 39078197. Pierrick Méaux was supported by the ERC Advanced Grant 787390. Fran\u00E7ois-Xavier Standaert is a senior research associate of the Belgian Fund for Scientific Research (FNRS-F.R.S.). This work has been funded in parts by the ERC Advanced Grant 101096871. Views and opinions expressed are those of the authors only and do not necessarily reflect those of the European Union or the ERC. Neither the European Union nor the granting authority can be held responsible for them.
Disponible sur ORBilu :
depuis le 07 novembre 2024

Statistiques


Nombre de vues
103 (dont 6 Unilu)
Nombre de téléchargements
61 (dont 0 Unilu)

citations Scopus®
 
3
citations Scopus®
sans auto-citations
2
OpenCitations
 
0
citations OpenAlex
 
2
citations WoS
 
1

Bibliographie


Publications similaires



Contacter ORBilu