Deterministic Encoding and Hashing to Odd Hyperelliptic Curves

this subsetion, we dene the `-th mo dular equation of a genus g hyp erellipti urve.. C dened

of disrete logarithms in the Jaobian of hyperellipti urves dened.. over

Equation (1) was first introduced in [CE15] for genus two curves defined over finite fields of odd characteristic and solved in [KPR20] using a well-designed algorithm based on a

Given two points P, Q of Xo(N) such that w(P) ^ Q, due to the fact that X^ has genus zero, there exists a function F on X^ such that di\x F is (0) - (P).. On the other hand,

The common point to Kostant’s and Steinberg’s formulae is the function count- ing the number of decompositions of a root lattice element as a linear combination with

For security reasons, and also because Boolean functions need also to have other properties than nonlinearity such as balancedness or high algebraic degree, it is important to have

On s’intéresse à l’étude de ces équations le cas où les coefficients ne vérifient pas la condition de Lipschits ; précisément dans le cas où les coefficients sont

We have also sketched families of higher genus hyperelliptic curves whose deterministic algebraic parameterization is based on solvable polynomials of higher degree arising from