Joyshree Nath

Advanced Steganography Algorithm using Encrypted secret message

In the present work the authors have introduced a new method for hiding any encrypted secret message inside a cover file. For encrypting secret message the authors have used new algorithm proposed by Nath et al(1). For hiding secret message we have used a method proposed by Nath et al(2). In MSA(1) method we have modified the idea of Play fair method into a new platform where we can encrypt or decrypt any file. We have introduced a new randomization method for generating the randomized key matrix to encrypt plain text file and to decrypt cipher text file. We have also introduced a new algorithm for encrypting the plain text multiple times. Our method is totally dependent on the random text_key which is to be supplied by the user. The maximum length of the text_key can be of 16 characters long and it may contain any character(ASCII code 0 to 255). We have developed an algorithm to calculate the randomization number and the encryption number from the given text_key. The size of the encryption key matrix is 16x16 and the total number of matrices can be formed from 16 x 16 is 256! which is quite large and hence if someone applies the brute force method then he/she has to give trail for 256! times which is quite absurd. Moreover the multiple encryption method makes the system further secured. For hiding secret message in the cover file we have inserted the 8 bits of each character of encrypted message file in 8 consecutive bytes of the cover file. We have introduced password for hiding data in the cover file. We propose that our new method could be most appropriate for hiding any file in any standard cover file such as image, audio, video files. Because the hidden message is encrypted hence it will be almost impossible for the intruder to unhide the actual secret message from the embedded cover file. This method may be the most secured method in digital water marking.

MicroRNA signatures highlight new breast cancer subtypes

MicroRNAs (miRNAs) are a kind of short non-coding RNAs, of about 22 nucleotides in length, which modulate and sometimes degrade the target mRNAs thereby regulating a number of cellular functions. Recent research in this area establishes the involvement of miRNAs in various disease progressions, including certain types of cancer development. Further, genome-wide expression profiling of miRNAs has been proven to be useful for differentiating various cancer types. In this paper, we have used miRNA expression profiles over a large set of breast cancer tumor samples for identifying subtypes of breast cancers. The experimental results demonstrate that miRNAs carry a unique signature that distinguishes cancer subtypes and reveal new cancer subtypes. Additional survival analyses based on clinical data also strengthen this claim.

Symmetric key Cryptography using two-way updated -Generalized Vernam Cipher method: TTSJA algorithm

In the present paper the authors have introduced a new updated two-way generalized vernam cipher method called TTSJA. Chatterjee et.al developed a method [1] where they used three independent methods such as MSA [2], NJJSAA [3] and modified generalized vernam cipher method. Nath et al already developed some symmetric key methods [2,3,4,5] where they have used bit manipulation method and some randomized key matrix for encryption and decryption purpose. In the present work the authors have used updated generalized vernam cipher method in two directions. One from first character to last character and then we perform vernam method with XOR operation from last to first We found the results are quite satisfactory even for short message and repeated characters also. The advantage of the present method is that the overhead is minimum but the encryption is very hard. This method may be applied to encrypt short message such as SMS, password, ATM code etc. In the present work the authors have introduced updated Vernam Cipher method. The authors modified the standard Vernam Cipher method for all characters (ASCII code 0-255) with randomized keypad and also introduced feedback. After first phase encryption the modified vernam cipher method applied from last character to the first using random keypad and feedback. In the second phase instead of adding the keypad ASCII the authors performed the XOR with keypad and the encrypted text (after first phase). This method closely monitored on different known plain text and it was found that this method is almost unbreakable. The present method allows the multiple encryption and multiple decryption. To initiate the encryption process a user has to enter a text-key which may be maximum of 16 characters long. From the textkey the randomization number and the encryption number is calculated using a method proposed by Nath et al [2]. A minor change in the text-key will change the randomization number and the encryption number quite a lot. The present method is a block cipher method and it can be applied to encrypt confidential data in Defense system, Banking sector, mobile network, Short message Service, Password, ATM key etc. The advantage of the present method is that one can apply this method on top of any other standard algorithm such as MSA, DJSA, NJJSAA, TTJSA, DJMNA etc [2,4,3,1,5]. The method is suitable to encrypt any type of file.

Advanced steganographic approach for hiding encrypted secret message in LSB,LSB+1,LSB+2 and LSB+3 bits in non standard cover files

