Fixed points of the RSA encryption algorithm

DOI10.1016/j.tcs.2009.09.030zbMath1187.68205OpenAlexW2069697879WikidataQ121603375 ScholiaQ121603375MaRDI QIDQ1041250

Andrzej Chmielowiec

Publication date: 1 December 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.09.030

zbMATH Keywords

fixed pointgreatest common divisorcryptographyChinese remainder theoremRSA cryptosystem

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (1)

A note on the average number of RSA fixed points

Cites Work

• Unnamed Item
• On the number of sparse RSA exponents
• On the uniformity of distribution of the decryption exponent in fixed encryption exponent RSA
• Rivest-Shamir-Adleman public key crytosystems do not always conceal messages
• Cryptanalysis of `less short' RSA secret exponents
• Large decryption exponents in RSA
• Universal fixed messages and the Rivest‐Shamir‐Adleman cryptosystem

This page was built for publication: Fixed points of the RSA encryption algorithm