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

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 fo...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Md Helal Ahmed, Tanti, Jagmohan, Pushp, Sumant
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 25.11.2019
Subjects
Algorithms
Sums
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2331-8422