Description
Until recently, the best known algorithm for solving a Discrete Logarithm Problem (DLP) in the Jacobian of a hyperelliptic genus 3 curve ran in time \softO(q^(4/3)), while the best known algorithm for non-hyperelliptic genus 3 curves ran in time \softO(q). In this talk, we describe an efficient algorithm for moving instances of the DLP from a hyperelliptic genus 3 Jacobian to a non-hyperelliptic Jacobian, by means of an explicit isogeny. This allows us to solve the DLP on a large class of hyperelliptic genus 3 Jacobians in time \softO(q).
Next sessions
-
Key Attack on the ACDGV Matrix Encryption Scheme
Speaker : Anmoal Porwal - Technical University of Munich
I will present our key-recovery attack on the ACDGV public-key encryption scheme proposed at ASIACRYPT 2024 by Aragon, Couvreur, Dyseryn, Gaborit, and Vinçotte. The secret key is a Gabidulin code hidden by appending random rows and columns and by left- and right-multiplication with invertible matrices. Our attack exploits the resulting algebraic structure to recover an equivalent secret key. It[…]-
Cryptography
-
Asymmetric primitive
-
-
Module Learning With Errors and Structured Extrapolated Dihedral Cosets
Speaker : Jinwei Zheng - Télécom Paris
The Module Learning With Errors (MLWE) problem is the fundamental hardness assumption underlying the key encapsulation and signature schemes ML-KEM and ML-DSA, which have been selected by NIST for post-quantum cryptography standardization. Understanding its quantum hardness is crucial for assessing the security of these standardized schemes. Inspired by the equivalence between LWE and[…]-
Cryptography
-