Title :
X-MODDES (eXtended Multi Operator Delimiter Based Data Encryption Standard)
Author :
Gope, Prosanta ; Kaushik, Akhil ; Arora, Kushal ; Kumar, Neeraj
Author_Institution :
M. Tech. in Comput. Sci. & Eng., Nat. Inst. of Technol., Durgapur, India
Abstract :
An Algorithm is considered computationally secure if it can not be broken with standard resources, either current or future. In this paper we have introduced a new block cipher algorithm named X-MODDES. It is unique independent approach which uses several computational steps along with string of operators and randomized delimiter selections by using some suitable mathematical logic. X-MODDES is specially designed to produce different cipher texts by applying same key on same plain text. Thus a new protocol has been designed to encrypt a given text, which allows a higher level security as compare to MODDES. The Algorithm is successfully implemented on text file, corresponding digital image file and audio file. Here we have also tried to highlight the performance of some well known data algorithms like DES, Triple-DES, AES (Rijndael), MODDES, and compare them with the X-MODDES. Finally it has been proved that X-MODDES is one of the best performing partial symmetric key algorithm among the above mention algorithms particularly for the text message with limited size.
Keywords :
cryptographic protocols; text analysis; Triple-DES; X-MODDES algorithm; audio file; block cipher algorithm; cipher text; digital image file; extended multi operator delimiter based data encryption standard; mathematical logic; partial symmetric key algorithm; protocol; text file; text message; Australia; Computer networks; Computer science; Cryptography; Data engineering; Data security; Electronic mail; Information technology; Logic; Protocols; Cryptanalysis; MODDES; Modified Secure Code Sequence; Substitution; Transposition;
Conference_Titel :
Future Networks, 2010. ICFN '10. Second International Conference on
Conference_Location :
Sanya, Hainan
Print_ISBN :
978-0-7695-3940-9
Electronic_ISBN :
978-1-4244-5667-3
DOI :
10.1109/ICFN.2010.67