Earticle

초록

영어

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.

목차

Abstract
 1. Introduction
 2. Related Work
 3. Proposed Technique (CCC)
  3.1 Substitution in Plaintext
  3.2 Secret Key Generation
  3.3 Encryption Procedure
  3.4 Decryption Process
 4. Results and discussion
  4.1 Avalanche Effect
  4.2 Frequency Test
  4.3 Binary Derivative Test
  4.4 Resistance to Brute Force Attack
 5. Conclusion
 References

키워드

저자

• Priya Verma [ Discipline of Electronics and Communication Engineering, Lovely Professional University, Phagwara, Punjab, India ]
• Gurjot Singh Gaba [ Discipline of Electronics and Communication Engineering, Lovely Professional University, Phagwara, Punjab, India ] Corresponding Author

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Security and Its Applications

• 간기

  격월간

• pISSN

  1738-9976

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605