In this age of technology, everyday huge amount of data is transferred across the network. The higher the amount of data transmission the larger the amount of security is needed. In this scenario security of the data stands as the basic need and it needs to be addressed and solved first. In this paper combination of a standard table and Plus minus 1 (PM1) steganography using Genetic Algorithm (GA) is proposed which would not only allow transmission of a large amount of data but would also eliminate the need of embedding the look-up table along with the image.

https://www.ijarcs.info/index.php/Ijarcs/article/download/3542/3472

A Steganography Technique Based on the Huffman Codes and PM1 Technique

Cryptography is the study of cryptographic algorithms that include encryption and decryption both. The importance of cryptography is discussed. The problem statement here is, to form a cryptographic algorithm that uses randomization. Usage of high amount of randomization makes it tougher for one to crack the cipher text. In our algorithm, we have made use of two concepts, usage of the alphabets’ table from Caesar’s Cipher and XOR decoding method using Vignere Cipher. Additional knowledge of Number Systems in Computers is used. The algorithm is highly flexible. Since usage of number system theory has been made, the encoder may make use of any of the following system during encoding: BINARY, OCTAL, HEXA DECIMAL. Further, any of these systems can be used in sub parts of the plain text, if the pre-process knowledge stored in K1 can be varied to change the base and XOR operation results. General Terms Plain Text, Cipher Text, Cryptography, Encrypt, Decrypt, Key, Preprocessing Knowledge, Base Change, Randomization

/pdf/cryptographic-technique-base-change-method-yaxxfa7n6g.pdf

Cryptographic Technique: Base Change Method

Simplification is an integral part of Machine translation, however, it still remains the most complex part of the process. A sentence in Hindi can be written in multiple ways. They can be complex sentences or simple ones. These sentences then need to be translated into English language. For this, the complex sentences need to be converted into simple sentences before being translated. This paper concerns Sentence Simplification of Complex Hindi Sentences for the Hindi shallow parser that was developed by IIIT. Complexity of a sentence can occur due to presence of clauses, multiple verbs and usage of conjunctions. So splitting the sentence works if the above mentioned properties of the sentence can be eliminated. To automate the process, a simplification algorithm has been formed. The paper shall talk about errors and patterns that have been analyzed, so as to improve the accuracy of the simplified sentence, and preserving the sense of the original sentence. General Terms Computational Linguistics, Natural Language Processing, Sentence Simplification, Shallow Parser, Translation.

/pdf/error-patterns-and-analysis-of-hindi-shallow-parser-pr2e1vogyw.pdf

Prabhas Tiwari

Papers

Cryptographic Technique: Base Change Method

Error Patterns and Analysis of Hindi Shallow Parser