An Advanced Combined Symmetric Key Cryptographic Method using Bit Manipulation, Bit Reversal, Modified Caesar Cipher(SD-REE), DJSA method, TTJSA method: SJA-I Algorithm (original) (raw)
Related papers
Symmetric key Cryptography using two-way updated -Generalized Vernam Cipher method: TTSJA algorithm
International Journal of Computer Applications, 2012
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 text-key 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.
Communication …, 2011
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.
In the present work the authors have introduced an integrated symmetric key cryptographic method DJMNA which combine two independent methods (i) Modified Generalized Vernam Cipher (MGVC) method and (ii) DJSA method which is an extension of MSA method. The Generalized Vernam Cipher algorithm extends text encryption to any type of data encryption. This is done by using ASCII code of all characters (0-255). This modified version of Generalized Vernam Cipher uses “feedback” effect and also reverses the file while encryption. This makes the encryption process very hard to decrypt by using any brute force method. It was found that the encrypted text has huge difference for similar plaintexts having minor difference even for the same text-key. From this text key two randomized matrices are generated. The elements of this matrix decides the order of application of DJSA and MGVC methods
2012
In this paper the author presents a new cryptographic technique to exclude the repetitive terms in a message, when it is to be encrypted, so that it becomes almost impossible for a person to retrieve or predict the original message from the encrypted message. In modern world, cryptography hackers try to break a code or cryptographic algorithm or try to retrieve the key, which is needed to encrypt a message, by analyzing the insertion or presence of repetitive bits / characters (bytes) in the message and encrypted message to find out the encryption algorithm or the key used for it. So it is must for a good encryption method to exclude the repetitive terms such that no trace of repetitions can be tracked down. For this reason we apply SD-AREE cryptographic method to exclude repetitive terms from a message, which is to be encrypted. In SD-AREE method the repetitive bits / characters are removed and there is no trace of any repetition in the message.
2012
This paper presents a new combined symmetric key cryptographic technique, which is generally an amalgamation of Bit Manipulation, generalized Modified Vernam Cipher, Single Bit Manipulation and Modified Caesar Cipher. The technique proposed here is basically an advanced and upgraded module of SD-AREE cryptographic method, which is based on Modified Caesar Cipher along with Bit Manipulation and the SD-AREE module is very useful in excluding any repetition pattern from a message that is to be encrypted. The proposed method, SD-AREE-I Cipher, is a complete cipher method and unlike its predecessor, SD-AREE, does not need to be added to other cryptographic methods to make those methods stronger. SD-AREE-I method is used to encrypt/decrypt different file formats and the results were very satisfactory. This method is unique and strong because the method contains feedback mechanism and generates new encrypted output every time even with slightest change in the input file (message). The proposed method can also be used for network security.
Encryption and Decryption Technique using Multiple Symmetric Algorithm
2016
This paper proposes the new algorithm for encrypting the plain text into the cipher text. In this algorithm we combine different symmetric algorithm into one algorithm with little change in those algorithm. All the traditional algorithm are very week and cryptanalysis easily cracked the cipher text and convert that cipher text into the plain text. In this encryption algorithm, a new concept of substitution technique i.e. Caesar Cipher & Hill Cipher are combine along with the transposition technique i.e. Rail fence technique are used to make more secure and stronger algorithm. The plain texts are encrypted in such a way, so that it will difficult for cryptanalyst to crack it. The proposed algorithm is divided into three Phases. In the first phase the plain text is Encrypted using Substitution technique called Caesar Cipher, In the Second phase the first encrypted text are applied for Second Substitution technique i.e. Hill cipher. In the Third phase the Transposition Technique i.e. R...
Symmetric key Cryptography using modified DJSSA symmetric key algorithm
International Journal of Scientific Research, 2012
The present work deals with modified advanced symmetric key cryptographic method i.e. modified DJSSA algorithm[1] for multiple encryption and decryption of any file. Recently Nath et al[1] developed an algorithm called DJSSA for encryption and decryption of any file using a random key matrix 256x65536 containing all possible 3 lettered words. Nath et.al [2] also proposed a method using a randomized key of size 256x256 containing all possible 2 lettered words. The above method was an extension of MSA algorithm proposed by Nath et al[3]. In the present work the authors have extended the DJSSA algorithm one step further. The present work proposes a key matrix of size 65536x256 which contains all possible 3lettered words. The present method uses a simple randomization technique[1] to make this key matrix random. So the complexity of finding the actual key matrix will be 16777216! trial runs and which is intractable. In the current modified DJSSA method the authors added one additional module to perform bit interchange between two consecutive bytes. This bit interchange will take place before DJSSA method. The bit interchange will continue during each encryption to make the encryption system more secured. The authors claim that it may be taken as the ultimate symmetric key method which can not be broken by using any brute force method. This method will be suitable in any business house, government sectors, communication network; defense network system provided the file size is small. 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(3). The present method will be most suitable for encryption of a small file such as digital signature or watermarking etc. The present method can be used to encrypt a large file by splitting the entire file into reasonable numbers and then run encryption program parallel in different machines and after that one has to append those encrypted file to get the ultimate encrypted file. To decrypt the file one has to follow the same trick i.e. first split into same number of files and then apply the decryption algorithm in parallel from different machines and finally append all decrypted files to get back the original file.