Asoke Nath

A New Symmetric Key Cryptography Algorithm Using Extended MSA Method: DJSA Symmetric Key Algorithm

In the present work the authors introduced a new symmetric key cryptographic method for encryption as well as decryption of any file such as binary file, text file or any other file. Nath et. al. (1) developed an algorithm called MSA for encryption and decryption of any file using a random key square matrix containing 256 elements. The weak point of MSA algorithm is that if someone applies the brute force method then he has to give a trial for factorial 256 to find the actual key matrix. Now in the modern world this number of trial runs may not be impossible for the hacker. To get rid of this problem here the authors suggest a better algorithm than MSA. In the present method the authors considered the size of the key matrix to be 65536 and in each cell we store 2 characters pattern instead of 1 character unlike MSA method. If someone wants to give a brute force method to find our actual key then one has to give a trial for factorial 65536 runs! Theoretically this is an intractable problem. Moreover the authors have also introduced multiple encryptions here to make the system more secured. This method will be suitable in any business house, government sectors, communication network, defense network system, sensor networks etc. In the present work the authors have introduced a square key matrix of size 256 by 256 where in each cell there are all possible 2-lettered words (ASCII code 0-255). The total number of words possible is 65536. The key matrix is then randomized using the method proposed by Nath et. al(1). The user has to enter some secret text-key. The maximum length of the text key should be 16 characters long. To calculate the randomization number and the number of encryption to be done is calculated from the text-key using a method proposed by Nath et.al(1). The present method will be most suitable for encryption of a file whose size is less than or equal to 2MB. If the file size is very big then we suggest choosing small encryption number to speed up the system.

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.

Symmetric key cryptosystem using combined cryptographic algorithms - Generalized modified Vernam Cipher method, MSA method and NJJSAA method: TTJSA algorithm

In the present paper the authors have introduced a new combined cryptographic method called TTJSA. Nath et al. have already developed some symmetric key methods. In the present work the authors have used two methods MSA and NJJSAA which were developed by Nath et al. and have developed a new algorithm, generalized modified Vernam Cipher Method. The above three methods are applied in random order on any given plain text for a number of times to get the ultimate cipher text file. In the present work, authors modified the standard Vernam Cipher Method for all characters (ASCII code 0–255) with randomized keypad, and have also introduced a feedback mechanism. The method has been closely monitored on different known plain text and it was found that this method is almost unbreakable. The present method allows multiple encryption/decryption. The present method is an extremely secure block cipher method and it can be applied to encrypt data in Defense system, Banking sector, mobile network etc. The advantage of the present method is that one can apply this method on top of any other standard algorithm such as DES, AES or RSA. The method is suitable to encrypt any type of file.

New Symmetric Key Cryptographic Algorithm Using Combined Bit Manipulation and MSA Encryption Algorithm: NJJSAA Symmetric Key Algorithm

In the present work the authors have introduced a new advanced symmetric key cryptographic method called NJJSAA. The authors introduced new bit manipulation method for data encryption and decryption of any file. Nath et al already developed some symmetric key methods[1,2,3,4] where they have used some randomized key matrix for encryption and decryption methods. In the present work the authors have used a bit manipulation method which include bit exchange, right shift and XOR operation on the incoming bits. To exchange bits the authors used a randomized key matrix of size (16x16) using the method developed by Nath et al(1). 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 text-key the authors have calculated randomization number and the encryption number. The method used was developed by Nath et al(1). A slight change in the text-key will change the randomization number and the encryption number quite a lot. Multiple encryption using bit exchange, bit right shift and XOR operations makes the system very secured. The present method is a block cipher method and it can be applied to encrypt data in sensor network or in mobile network. The advantage of the present method is that one can apply this method on top of any other standard algorithm such as DES, AES or RSA. The method is suitable to encrypt any large or small file. There is a scope to further enhance the present method of encryption.

Green Computing - A New Horizon of Energy Efficiency and Electronic Waste Minimization: A Global Perspective

Due to tremendous growth of Industrial activities throughout the globe, the climate of the earth is gradually changing. The Increase awareness of climate change and more concern for the environment, has forced the big industries to review their environmental credentials. The Global IT sector, for example, accounts for between two and three percent of the worlds total carbon dioxide emissions which contribute towards global warming and climate change. So if the IT companies are increasing exponentially then the global warming will be more and more. Keeping all these facts the companies throughout the world are now paying more attention to Green IT as an initiative towards cost savings and a greener environment. However, a significant percentage of total population of the globe unaware of the various good practices in ICT towards Green IT. In the present work the authors tried to make a systematic study on the issues of climate change and also explore green computing from the business and IT perspective, and also to find the best practices of green computing into the users of ICT.