In digital steganography normally image, audio or video files are the standard cover files or the host files for embedding secret message such as text, image, audio or video. Nath et al.(2) explored the standard method for hiding secret message inside standard cover files such as image, audio or video files. In the present work we have shown how we can hide secret message in encrypted form in some non standard cover files such as .exe, .com, .pdf, .doc, .xls, .mdb, .ppt files. However, the size of the secret message must be very small in comparison to cover file. The secret message is converted to encrypted form using MSA algorithm(2) and then we hide the encrypted message inside the non standard cover file. To hide encrypted secret message we insert the 8 bits in 2 consecutive bytes of cover file in LSB, LSB+1, LSB+2 and LSB+3 positions. This method could be very effective to hide some information in some executable file. To make the entire process secured we have introduced the password when we hide message and while encrypting the secret message we have to input some text_key. While hiding secret message in cover file we embed 1 byte information in two consecutive bytes of the cover file. There is a risk factor that it may damage the cover file in such a way that the embedded cover file may not behave in proper way as it was behaving before insertion of secret message. However, there is one advantage that we can embed more data in a cover file. We propose that our new method could be most appropriate for hiding any file in any non-standard cover file such as executable file such as .EXE or .COM file, compiler, MS-Office files, Data Base files such as .MDB, .PDF file. Our method will now give open challenge to all user that it is possible to hide any small secret message inside in any non standard cover files. The present work shows that we can hide information in almost all files except pure text or ASCII file. The only restriction is the size of secret message should be extremely small in comparison to cover file. The present method may be implemented in digital water marking in any legal electronic documents, Bank data transactions, in government sectors, in defense, in schools and colleges.

Ultra Encryption Standard (UES) Version-IV: New Symmetric key Cryptosystem with bit-level columnar Transposition and Reshuffling of bits

The present paper is an extension of the previous work of the authors i.e. UES version-II and III. Roy et al recently developed few efficient encryption methods such as UES version-I, Modified UES-I, UES version-II, UES version-III. Nath et al developed some methods such as TTJSA, TTSJA and DJMNA which are most suitable methods to encrypt password or any small message. The introduction of multiple feedbacks in TTJSA and TTSJA it was found that the methods were free from any brute force attack or differential attack or simple plain text attack. The authors proposed the present method i.e. Ultra Encryption Standard Version-IV. It is a Symmetric key Cryptosystem which includes multiple encryption, bit-wise reshuffling method and bit-wise columnar transposition method. In the present work the authors have performed the encryption process at the bit-level to achieve greater strength of encryption. In the result section the spectral analysis is done on repeated characters. The authors proposed method i.e. UES-IV can be used to encrypt short message, password or any confidential key.

Bit Level Encryption Standard (BLES): Version-I

In the present paper the authors have introduced a new symmetric key cryptographic method called Bit Level Encryption Standard(BLES) which is based on bit exchanging or bit reshuffling method. The authors have introduced a completely new bit level encryption method. Nath et. al has already developed bit manipulation method called NJJSAA where the authors mainly used bit level right shift, bit level XOR operation. In the present paper the authors have used bit level exchange using random key generator and also byte level exchange using random key generator. The bit exchange was made using different block sizes such as 16 bits, 64 bits, 256 bits and 1024 bits long. To make the system hard the authors have changed the randomization matrix each time when data is extracted from plain text file and whenever the size of the block is changed. After finishing bit level exchange for the entire file the authors used the byte exchange method. The authors have also introduced a special bit manipulation method so the encryption algorithm will work even for all characters with ASCII Code 0 or all characters with ASCII Code 255. The standard encryption algorithm will fail to encrypt a file where all characters are ASCII ‘0’ or all characters with ASCII ‘255’ but the present method will be able to encrypt a file where all characters are ASCII ‘0’ or all characters are ASCII ‘255’. The present method will be effective for encrypting short message, password, confidential key etc. The spectral analysis in the result sections shows that the present method is free from known plain text attack, differential attack or any type brute force attack. General Terms encryption, bit exchange, byte exchange

Ultra Encryption Algorithm (UEA): Bit level Symmetric key Cryptosystem with Randomized Bits and Feedback Mechanism

