A provably quasi-polynomial algorithm for the discrete logarithm problem in finite fields of small characteristic

Documenti analoghi

• Generating random factorisations of polynomial values
  di: Badziahin, Dmitry
  Pubblicazione: (2025)
• Maximal curves over finite fields and a modular isogeny
  di: Dose, Valerio, et al.
  Pubblicazione: (2025)
• Two Absolutely Irreducible Polynomials over $\Bbb F_2$ and Their Applications to a Conjecture by Carlet
  di: Hou, Xiang-dong, et al.
  Pubblicazione: (2025)
• Rationality of Four-Valued Families of Weil Sums of Binomials
  di: Katz, Daniel J., et al.
  Pubblicazione: (2023)
• A Compact Post-quantum Strong Designated Verifier Signature Scheme from Isogenies
  di: Renan, Farzin
  Pubblicazione: (2025)