A cryptosystem based on chaotic maps and factoring problems

From MaRDI portal
Publication:2205071





Summary: A cryptosystem allows a sender to send any confidential or private message using a receiver's public key and the receiver next confirms the integrity and validity of the received message using his own secret key. Cryptosystem algorithms can be categorised based on the type of security suppositions, for example discrete logarithm, factorisation, and elliptic curve hard problems, which are all currently believed to be unsolvable in a reasonable time of period. Recently, cryptosystems based on chaotic maps have been proposed. Due to some subtle and close relationship between the properties of traditional cryptosystems and chaotic-based systems, the idea of using chaotic in cryptography has received a great deal of attention from many cryptography's researchers. Therefore, to enhance system security, we explore the implementation of a cryptosystem algorithm based on both cryptographic and chaotic system characteristics. We also provide security against known cryptographic attacks and discuss the performance analysis of the developed system.











This page was built for publication: A cryptosystem based on chaotic maps and factoring problems

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