Many Rational Points: Coding Theory and Algebraic Geometry by N.E. Hurt (English
123,72 €
Applications of abelian varieties to cryptography are presented including a discussion of hyperelliptic curve cryptosystems. REFERENCES 317 345 Index Xll Preface The history of counting points on curves over finite fields is very ex tensive, starting with the work of Gauss in 1801 and continuing with the work of Artin, Schmidt, Hasse and Weil in their study of curves and the related zeta functions Zx(t), where m Zx(t) = exp (2: N t ) m m 2': 1 m with N = #X(F qm).
Jetzt bei Ebay:
