A variant of the large sieve inequality with explicit constants
We give an effective version with explicit constants of the large sieve inequality for imaginary quadratic fields. Explicit results of this kind are useful for estimating the computational complexity of algorithms which generate elements, whose norm is a rational prime, in an arithmetic progression...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2020-08-01
|
| Series: | Journal of Mathematical Cryptology |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/jmc-2019-0022 |
| _version_ | 1818002368340426752 |
|---|---|
| author | Grześkowiak Maciej |
| author_facet | Grześkowiak Maciej |
| author_sort | Grześkowiak Maciej |
| collection | DOAJ |
| description | We give an effective version with explicit constants of the large sieve inequality for imaginary quadratic fields. Explicit results of this kind are useful for estimating the computational complexity of algorithms which generate elements, whose norm is a rational prime, in an arithmetic progression of the corresponding ring of integers. |
| first_indexed | 2024-04-14T03:44:56Z |
| format | Article |
| id | doaj.art-4007a51c22e146f99af81987d36ee03b |
| institution | Directory Open Access Journal |
| issn | 1862-2976 1862-2984 |
| language | English |
| last_indexed | 2024-04-14T03:44:56Z |
| publishDate | 2020-08-01 |
| publisher | De Gruyter |
| record_format | Article |
| series | Journal of Mathematical Cryptology |
| spelling | doaj.art-4007a51c22e146f99af81987d36ee03b2022-12-22T02:14:18ZengDe GruyterJournal of Mathematical Cryptology1862-29761862-29842020-08-0114130731510.1515/jmc-2019-0022jmc-2019-0022A variant of the large sieve inequality with explicit constantsGrześkowiak Maciej0Adam Mickiewicz University, Faculty of Mathematics and Computer Science, Umultowska 87, 61-614, Poznań, PolandWe give an effective version with explicit constants of the large sieve inequality for imaginary quadratic fields. Explicit results of this kind are useful for estimating the computational complexity of algorithms which generate elements, whose norm is a rational prime, in an arithmetic progression of the corresponding ring of integers.https://doi.org/10.1515/jmc-2019-0022lage sievecomputational complexity of algorithms11l4011n3668q25 |
| spellingShingle | Grześkowiak Maciej A variant of the large sieve inequality with explicit constants Journal of Mathematical Cryptology lage sieve computational complexity of algorithms 11l40 11n36 68q25 |
| title | A variant of the large sieve inequality with explicit constants |
| title_full | A variant of the large sieve inequality with explicit constants |
| title_fullStr | A variant of the large sieve inequality with explicit constants |
| title_full_unstemmed | A variant of the large sieve inequality with explicit constants |
| title_short | A variant of the large sieve inequality with explicit constants |
| title_sort | variant of the large sieve inequality with explicit constants |
| topic | lage sieve computational complexity of algorithms 11l40 11n36 68q25 |
| url | https://doi.org/10.1515/jmc-2019-0022 |
| work_keys_str_mv | AT grzeskowiakmaciej avariantofthelargesieveinequalitywithexplicitconstants AT grzeskowiakmaciej variantofthelargesieveinequalitywithexplicitconstants |