Lattice basis reduction, Jacobi sums and hyperelliptic cryptosystems-Reference-Cited by-同舟云学术

Lattice basis reduction, Jacobi sums and hyperelliptic cryptosystems

Published:1998-08 Issue:1 Volume:58 Page:147-154
ISSN:0004-9727
Container-title:Bulletin of the Australian Mathematical Society
language:en
Short-container-title:Bull. Austral. Math. Soc.

Author:

Buhler Joe,Koblitz Neal

Abstract

Using the LLL-algorithm for finding short vectors in lattices, we show how to compute a Jacobi sum for the prime field Fp in Q(e2πi/n) in time O(log3p), where n is small and fixed, p is large, and p = 1 (mod n). This result is useful in the construction of hyperelliptic cryptosystems.

Publisher

Cambridge University Press (CUP)

Subject

General Mathematics

Reference11 articles.

1. Numbers of solutions of equations in finite fields

2. Reducing elliptic curve logarithms to logarithms in a finite field

3. Factoring polynomials with rational coefficients

4. Hyperelliptic cryptosystems

5. A Classical Introduction to Modern Number Theory

Cited by 31 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Complete congruences of Jacobi sums of order $$2l^{2}$$ with prime l;The Ramanujan Journal;2022-06-06

2. Computation of Jacobi sums of orders $${\varvec{l}}^\mathbf{2}$$ and $$\mathbf{2}{\varvec{l}}^\mathbf{2}$$ with odd prime l;Indian Journal of Pure and Applied Mathematics;2022-05-20

3. GLV/GLS Scalar Multiplication on Twisted Edwards Curves;Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering;2022

4. Fast scalar multiplication of degenerate divisors for hyperelliptic curve cryptosystems;Applied Mathematics and Computation;2021-09

5. A Family of Subfield Hyperelliptic Curves for Use in Cryptography;Information and Communications Security;2020