Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Mathematics in Operational Research
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.