Filter by content type
Select one or more filters. This choice will reload the page to display the filtered results.
689 results
-
-
Seminar
-
SemSecuElec
Passage à l’échelle des campagnes de simulations d’injections de fautes
Speaker : Ambre Iooss - Synacktiv
Les injections de fautes constituent un vecteur d’attaque intéressant pour passer outre certaines protections lors de l’étude d’un système embarqué. Par exemple, corrompre le flot d’exécution d’un chargeur de démarrage peut permettre de passer outre une vérification de signature, et peut rendre possible l’exécution de code non signé. Dans le cas d’une exécution comportant un grand nombre d[…]-
SemSecuElec
-
Fault injection
-
-
-
Seminar
-
Cryptography
Structured-Seed Local Pseudorandom Generators and their Applications
Speaker : Nikolas Melissaris - IRIF
We introduce structured‑seed local pseudorandom generators (SSL-PRGs), pseudorandom generators whose seed is drawn from an efficiently sampleable, structured distribution rather than uniformly. This seemingly modest relaxation turns out to capture many known applications of local PRGs, yet it can be realized from a broader family of hardness assumptions. Our main technical contribution is a[…]-
Cryptography
-
-
-
Conference
-
Side-channel
-
Fuzzing
-
Protocols
-
Security policies
-
Vulnerability management
-
Embedded systems
Conférence sur la sécurité couche physique protocolaire
-
-
CREACH LABS, partner of the 2025 European Cyber Week
We will be present at the 10th edition of the European Cyber Week 2025! Join us on November 19-20, 2025, at the Couvent des Jacobins in Rennes.September 30, 2025 -
-
Conference
BITFLIP 2025 : CyBer, reliability and Tolerance of FauLts in electronic components
Following the success of the first edition of the “BITFLIP by DGA” conference (CyBer, reliability and Tolerance of FauLts in electronic components) in 2023, CREACH LABS in partnership with the DGA Information Superiority is organizing the second edition of BITFLIP during the European Cyber Week 2025. -
-
-
Seminar
-
Cryptography
Wagner’s Algorithm Provably Runs in Subexponential Time for SIS^∞
Speaker : Johanna Loyer - Inria Saclay
At CRYPTO 2015, Kirchner and Fouque claimed that a carefully tuned variant of the Blum-Kalai-Wasserman (BKW) algorithm (JACM 2003) should solve the Learning with Errors problem (LWE) in slightly subexponential time for modulus q = poly(n) and narrow error distribution, when given enough LWE samples. Taking a modular view, one may regard BKW as a combination of Wagner’s algorithm (CRYPTO 2002), run[…]-
Cryptography
-