scientific article; zbMATH DE number 799779

zbMath0829.11065MaRDI QIDQ4847930

Sergei Evdokimov

Publication date: 24 September 1995

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

finite fieldshyperelliptic curvesdeterministic algorithmdiscrete logarithms

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)

Related Items (9)

Using partial smoothness of 𝑝-1 for factoring polynomials modulo 𝑝 ⋮ Deterministic root finding over finite fields using Graeffe transforms ⋮ Homomorphic polynomial public key encapsulation over two hidden rings for quantum-safe key encapsulation ⋮ Factoring polynomials over special finite fields ⋮ Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes ⋮ Unnamed Item ⋮ Permutation group approach to association schemes ⋮ Trading GRH for algebra: Algorithms for factoring polynomials and related structures ⋮ A Generalised Successive Resultants Algorithm

This page was built for publication: