2019
DOI: 10.48550/arxiv.1908.04263
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

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

Abstract: In this article, we present fast computational algorithms for Jacobi sums of orders l 2 and 2l 2 with odd prime l. Cyclotomic numbers play a crucial rule in implementing these algorithms. To increase efficiency, we present explicit expressions for Jacobi sums of orders l 2 and 2l 2 in terms of the minimum number of cyclotomic numbers of order l 2 and 2l 2 respectively, which will be utilized in implementing the algorithms. To validate these expressions, we implement two additional algorithms which demonstrate … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 23 publications
(42 reference statements)
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?