A note on the average number of RSA fixed points

DOI10.1016/J.TCS.2011.03.013zbMATH Open1236.94060OpenAlexW2036951440MaRDI QIDQ638546FDOQ638546

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

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

zbMATH Keywords

cryptographyfixed pointssecurityexpected valuegreatest common divisor (GCD)RSA encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Title not available (Why is that?)
• A method for obtaining digital signatures and public-key cryptosystems
• Rivest-Shamir-Adleman public key crytosystems do not always conceal messages
• Fixed points of the RSA encryption algorithm
• On an Asymptotic Formula of Ramanujan.
• Title not available (Why is that?)

Cited In (3)

• An approximate expression related with RSA fixed points
• Fixed points of the RSA encryption algorithm
• 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)