The present paper proposes a new cryptographic algorithm called Ultra Encryption Algorithm (UEA). Nath et al recently developed few efficient encryption methods such as UES version-I, Modified UES-I, UES version-II, TTJSA, DJMNA Nath et. al showed that TTJSA and DJMNA is most suitable methods to encrypt password or any small message. The name of the present method is Ultra Encryption Algorithm (UEA) as it is a Symmetric key Cryptosystem which includes multiple encryption, advanced bit-wise randomization, new serial feedback generation and bit-wise encryption technique with feedback. Evidenly, in the result section the authors have shown the spectral analysis of encrypted text as well as plain text to show the effectiveness of the bit-level algorithm. The spectral analysis reveal that the present module offers encryption that is free from repetitive text patterns and strong enough against the standard cryptographic attacks.

A Comprehensive Study of Target Prediction Algorithms for Animal MicroRNAs(miRNAs)

The discovery of microRNAs has been a path-breaking step in understanding the full scope of post-transcriptional gene regulation. The microRNAs (miRNAs) are highly conserved, non-coding short ribonucleic acid (RNA) molecules, approximately 22 nucleotides long[6] and are found in all eukaryotic cells, except fungi and marine plants. MicroRNAs (miRNAs) post-transcriptionally regulate the expression of target genes by binding to complementary sequences on target messenger RNA transcripts, usually resulting in translational repression and thus inhibition of the expression of target mRNAs. Complete complementarity between miRNA:mRNA pairs is rare in mammals, but as little as a 6 bp match with the target mRNA can be sufficient to suppress the gene expression[8]. MicroRNAs, which were initially determined as moderate biological modifiers, have now emerged as powerful regulators of diverse cellular processes with important roles in tissue remodeling[9]. It throws light into the causes of diseases like lymphoma, leukemia, cancers and many cardiac problems where miRNA:mRNA pairing is found to play crucial roles[5]. Many computational methods are being developed to identify the relationship between the animal miRNAs and their target mRNAs. Here we study two of those recent methods to identify the target mRNAs of existing animal miRNAs.

Identifying significant microRNA–mRNA pairs associated with breast cancer subtypes

MicroRNAs (miRNAs) are small non-coding RNAs that help in post-transcriptional gene silencing. These endogenous RNAs develop a post-transcriptional gene-regulatory network by binding to complementary sequences of target mRNAs and essentially degrade them. Cancer is a class of diseases that is caused by the uncontrolled cell growth, thereby resulting into a gradual degradation of cell structure. Earlier researches have shown that miRNAs have significant biological involvement in cancer. Prolonged research in this genre has led to the identification of the functions of numerous miRNAs in cancer development. Studying the differential expression profiles of miRNAs and mRNAs together could help us in recognizing the significant miRNA–mRNA pairs from cancer samples. In this paper, we have analyzed the simultaneous over-expression of miRNAs and under-expression of mRNAs and vice versa to establish their association with cancer. This study focuses on breast tumor samples and the miRNA–mRNA target pairs that have a visible signature in such breast tumor samples. We have been able to identify the differentially expressed miRNAs and mRNAs, and further established relations between them to extract the miRNA–mRNA pairs that might be significant in the breast cancer types. This gives us the clue about the potential biomarkers for the breast cancer subtypes that can further help in understanding the progression of each of the subtypes separately. This might be helpful for the joint miRNA–mRNA biomarker identification.

Computational study of secondary structure of premature miRNA and inclusion of finite state automation

For the past few years quite a lot of research has been done on pre-mature and mature miRNAs. Scientists show huge interest in this domain, as this domain is still not explored fully. It is believed to have better information on animal and plant structures and functions. Quite an amount of work has been done in assessing miRNA functions, mapping their expressions with genetic disorders, discovering correct miRNA targets and lots more. So in experimental or computational genomics perfect assessing of the structural and functional behavior of miRNAs correctly is a huge task. In this paper the authors have made a systematic study to get a proper secondary structure of the pre-mature miRNA and get the mature miRNA sequence corresponding to it. The similarities of the computational results with the experimental results will pave a new way towards certifying novel miRNAs using computational method. In the present paper the authors have introduced finite state automation to represent the secondary structure. The finite state automation approach will give better understanding the structural and functional behavior of miRNA.