A variant of the large sieve inequality with explicit constants

DOI10.1515/jmc-2019-0022zbMath1459.11183OpenAlexW3080733705MaRDI QIDQ2023311

Maciej Grześkowiak

Publication date: 3 May 2021

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/jmc-2019-0022

zbMATH Keywords

large sievecomputational complexity of algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of sieve methods (11N36) Estimates on character sums (11L40)

Uses Software

• ECPP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Building curves with arbitrary small MOV degree over finite prime fields
• Large sieve methods in algebraic number fields
• On the large sieve method in algebraic number fields
• Explicit bound for the prime ideal theorem in residue classes
• An Algorithmic Construction of Finite Elliptic Curves of Order Divisible by a Large Prime
• On exponents of modular subgroups generated by small consecutive integers
• Elliptic Curves and Primality Proving
• A generalization of Bombieri's prime number theorem to algebraic number fields
• Large Sieve, Miller-Rabin Compositeness Witnesses and Integer Factoring Problem
• On the large sieve
• The large sieve inequality for algebraic number fields
• The large sieve in algebraic number fields
• The Large Sieve Inequality for Algebraic Number Fields Iii. Zero-Density Results

This page was built for publication: A variant of the large sieve inequality with explicit constants