Computation of Jacobi sums of order l^2 and 2l^2 with prime l
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2019
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913491067076608 |
|---|---|
| author | Ahmed, Md. Helal Tanti, Jagmohan Pushp, Sumant |
| author_facet | Ahmed, Md. Helal Tanti, Jagmohan Pushp, Sumant |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1908_04263 |
| institution | arXiv |
| publishDate | 2019 |
| record_format | arxiv |
| spellingShingle | Computation of Jacobi sums of order l^2 and 2l^2 with prime l Ahmed, Md. Helal Tanti, Jagmohan Pushp, Sumant Number Theory Cryptography and Security Data Structures and Algorithms Rings and Algebras 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. |
| title | Computation of Jacobi sums of order l^2 and 2l^2 with prime l |
| topic | Number Theory Cryptography and Security Data Structures and Algorithms Rings and Algebras |
| url | https://arxiv.org/abs/1908.04263 |