arXiv · 2101.05274
A note on balancing sequences and application to cryptography
Abstract
In this paper, we prove the lower bound for the number of balancing non-Wieferich primes in arithmetic progressions. More precisely, for any given integer $r\geq2$ there are $\gg\log x$ balancing non-Wieferich primes $p\leq x$ such that $p\equiv\pm1 \pmod{r}$, under the assumption of the $abc$ conjecture for the number field $\mathbb{Q}(\sqrt{2})$. Further, we discuss some applications of balancing sequences in cryptography.
Explore related subjects
Keep this discovery
K. Anitha, I. Mumtaj Fathima, A R Vijayalakshmi. 2021-01-13. A note on balancing sequences and application to cryptography. https://arxiv.org/abs/2101.05274
Cite the original work for its findings. Save a collection to share your selection of sources.