Earticle

초록

영어

This paper presents a technique for secret communication using cryptography and steganography. The cryptographic algorithm is a block cipher with a block length of 128 bits and key length of 256 bits. The secret message is encrypted by this block cipher. Two cipher text bits are to be embedded in each pixel of the image. Each pixel is 8 bits. The embedding locations in a pixel are: 6th and 7th bit locations or 7th and 6th bit locations or 7th and 8th bit locations or 8th and 7th bit locations depending upon the cipher text bits. The 8th bit means the least significant bit (LSB). As the embedding locations are decided at the run time of the algorithm, so it is called as dynamic steganography. The technique is experimented and results are discussed.

목차

Abstract
 1. Introduction
 2. The New Block Cipher with 256 Bit Key
  2.1. Sub Key Generation
  2.2. Encryption
  2.3. Decryption
  2.4. Stir operation
  2.5. XOR Operation
 3. Embedding and Retrieving Techniques
  3.1. The Embedding Technique
  3.2. The Retrieving Technique
 4. The Proposed Algorithm
 4. Results and Discussion
 6. Conclusion
 References

키워드

저자

• Gandharba Swain [ Research Scholar-CSE, SOA University ]
• Saroj Kumar Lenka [ Professor- CSE, MITS University ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Security and Its Applications

• 간기

  격월간

• pISSN

  1738-9976

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605