Description
I will report on some first attempts to do isogeny-based cryptography in genus 2. More precisely, we will use isogeny graphs of superspecial principally polarized abelian surfaces over GF(p^2) for constructing variants of Charles, Goren and Lauter's hash function and of Jao and De Feo's SIDH key exchange protocol, both of which use supersingular elliptic curves over GF(p^2). This will be largely based on joint work with Thomas Decru and Benjamin Smith.<br/> lien: http://desktop.visio.renater.fr/scopia?ID=722850***3761&autojoin
Prochains exposés
-
Comprehensive Modelling of Power Noise via Gaussian Processes with Applications to True Random Number Generators
Orateur : Maciej Skorski - Laboratoire Hubert Curien
The talk examines power noise modelling through Gaussian Processes for secure True Random Number Generators. While revisiting one-sided fractional Brownian motion, we obtain novel contributions by quantifying posterior uncertainty in exact analytical form, establishing quasi-stationary properties, and developing rigorous time-frequency analysis. These results are applied to model oscillator[…]-
Cryptography
-
TRNG
-
-
CryptoVerif: a computationally-sound security protocol verifier
Orateur : Bruno Blanchet - Inria
CryptoVerif is a security protocol verifier sound in the computational model of cryptography. It produces proofs by sequences of games, like those done manually by cryptographers. It has an automatic proof strategy and can also be guided by the user. It provides a generic method for specifying security assumptions on many cryptographic primitives, and can prove secrecy, authentication, and[…]-
Cryptography
-