Improved Honey Cipher Structure Using Least Significant Bit Techniques

Abstract

Honey Cipher Structure is one of such secured techniques in cryptography. There are many structures available in security, Honey Cipher structure is new model into provide security for plaintext of alphabets as well as numeric’s. I planned to implement, this structure with eight levels first level contains eight elements, from first level to last level one element is decreased, and the last level contains only one element. In this honey cipher structure first level filled by the password and repeated characters are omitted in the password, password may also contains numeric’s. After filling the password remaining levels are filled by the rest of the characters. This is reason sender can have the confident that the transferred message have secured. Honey structure is created by filling all characters and numeric’s, next step honey form is converted into Honey cipher Structure. This structure represents the three digits of numbers, this form is called as honey cipher structure, and this can be protected the message. But to provide more security, this three digit numbers are considered as ASCII decimal values. This ASCII Decimal value is converted into Binary code; by applying the Least Significant Bit (LSB) technique on this binary code we can get long distance binary value. This binary value is associated with Hexadecimal symbol. These Hexadecimal symbols are printed as a cipher text. This cipher text is transferred to receiver. Receiver decrypts this cipher text in reverse order to read the original message.