A VISUAL INFORMATION ENCRYPTION SCHEME BASED ON VISUAL CRYPTOGRAPHY AND D-H KEY AGREEMENT SCHEME ABSTRACT Visual cryptography is one kind of image encrypting. It is different from traditional cryptography, because it does not need complex computation to decrypt. In current technology, most of visual cryptography are embedded a secret using two shares is limited. Visual Cryptography is based on cryptography where n images are encoded in a way that only the human visual system can decrypt the hidden message without any cryptographic computations when all shares are stacked together. It reduces the noise in the cover images without adding any computational complexity. This project presents a new visual cryptography scheme for secure digital transmission. Visual cryptography can be seen as a one-time pad system. Then, it cannot be reused. In this project, we apply Diffie and Hellman (D-H) key agreement method and toral auto orphism (TA) such that visual cryptography can be reused. Both secret and symmetry-key are represented in binary image. The proposed scheme is simple and easy to be implemented for shadow images. Therefore, it can be used in many electronic business applications. INTRODUCTION In the present era of computers and fast communication, one needs to protect communicated information (message or plain text) from unauthorized user, while sending it through any electronic media. So, security of visual data is an important issue in the design of communication systems. Data hiding techniques and visual cryptography are used to introduce confidentiality and security when visual data are transmitted through unsecured communication channels. Data hiding techniques try to embed data in digital media and transmit it in an imperceptible way. Head office: 2nd floor, Solitaire plaza, beside Image Hospital, Ameerpet, Hyderabad www.kresttechnology.com, E-Mail : krestinfo@gmail.com , Ph: 9885112363 / 040 44433434 1 The private-key and the public-key are the two well-known cryptosystems, using these we enable to keep the secret data securely in such a way that that invader cannot able to understand what the secret data means. The data encryption standard (DES) and Rivest, Shamir, Adleman (RSA) and Advanced Encryption Standard (AES) are three representative methods. Apart from cryptography, steganography provides another way to keep the data secure. The Steganography consists of techniques to allow the communication between two persons. It hides not only the contents but also the existence of the communication in the eyes of any observer. These techniques use a second perceptible message, with meaning disjoined by the secret message. This second message works as a “Trojan horse”, and is a container of the first one. The new technologies and, in special way, the information networks require more and more sophisticated strategies in order to prevent the message privacy. In this context, digital images and audio is excellent candidate to turn into containers of the messages, since the bits of a secret text message can be superimposed, as slight noise, to the bits employed for coding a digital image. REFERENCES: [1] M. Naor and A. Shamir, “Visual cryptography,” Adv. Cryptol.: EUROCRYPT, Lecture Notes Comput. Sci., vol. 950, pp. 1-12, 1995. [2] R. L. Rivest and A. Shamir, “How to expose an eavesdropper”, Communications of the Association for Computing Machinery, vol. 27, no. 4, pp. 393-395, 1984. [3] R. Lukac and K. N. Plataniotis, “Bit-level based secret sharing”, Patter Recognition, vol. 38, no. 5, pp. 767-772, 2005. [4] S. Blake-Wilson and A. Menezes, “Authenticated Diffie- Hellman Key Agreement Schemes”, SAC '98: Proceedings of the Selected Areas in Cryptography, pp. 339-361, 1999. [5] U. Maurer, “Towards the equivalence of breaking the Diffie-Hellman scheme and computing discrete logarithms”, Advances in Cryptology - Crypto '94, Springer-Verlag, pp.271-281, 1994. Head office: 2nd floor, Solitaire plaza, beside Image Hospital, Ameerpet, Hyderabad www.kresttechnology.com, E-Mail : krestinfo@gmail.com , Ph: 9885112363 / 040 44433434 2