Description
Kedlaya described an algorithm for computing the zeta function of a hyperelliptic curve in characteristic p > 2 using the theory of Monsky-Washnitzer cohomology. Joint work with Jan Denef has resulted in 2 extensions of Kedlaya's original algorithm: the first extension can be used to compute the zeta function of a hyperelliptic curve in characteristic 2 and the second leads to a rather general method which works for any C_ab curve in any small characteristic. Furthermore, results obtained with an implemtation of both algorithms will be presented.
Prochains exposés
-
MIKE: An efficient and compact NIKE Based on a Commutative Monoidal Action
Orateur : Jonathan Komada Eriksen - COSIC, KU Leuven
Robert recently described a powerful correspondence between certain (Hermitian) modules and (polarized) abelian varieties, which simultaneously generalizes both the class-group action underlying protocols such as CSIDH, and the Deuring correspondence, underlying protocols such as SQIsign. Using this correspondence, he also proposed how to construct a post-quantum NIKE, called MIKE, which, at a[…]-
Cryptography
-
-
TBA
Orateur : Anmoal Porwal - Technical University of Munich
-
Cryptography
-
Asymmetric primitive
-