A note on the average number of RSA fixed points

DOI10.1016/J.TCS.2011.03.013MaRDI QIDQ638546zbMATH OpenOpenAlexFDO

Authors Chae Hoon Lim

Publication date 12 September 2011

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

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

zbMATH Keywords

cryptographyexpected valuefixed pointsgreatest common divisor (GCD)RSA encryptionsecurity

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Fixed points of the RSA encryption algorithm
• On Fixed Points of Order K of RSA
• An approximate expression related with RSA fixed points
• On the uniformity of distribution of the decryption exponent in fixed encryption exponent RSA
• On the number of sparse RSA exponents

Cites work

• A method for obtaining digital signatures and public-key cryptosystems
• Fixed points of the RSA encryption algorithm
• scientific article; zbMATH DE number 3523640 (Why is no real title available?)
• scientific article; zbMATH DE number 2107593 (Why is no real title available?)
• On an Asymptotic Formula of Ramanujan.
• Rivest-Shamir-Adleman public key crytosystems do not always conceal messages

Cited in

(3)

• Fixed points of the RSA encryption algorithm
• An approximate expression related with RSA fixed points
• On Fixed Points of Order K of RSA

This page was built for publication: A note on the average number of RSA fixed points

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