A note on balancing sequences and application to cryptography

MaRDI QIDQ6358235zbMATH OpenFDO

Authors K. Anitha, I. Mumtaj Fathima, A. R. Vijayalakshmi

Publication date 13 January 2021

Mathematics Subject Classification ID

Primes (11A41) Arithmetic progressions (11B25) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50) Cryptography (94A60)

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 $rgeq2$ there are $gglogx$ balancing non-Wieferich primes $pleqx$ such that $pequivpm1pmodr$, under the assumption of the $abc$ conjecture for the number field $mathbbQ(sqrt2)$. Further, we discuss some applications of balancing sequences in cryptography.

This page was built for publication: A note on balancing sequences and application to cryptography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6358235)