We prove character sum estimates for additive Bohr subsets modulo a prime. These estimates are analogous to classical character sum bounds of Polya-Vinogradov and Burgess. These estimates are applied to obtain results on recurrence mod $p$ by special elements.
On RSA Moduli with Almost Half of the Bits Prescribed
Square-full primitive roots
Bohr sets generated by polynomials and Coppersmith's method in many variables
![QR code for arXiv:1409.7924 [math.NT]](http://oss.arxitics.com/images/favicon.svg)