Teguia Nasser, PhD student at the University of Yaounde 1
Title: CSIDH and some applications (case study of ISOGA).
Date: November 7, 2023 Abstract
NKENFACK Michael, Master student at Ecole Nationale Supérieure Polytechnique de Yaoundé (ENSPY)
Title: Attaques par Injection de Fautes Lasers sur le cryptosystème de McEliece
Date: October 24, 2023 Abstract
Freddy Metouke, PhD student at the university of Yaound 1
Title: Subspace subcodes codes of generalized gabidulin codes.
Date: October 17, 2023 Abstract
Gustave TCHOFFO SAAH, PhD student at the University of Yaounde 1.
Title: Avoiding trusted setup in Isogeny-based commitments
Date: October 10; 2023 Abstract: available here
Slides:
Title: Introduction a la theorie des codes correcteurs d'erreurs
Date: March 15, 2022 Slides: link
Title: Famille de reseau pour un rayon de decodage proche de la borne de Minkowski
Date: March 01, 2022 Slides: link
Title: A New Adaptive attack on SIDH
Date: February 15, 2022 Slides: link
Title: Attaques de SIDH par reconnaissance des images des points de torsion
Date: January 18, 2022 Slides: link
Title: The number field sieve in DLP and its variants.
Date: January 04, 2022
Title: Elliptic Nets over the Edwards Model of Elliptic Curves
Date: November 23, 2021 Abstract: see below
Abstract
An elliptic net is a map defined from a free finitely-generated abelian group A to an integral domain R that satisfies a certain non-linear recurrence relation. In this work, we propose elliptic nets of rank 1 called elliptic divisibility sequences on the Edwards model of elliptic curves. We then derive the elliptic nets in that Edwards model of elliptic curves. Finally, we give the properties of that elliptic and particularly in rank 2 for further optimisation in the pairing computation based cryptography.
Keywords: Elliptic Divisibility Sequence, Elliptic nets, Division polynomial, Edwards Curves
Title: Efficient endomorphisms for computing pairings
Date: November 16, 2021 Abstract: link
Title: On the failure of the smart approach of the GPT cryptosystem
Date: November 2, 2021 Abstract: see below Slides: link
In this talk, we will talk a bit about the GPT cryptosystem (which is a rank-metric based cryptosystem) and its security. More precisely, we will present a new algorithm for breaking the smart approach of the GPT cryptosystem. We show that by puncturing the public code several times on specific positions, we get a public code on which applying the Frobenius operator appropriately allows to build an alternative secret key in polynomial time.
Title: The CGL hash function
Date: October 19, 2021 Abstract: link
Title: Sieve Algorithm for Random and Orthogonal Lattices
Date: September 21, 2021 Abstract: link
Title: Efficient computation of the final exponentiation in pairing based cryptography
Title: An overview of CSIDH Date: August 14, 2020
Title: An overview of SIDH Date: August 12, 2020