Add to Quick Collection
All 2 Results
Showing items 1 - 2 of 2.
Add All Items to Quick Collection
Source: Прикладная дискретная математика. 2017. № 37. С. 20-31
Type: статьи в журналах
Date: 2017
Description:
Using hyperelliptic curves in cryptography requires the computation of the Jacobian order of a curve. This is equivalent to computing the characteristic polynomial of Frobenius x(A) e Z[A|. By calcula
... More
Source: Прикладная дискретная математика. Приложение.. 2017. № 10. С. 29-32
Type: статьи в журналах
Date: 2017
Description:
We investigate the hyperelliptic curves of the form C1 : y2 = x2g+1 + ax9+1 + bx and C2 : y2 = x2g+2 + ax9+1 + b over the finite field Fq, q = pn, p > 2. We transform these curves to the form C1,p : y
... More
