Answers are grounded in this paper and cite their sources.
We propose public-key encryption algorithms based on chaotic maps, which are generalization of well-known and commercially used algorithms: Rivest-Shamir-Adleman (RSA), ElGamal, and Rabin. For the case of generalized RSA algorithm we discuss in detail its software implementation and properties. We show that our algorithm is as secure as RSA algorithm.
No takes yet. Share an insight, caveat, or question.
Kocarev et al. (2004) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: