Explicit cost analysis of Toom-4 multiplication for incomplete NTT in lattice-based cryptography

Documenti analoghi

• Polynomial XL: A Variant of the XL Algorithm Using Macaulay Matrices over Polynomial Rings
  di: Furue, Hiroki, et al.
  Pubblicazione: (2021)
• The solving degrees for computing Gröbner bases of affine semi-regular polynomial sequences
  di: Kudo, Momonari, et al.
  Pubblicazione: (2024)
• Computing a Group Action from the Class Field Theory of Imaginary Hyperelliptic Function Fields
  di: Leudière, Antoine, et al.
  Pubblicazione: (2022)
• Computing Isomorphisms between Products of Supersingular Elliptic Curves
  di: Gaudry, Pierrick, et al.
  Pubblicazione: (2025)
• Some explicit arithmetic on curves of genus three and their applications
  di: Moriya, Tomoki, et al.
  Pubblicazione: (2022)