640 results
-
Comprendre le générateur sac-à-dos (et améliorer les attaques contre lui) / Understanding the Knapsack generator (and improving the attacks against it)
Speaker : Florette Martinez - Université Picardie Jules Verne
Résumé : Le générateur sac-à-dos, présenté en 1985 est un générateur pseudo aléatoire annoncé sécurisé qui combine un générateur pseudo aléatoire non sécurisé et un problème dur. Une erreur de design repérée en 2011 permet à W. Meier et S. Knellwolf de retrouver une partie du secret mais les explications théoriques et heuristiques sont partielles. Dans cet exposé, je vais présenter une nouvelle[…] -
PHOENIX : the first crypto-agile hardware solution for ML-KEM and HQC
Speaker : Antonio RAS
The security of the public-key cryptography protecting today and tomorrow's communication is threatened by the advent of quantum computers. To address this challenge, post-quantum cryptography is employed to devise new quantum-resistant cryptosystems. The National Institute of Standards and Technology (NIST), which led the quantum-safe transition, has already standardized the first lattice KEM[…]-
Cryptography
-
SemSecuElec
-
Hardware accelerator
-
-
Advanced techniques for fault injection attacks on integrated circuits
Speaker : Paul Grandamme - Laboratoire Hubert Curien, Université Jean Monnet
The security of integrated circuits is evaluated through the implementation of attacks that exploit their inherent hardware vulnerabilities. Fault injection attacks represent a technique that is commonly employed for this purpose. These techniques permit an attacker to alter the nominal operation of the component in order to obtain confidential information. Firstly, we propose the utilisation of[…]-
SemSecuElec
-
Fault injection
-
-
Cycles of pairing-friendly abelian varieties
Speaker : Maria Corte-Real Santos - ENS Lyon
A promising avenue for realising scalable proof systems relies on the existence of 2-cycles of pairing-friendly elliptic curves. More specifically, such a cycle consists of two elliptic curves E/Fp and E’/Fq that both have a low embedding degree and also satisfy q = #E(Fp) and p = #E’(Fq). These constraints turn out to be rather restrictive; in the decade that has passed since 2-cycles were first[…]-
Cryptography
-
-
Circuit optimisation problems in the context of homomorphic encryption
Speaker : Sergiu Carpov - Arcium
Fully homomorphic encryption (FHE) is an encryption scheme that enables the direct execution of arbitrary computations on encrypted data. The first generation of FHE schemes began with Gentry's groundbreaking work in 2019. It relies on a technique called bootstrapping, which reduces noise in FHE ciphertexts. This construction theoretically enables the execution of any arithmetic circuit, but[…]