Description
The correspondence between maximal orders in a quaternion algebra and supersingular elliptic curves has uncovered new perspectives in the field of isogeny-based cryptography. The KLPT algorithm of Kohel et al. in 2014 introduces an algorithm solving the quaternion isogeny path problem in polynomial time. Studying this problem has applications both constructive and destructive. It has allowed to reduce the problem of computing isogenies between two curves to the one of endomorphism ring computation. The GPS signature scheme from Galbraith et al. in 2017 was built on this algorithm.<br/> The main algorithm of KLPT solves the problem when the maximal order is special extremal. The paper also proposes a generalized version, but it produces an output with some very characteristic property that prevent from using it in some applications, like a generalization of the GPS signature. In this work, we propose a new method to generalize the algorithm. It produces a shorter solution with the same time complexity and without the problematic property.<br/> lien: https://e-learning.sviesolutions.com/pffi7slpuumw
Prochains exposés
-
SoK: Security of the Ascon Modes
Orateur : Charlotte Lefevre - Radboud University
The Ascon authenticated encryption scheme and hash function of Dobraunig et al (Journal of Cryptology 2021) were recently selected as winner of the NIST lightweight cryptography competition. The mode underlying Ascon authenticated encryption (Ascon-AE) resembles ideas of SpongeWrap, but not quite, and various works have investigated the generic security of Ascon-AE, all covering different attack[…] -
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
-