Filtrer par type de contenu
Sélectionnez un ou plusieurs filtres. Ce choix permettra de recharger la page pour afficher les résultats filtrés.
766 résultats
-
-
Séminaire
-
Cryptographie
Finding short integer solutions when the modulus is small
Orateur : Eamonn Postlethwaite - King's College London
We present cryptanalysis of the inhomogenous short integer solution (ISIS) problem for anomalously small moduli by exploiting the geometry of BKZ reduced bases of q-ary lattices. We apply this cryptanalysis to examples from the literature where taking such small moduli has been suggested. A recent work [Espitau–Tibouchi–Wallet–Yu, CRYPTO 2022] suggests small versions of the lattice signature[…] -
-
-
Séminaire
-
Cryptographie
Quantum Linear Key-recovery Attacks Using the QFT
Orateur : André Schrottenloher - IRISA
The Quantum Fourier Transform is a fundamental tool in quantum cryptanalysis, not only as the building block of Shor's algorithm, but also in attacks against symmetric cryptosystems. Indeed, hidden shift algorithms such as Simon's (FOCS 1994), which rely on the QFT, have been used to obtain attacks on some very specific block cipher structures. The Fourier Transform is also used in classical[…] -
-
-
Séminaire
-
Cryptographie
TBD (To be decided closer to the date of the talk)
Orateur : Lisa Kohl - CWI
TBD (To be decided closer to the date of the talk) -
-
-
Groupe de travail
Modélisation statistique et sécurité des générateurs d'aléa pour la cryptographie
Orateur : David Lubicz - DGA, IRMAR
Dans cet exposé on essaie d'expliquer ce que l'on entend pas méthodes statistiques et on donne des exemples concrets d'application dans la cybersécurité.-
Cryptography
-
-
-
Groupe de travail
Analyse statistique des extrêmes pour la modélisation d'évènements rares ou atypiques
Orateur : Gilles Stupfler - ENSAI
-
-
-
Séminaire
-
SoSysec
A Compositional and Complete approach to Verifying Privacy Properties using the Applied Pi-calculus
Orateur : Ross Horne (University of Luxembourg)
The pi-calculus was introduced for verifying cryptographic protocols by Abadi and Fournet in 2001. They proposed an equivalence technique, called bisimilarity, useful for verify privacy properties. It is widely acknowledged (cf. Paige and Tarjan 1987), that bisimilarity is more efficient to check than trace equivalence; however, surprisingly, tools based on the applied pi-calculus typically still[…] -