Remarks concerning RSA-cryptosystem exponents
Otokar Grošek · Czech digital mathematics library · 1994
ABSTRACT. Two problems associated with RSA-encryption exponents are dis-cussed. Firstly, how many plaintexts are to be read by the Simmons and Norris attack for given exponent and modulus. Secondly, what is the number of expo-nents belonging to a possible k-attack for given k and modulus. The goal is to find an explicit formula for the cardinality of all encryption exponents with the greatest period in a case when strong pseudoprimes are used. The RSA crypto system is a mapp ing (pe rmuta t ion) ns: Srn —> Srn, where Sm — {0, 1, 2,..., m — 1} is the mult ipl icat ive semigroup of integers modulo m. For any x (E Sm, TTS(X) = xR mod m, where G C D ( s,