Issues of Privacy and Security in the Role of Software in Smart Cities

Throughout the evolution of cities, the very structure of what defines a city has been changing. There has been a huge amount of advancement from the ancient settlements to modern metropolitans and now the next step in the evolution of cities is here - smart cities. Smart cities have come up to counter act the ills of the industrial cities that produce a many bad side effects. Smart cities have been known to be environment friendly, better organized, have better mobility, and a more competent economy. In meeting these necessary objectives, the role of software can make the smart city more integrated and functional as a whole. But the use of smart software, as we call it, can pose problems pertaining to the security and integrity of the smart citys data and privacy. Therefore the need arises to understand and evaluate the concerns of security and privacy that come up with smart software before they can be used in full scale. This paper concentrates on these issues.

Modern Encryption Standard(MES) version-I: An advanced cryptographic method

In the present world we need a high security for transmitting any digital information from client to another client or one machine to another machine. In the present work the authors focus on how one can achieve high order data security while transmitting from one place to another place. The authors here propose a new encryption standard (algorithm), which is the amalgamation of two different encryption algorithms developed by Nath et al. namely TTJSA and DJSA in randomized fashion. The title of the proposed method is Modern Encryption Standard version-I (MES ver-I) and, the method is achieved by splitting the file, which is to be encrypted, and encrypting the split sections of the file in various ways using TTJSA and DJSA cipher methods. The method has been tested on different files and the results were very satisfactory. The primary idea behind the implementation of MES ver-I is to build a strong encryption method, which should be unbreakable by any kind of brute force method or differential attack. In the result section the authors have shown the spectral analysis which clearly shows that the present method is free from any kind of cryptography attack namely brute force method, known plain text attack or differential attack.

New Data Hiding Algorithm in MATLAB 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 introduced a new bit exchange algorithm. For hiding secret message Nath et al(1,2,3) have already proposed various methods. Here the authors modified the steganographic method. Instead of changing the LSB of the cover file at a stretch the authors proposed to change LSB and LSB+3 bits and changing alternate bytes of the cover file. It means to hide one byte of secret message the authors used 8 bytes of the cover file but out of 8 bytes 4 bytes were modified in LSB and LSB+3 bit positions and the alternate bytes remain unchanged. The secret message was encrypted by using a simple bit exchange method before the actual embedding process starts. The number of times the secret message to be encrypted using bit exchange method can be controlled by the user. The proposed bit exchange method is reversible that means the way the encryption done the decryption to be done in reverse way. The entire work was done in MATLAB. The authors applied the present steganography algorithm on different cover files such as image file, audio file, video file, word file, Excel file, Power point file,.exe file and in every case the result found was satisfactory. To embed any secret message inside a cover file the user has to enter a password and the same password to be used to unhide the secret message. The authors propose that this method could be most appropriate for hiding any file in any standard or non standard cover file such as word, excel, .ppt, .exe, image, audio, video files. The hidden message is encrypted using some bit exchange method and hence it will be almost impossible for the intruder to unhide the actual secret message from the embedded cover file. This method may be used for sending some secret key to someone over mail as the intruder may not be able to unhide and to decrypt the secret message.

Application of Radio Frequency Controlled Intelligent Military Robot in Defense

In the present paper the authors tried to explore how a radio frequency controlled robot can be used in defense and in real war field. The military robot will be able to substitute the real human soldier in the battle field. The authors have tried to explore how a military robot will function. The military robot has a two barrel gun turret through which bullets can be fired. It has two cameras in synchronization with the turret which can rotate up and down, left and right up to a safe firing limit. Both the gun turret and the cameras are enclosed within a hemispherical shell which serves as a shield and assists and enables their motion. The robot vehicle can move like a tank, turning to any angle on its axis, moving forward and reverse turning left and right, running instantly into reverse direction using the same steering mechanism as present in tanks. The robot is radio operated, self powered, has back tracking facility, in case of loss of connection from the base station. A pair of guns has been installed on it, so that it can fire on enemies remotely when required. To aim the guns and view the road and the surroundings in which the robot is traveling, wireless cameras are installed on different sides of the robot for different vantage points. Wireless cameras will send back real time video and audio inputs which can be seen on a remote monitor in the base station from where the robot is being controlled and action can be taken accordingly. The robot can be controlled from a base station by means of radio frequency. It also has the ability to re-establish contact with the base station in case of a signal failure by retracing its path back for some distance. It can silently enter into an enemy area and send us all the information through its camera eyes. It is designed for fighting, reconnaissance as well as suicide attacks under certain circumstances.

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.