Abstract
Today, cryptography is a cornerstone in the resource constrained networks and devices. Many modern cryptosystems make it very difficult but not impossible for an attacker to determine the decoding key. Even though the key might be eventually determined by a skilled decoder, given enough time and effort, cryptosystems can still provides ample security to protect valuable information. Among various encryption techniques, Caesar cipher is one of the oldest technique to encrypt the valuable information. But it gets easily cracked due to its simplicity of operation. In this paper, a new algorithm is proposed i.e. Coherent Caesar Cipher (CCC), which is found to be more consistent and reliable as compared to other existing caesar cipher algorithms. Performance of CCC and conventional techniques are tested using various NIST suggested randomness evaluation tests along with brute force attack analysis. The results were promising as the proposed technique produced more random results for various inputs and has the capability to withstand brute force attack for a longer duration.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Security and Its Applications
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.
