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

Autor:	Ahmed, Md. Helal, Tanti, Jagmohan, Pushp, Sumant
Rok vydání:	2019
Předmět:	Mathematics - Number Theory Computer Science - Cryptography and Security Computer Science - Data Structures and Algorithms Mathematics - Rings and Algebras
Druh dokumentu:	Working Paper
Popis:	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.
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1908.04263 Zobrazit plný text záznamu View this record from Arxiv