Subhranil Som

Applications and usage of visual cryptography: A review

Visual cryptography is a cryptographic technique which allows visual information to be encrypted in such a way that decryption becomes a mechanical operation that does not require a computer. In this paper, we intend to study the different application areas of Visual Cryptography. Visual Cryptography is a wide area of research used in data hiding, securing images, color imaging, multimedia and other such fields. Visual Cryptography comes in the field of data hiding used in cybercrime, file formats etc. This paper focuses on the application areas of visual cryptography from four different research papers/journals which talk about the most important application areas of visual cryptography.

Natural Language Processing Approach to Identify Analogous Data in Offline Data Repository

There have been huge contributions to online communities and social media websites through posts, comments and blogs day in and day out. Some of this contribution is unstructured and unclassified. It is difficult to find similarities in terms of textual data in the posts as it comprises of mix of structured and unstructured data. The overall objective of this paper is to help identify similar text through natural language processing techniques. The approach has been demonstrated through linguistic features that points to similarity and use those features for the automatic identification of analogous data in offline data repository. To demonstrate the approach, we have used a collection of documents as an offline repository having similar text and a text corpus as a resource to identify analogous data. The proposed methodology processes a document against repository based on document preprocessing through lexical analysis, stop word elimination and synonym substitution check. Java data structure is used to hold and process data parsed from the file syntactic analysis is carried out with the help of WordNet™ database configured within the process. Part of speech (POS) and synonym check capabilities of WordNet API are being used in the process.

Encryption Technique Using Elliptic Curve Cryptography Through Compression and Artificial Intelligence

This paper is an algorithmic approach to a compression scheme followed by an encryption of the compressed input stream using Elliptic Curve Cryptography (ECC) over prime field. The compression is an Artificial Intelligence (AI) approach where the input stream is fully read, and the repetitive groups in input stream are replaced by some unused character set. Elliptic curve has been chosen as it requires very less key size. The cryptanalysis to find back the private key requires discrete logarithmic approach. In the encryption scheme, first, the required parameters have been chosen to satisfying the equation [4a3 + 27b2 ≠ 0 mod p], where a prime number “p”, which defines the cardinal number of the set. Each “p + 1” elements of the set has been evaluated. Each distinct character in the input stream is reflected to a point over the elliptic curve to deduce a point (xA, yA) using an integer value (K) which has been agreed by both sender and receiver. The receiver of the cipher text chooses a point from the set as the generator point generates public key set using key and is distributed among all the senders. This public key set has used in conjunction with the sender’s private key and the point (xA, yA) to generate the cipher text which has been passed over to the intended recipient. The receiver takes up the cipher text and uses private key to find back the (xA, yA). The actual character from (xA, yA) using K and the original input stream has been evaluated.

HS1-RIV: Improved Efficiency for Authenticated Encryption

Encryption was “need of the hour” when it was invented but with the progress of time researchers have shown that it is not very effective when implemented alone. Many attacks are present in the present time, which can break any simple encryption in no time. Therefore, researchers have proposed and proved various techniques, which can work along encryption and can increase security by many folds. This paper aims at bringing essence of this evolution and benefits that tag along with it in one document. Various researchers have different point of view regarding the use of techniques and their benefits along with it, some of those point of views and their reasons are given in this paper

Symmetric Cryptography using Multiple Access Circular Queues (MACQ)

In order to provide secure data communication in present cyber space world, a stronger encryption technique becomes a necessity that can help people to protect their sensitive information from cryptanalyst. This paper proposes a novel symmetric block cipher algorithm that uses multiple access circular queues (MACQs) of variable lengths for diffusion of information to a greater extent. The keys are randomly generated and will be of variable lengths depending upon the size of each MACQ.A number of iterations of circular rotations, swapping of elements and XORing the key with queue elements are performed on each MACQ. S-box is used so that the relationship between the key and the cipher text remains indeterminate or obscure. These operations together will help in transforming the cipher into a much more complex and secure block cipher. This paper attempt to propose an encryption algorithm that is secure and fast.

Study on white-box cryptography: Key whitening and entropy attacks

White-box cryptography is intended on saving software completions of algorithms based on cryptography against the recovery of key. They are mainly applied in applications based on Digital Rights Managements (DRM) as a cost effective substitute. This paper explains White-Box Cryptograph trends and some important problems, also focuses on two most popular cryptographic techniques-key whitening and entropy technique as well as the attacks imposed on them.

Encryption technique using dynamic table and block division process on binary field

In this paper a new cryptographic algorithm is proposed. Three Keys are used in this technique for encryption and decryption of data. The technique has generated an intermediate cipher which will be followed by unique random number card and block division process to produce final cipher. Composite and prime numbers are used to make the proposed algorithm more secure. Key-1 is a unique random number card and with this key an intermediate cipher text is produced. Key-2 has 5 digit random numbers. With the help of Key-2 block division process will be applied on Intermediate cipher and Key-3 will have random prime numbers which will be added to finalize the final cipher. With help of keys and following the reverse steps, plain text can be generated.

Study of different cryptographic technique and challenges in future

In the recent years the need of security has increased many folds. Its not that the need to secure data is new and goes back to the time of 1st and 2nd world war and even back to the time of Caesar. This paper gives a history of all the data hiding techniques used in the history and how these techniques have evolved from Caesar cipher to DES and then to Triple-DES, AES and current algorithms. This paper will explain the pros and cons of previous algorithms and why they are not used now a day. The scope of this paper will go from general data hiding techniques and then moves to cryptographic algorithms.