An Idempotent Cryptarithm

DOI10.1080/0025570X.2023.2206299MaRDI QIDQ6088719zbMATH OpenOpenAlexFDO

Authors Samer Seraj

Publication date 16 November 2023

Published in Mathematics Magazine (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2106.00382

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07)

Abstract: Notice that the square of $9376$ is $87909376$ which has as its rightmost four digits $9376$. To generalize this remarkable fact, we show that, for each integer $nge2$, there exists at least one and at most two positive integers $x$ with exactly $n$-digits in base-$10$ (meaning the leftmost or $n^{extth}$ digit from the right is non-zero) such that squaring the integer results in an integer whose rightmost $n$ digits form the integer $x$. We then generalize the argument to prove that, in an arbitrary number base $Bge2$ with exactly $m$ distinct prime factors, an upper bound is $2^m-2$ and a lower bound is $2^{m-1}-1$ for the number of such $n$-digit positive integers. For $n=1$, there are exactly $2^m-1$ solutions, including $1$ and excluding $0$.

Recommendations

• Idempotent factorizations in the cryptography classroom
• Idempotent computation over finite fields
• ID-based cryptography using symmetric primitives
• ID-based secret-key cryptography
• Identity-Based Cryptosystems and Quadratic Residuosity
• Arithmetic cryptography
• A simply realizable ideal cryptographic system
• An identity-based homomorphic encryption scheme
• An algebraic method for public-key cryptography
• Arithmetic cryptography (extended abstract)

Cited in

(1)

• Recent Trends in Algebraic Development Techniques

This page was built for publication: An Idempotent Cryptarithm

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