2019/08/08 by Helal Ahmed, Ahmed, Md. Helal, Jagmohan Tanti +3
Computer Science · Mathematics · #Algebraic Geometry and Number Theory #Analytic Number Theory Research #Coding theory and cryptography #Cryptography and Security (cs.CR) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Number Theory (math.NT) #Rings and Algebras (math.RA)
paper · pdf · doi:10.48550/arxiv.1908.04263
openalex publication_date 2019/08/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper, we present the fast computational algorithms for the Jacobi sums of orders l2 and 2l2 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.