MODDES
MODDES is a cryptography algorithm which is a one stop solution for all the future encryption problems. It is basically a partial key algorithm which uses a secret key and a set of operators to encrypt and decrypt data.
History
In the year 2008, three young researchers on NIT Durgapur, West Bengal, India named Prosanta Gope & A R Krishna Chelluri have invented a procedure in the field of Cryptography & Network Security. While pursuing their M. Tech. they analyzed that standard cryptographic algorithm are not sufficient to fulfill the future needs. Moreover, they are not hard to decrypt and currently network security is at stake. They start to work on this new protocol which uses symmetric key methodology. Simultaneously they also thought of developing a secure system model based on star topology. Hence they come up with this brilliant idea "MODDES".
Description
MODDES is the algorithm that is capable of encrypting not only text files but also on images and music files. Although it comes under class of symmetric key algorithm but it does not depend fully on the encryption key. The key ostensibly consists of 32 bits but because of its partial symmetric nature, the key length is not an issue. MODDES also uses randomized special characters in the form of delimiter for encryption. The file to be encrypted is read character by character; and various mathematical operations are performed on the character along with secret key and delimiter. All these processes are reversed to decode the data on the receiver’s end.
== Algorithm as a "future avatar" ==
The next decade of computers will be ruled by database and network security. In that scenario, the security of data will govern success and failure of a company. Thus we need an encryption algorithm to provide data integrity and data confidentiality on very large data transactions. All of the present encryption algorithms just uses a secret key and they are not sufficient to support large database transactions over the network. This algorithm overcomes most of the flaws of present standard cryptographic algorithms. It comes under the class of symmetric key algorithms and it has a peculiar feature of using randomize operators along with the secret key to encrypt data at sender’s end and reversing the process at receiver’s end. This special feature adds an extra tier of security to transfer data online.
Security & cryptanalysis
Cryptanalysis can be defined as the process of analyzing the cryptographic algorithm and break the code. The methods used vary, both due to the nature of the attacks and the encryption algorithm they are trying to break it. Some well known attacks like brute force is probably the most rigorous technical attack in use today , simply because most modern algorithms and their implementations have few known holes that attacker can exploit. If brute force attack is applied to break the word "CALCUTTA" encoded by MODDES and even if the key value is hacked by the hacker, generation of code sequence for the word "CALCUTTA" will take 14.52 hrs on 1.8 MHZ machine.
Comparison with other algorithms
It has been proved that the performance of MODDES is better than other well know symmetric key algorithms like DES, 3DES, AES, Blowfish with limited file size.
Advantages
# For any input text MODDES will give different cipher texts for each and every execution.
# It is not entirely dependent on the encryption key.
# Decryption time is extremely lesser than other well known symmetric key algorithms.
# It is best suitable for encrypting short messages like sms services or banking transactions.
References and external links
# National Bureau of Standards - Data Encryption Standard, FIPS Publication 46, 1977.
# NIST, "Advanced Encryption Standard Call", NIST, 1997. http://www.nist.gov/aes/.
# Twenty Second National Radio Science Conference (NRSC 2005), RDEA Algorithm.
# Daemen, Jijmen, V.: "AES Proposal: Rijndael", Banksys/Katholieke., R Universiteit Leuven, Belgium, AES submission, June 1998.
# http://www.rsasecurity.com/company/news/releases/pr.asp?doc_id=462
# W.Stallings “Cryptography and network security principles and practice,” Fourth edition, Prentice hall, 2007.
# Computer Networks by Andrew S.Tanenbaum, Fourth edition, Prentice hall, 2004.
History
In the year 2008, three young researchers on NIT Durgapur, West Bengal, India named Prosanta Gope & A R Krishna Chelluri have invented a procedure in the field of Cryptography & Network Security. While pursuing their M. Tech. they analyzed that standard cryptographic algorithm are not sufficient to fulfill the future needs. Moreover, they are not hard to decrypt and currently network security is at stake. They start to work on this new protocol which uses symmetric key methodology. Simultaneously they also thought of developing a secure system model based on star topology. Hence they come up with this brilliant idea "MODDES".
Description
MODDES is the algorithm that is capable of encrypting not only text files but also on images and music files. Although it comes under class of symmetric key algorithm but it does not depend fully on the encryption key. The key ostensibly consists of 32 bits but because of its partial symmetric nature, the key length is not an issue. MODDES also uses randomized special characters in the form of delimiter for encryption. The file to be encrypted is read character by character; and various mathematical operations are performed on the character along with secret key and delimiter. All these processes are reversed to decode the data on the receiver’s end.
== Algorithm as a "future avatar" ==
The next decade of computers will be ruled by database and network security. In that scenario, the security of data will govern success and failure of a company. Thus we need an encryption algorithm to provide data integrity and data confidentiality on very large data transactions. All of the present encryption algorithms just uses a secret key and they are not sufficient to support large database transactions over the network. This algorithm overcomes most of the flaws of present standard cryptographic algorithms. It comes under the class of symmetric key algorithms and it has a peculiar feature of using randomize operators along with the secret key to encrypt data at sender’s end and reversing the process at receiver’s end. This special feature adds an extra tier of security to transfer data online.
Security & cryptanalysis
Cryptanalysis can be defined as the process of analyzing the cryptographic algorithm and break the code. The methods used vary, both due to the nature of the attacks and the encryption algorithm they are trying to break it. Some well known attacks like brute force is probably the most rigorous technical attack in use today , simply because most modern algorithms and their implementations have few known holes that attacker can exploit. If brute force attack is applied to break the word "CALCUTTA" encoded by MODDES and even if the key value is hacked by the hacker, generation of code sequence for the word "CALCUTTA" will take 14.52 hrs on 1.8 MHZ machine.
Comparison with other algorithms
It has been proved that the performance of MODDES is better than other well know symmetric key algorithms like DES, 3DES, AES, Blowfish with limited file size.
Advantages
# For any input text MODDES will give different cipher texts for each and every execution.
# It is not entirely dependent on the encryption key.
# Decryption time is extremely lesser than other well known symmetric key algorithms.
# It is best suitable for encrypting short messages like sms services or banking transactions.
References and external links
# National Bureau of Standards - Data Encryption Standard, FIPS Publication 46, 1977.
# NIST, "Advanced Encryption Standard Call", NIST, 1997. http://www.nist.gov/aes/.
# Twenty Second National Radio Science Conference (NRSC 2005), RDEA Algorithm.
# Daemen, Jijmen, V.: "AES Proposal: Rijndael", Banksys/Katholieke., R Universiteit Leuven, Belgium, AES submission, June 1998.
# http://www.rsasecurity.com/company/news/releases/pr.asp?doc_id=462
# W.Stallings “Cryptography and network security principles and practice,” Fourth edition, Prentice hall, 2007.
# Computer Networks by Andrew S.Tanenbaum, Fourth edition, Prentice hall, 2004.
Comments