A note on balancing sequences and application to cryptography

preprint2022arXivOpen access

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≥2r\geq2 there are ≫log⁡x\gg\log x balancing non-Wieferich primes p≤xp\leq x such that p≡±1(modr)p\equiv\pm1 \pmod{r}, under the assumption of the abcabc conjecture for the number field Q(2)\mathbb{Q}(\sqrt{2}). Further, we discuss some applications of balancing sequences in cryptography.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.