Computation of Jacobi sums of order l^2 and 2l^2 with prime l

Abstract

In this paper, we present the fast computational algorithms for the Jacobi sums of orders $l^2$ and $2l^2$ with odd prime $l$ by formulating them in terms of the minimum number of cyclotomic numbers of the corresponding orders. We also implement two additional algorithms to validate these formulae, which are also useful for the demonstration of the minimality of cyclotomic numbers required.

References in corpus (1)

• Computation of Jacobi sums and cyclotomic numbers with reduced complexity