paper

On the Number of Regular Integers Modulo and Its Significance for Cryptography

arXiv:2304.02471

Abstract

We present four combinatorial proofs of Morgado's formula for the number of non-congruent regular integers modulo , corresponding to sequence A055653 in the On-Line Encyclopedia of Integer Sequences (OEIS), where an integer is said to be regular modulo if the congruence has a solution . To illustrate the significance of the sequence and Morgado's formula, we relate them to a recent multi prime, multi-power generalization of the RSA cryptosystem.

arXiv comment8 pages