Jacobi Sums, Irreducible Zeta-Polynomials, and Cryptography
Canadian mathematical bulletin, Tome 34 (1991) no. 2, pp. 229-235
Voir la notice de l'article provenant de la source Cambridge
We find conditions under which the numerator of the zeta-function of the curve y2+y = xd over Fp , where d — 2g +1 is a prime, d ≠ p, is irreducible over Q. This leads to the generalized Mersenne problem of "almost primality" of the number of points on the jacobian of such a curve over an extension of F p, which has application to public key cryptography.
Koblitz, Neal. Jacobi Sums, Irreducible Zeta-Polynomials, and Cryptography. Canadian mathematical bulletin, Tome 34 (1991) no. 2, pp. 229-235. doi: 10.4153/CMB-1991-037-6
@article{10_4153_CMB_1991_037_6,
author = {Koblitz, Neal},
title = {Jacobi {Sums,} {Irreducible} {Zeta-Polynomials,} and {Cryptography}},
journal = {Canadian mathematical bulletin},
pages = {229--235},
year = {1991},
volume = {34},
number = {2},
doi = {10.4153/CMB-1991-037-6},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1991-037-6/}
}
Cité par Sources :