Modified Data Encryption Standard Algorithm for Textbased Applications

Today security is the important thing that we need to transfer data from location to another safely. As there is strong security, there is great hacker and spies at the other side. Therefore, many models and systems are looking for an ideal method to provide a secure environment for better optimi...

पूर्ण विवरण

ग्रंथसूची विवरण
मुख्य लेखक: Mohamed Khmag, Asem Ib.
स्वरूप: थीसिस
भाषा:अंग्रेज़ी
प्रकाशित: 2006
विषय:
ऑनलाइन पहुंच:http://psasir.upm.edu.my/id/eprint/206/3/549039_fk_2006_8_abstrak_je__dh_pdf_.pdf
_version_ 1846213850520616960
author Mohamed Khmag, Asem Ib.
author_facet Mohamed Khmag, Asem Ib.
author_sort Mohamed Khmag, Asem Ib.
description Today security is the important thing that we need to transfer data from location to another safely. As there is strong security, there is great hacker and spies at the other side. Therefore, many models and systems are looking for an ideal method to provide a secure environment for better optimization of the electronic connected-world. Cryptography accepts the challenge and plays the main role of the modern secure communication world. The purpose of this thesis is to introduce and demonstrate a new algorithm for Internet and e-mail security. The proposed algorithm was developed based on the combination of symmetric and asymmetric algorithm whereas the length of the key and digital signature was considered. In this manner, the length of the key would not affect the time execution of this algorithm and digital signature in the end of message would increase the authentication between the sender and the recipient.The main steps in this algorithm started with reading the plain text "original message" from the user. The second step is to apply the hash method on this message by using shuffle mechanism. Now the message is ready to do the encryption process that is dividing the text message to 128 8-bit for each four sub keys, so if the text message less than 128 8-bit then use another sub key. The last step is to send the message to another side (the recipient). To retrieve the original message the recipient must apply the inverse of all the previous stages i.e. rehashing and decryption. In this study comparison between the proposed algorithm and RSA algorithm (asymmetric algorithm) was examined and successful results were obtained. Because of its short time execution and higher authentication, using this algorithm will ensure the security for internet applications.
format Thesis
id oai:psasir.upm.edu.my:206
institution Universiti Putra Malaysia
language English
publishDate 2006
record_format eprints
spelling oai:psasir.upm.edu.my:2062015-08-06T02:54:29Z http://psasir.upm.edu.my/id/eprint/206/ Modified Data Encryption Standard Algorithm for Textbased Applications Mohamed Khmag, Asem Ib. Today security is the important thing that we need to transfer data from location to another safely. As there is strong security, there is great hacker and spies at the other side. Therefore, many models and systems are looking for an ideal method to provide a secure environment for better optimization of the electronic connected-world. Cryptography accepts the challenge and plays the main role of the modern secure communication world. The purpose of this thesis is to introduce and demonstrate a new algorithm for Internet and e-mail security. The proposed algorithm was developed based on the combination of symmetric and asymmetric algorithm whereas the length of the key and digital signature was considered. In this manner, the length of the key would not affect the time execution of this algorithm and digital signature in the end of message would increase the authentication between the sender and the recipient.The main steps in this algorithm started with reading the plain text "original message" from the user. The second step is to apply the hash method on this message by using shuffle mechanism. Now the message is ready to do the encryption process that is dividing the text message to 128 8-bit for each four sub keys, so if the text message less than 128 8-bit then use another sub key. The last step is to send the message to another side (the recipient). To retrieve the original message the recipient must apply the inverse of all the previous stages i.e. rehashing and decryption. In this study comparison between the proposed algorithm and RSA algorithm (asymmetric algorithm) was examined and successful results were obtained. Because of its short time execution and higher authentication, using this algorithm will ensure the security for internet applications. 2006-04 Thesis NonPeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/206/3/549039_fk_2006_8_abstrak_je__dh_pdf_.pdf Mohamed Khmag, Asem Ib. (2006) Modified Data Encryption Standard Algorithm for Textbased Applications. Masters thesis, Universiti Putra Malaysia. Cryptography - Data transmission systems - Case studies Algorithm
spellingShingle Cryptography - Data transmission systems - Case studies
Algorithm
Mohamed Khmag, Asem Ib.
Modified Data Encryption Standard Algorithm for Textbased Applications
title Modified Data Encryption Standard Algorithm for Textbased Applications
title_full Modified Data Encryption Standard Algorithm for Textbased Applications
title_fullStr Modified Data Encryption Standard Algorithm for Textbased Applications
title_full_unstemmed Modified Data Encryption Standard Algorithm for Textbased Applications
title_short Modified Data Encryption Standard Algorithm for Textbased Applications
title_sort modified data encryption standard algorithm for textbased applications
topic Cryptography - Data transmission systems - Case studies
Algorithm
url http://psasir.upm.edu.my/id/eprint/206/3/549039_fk_2006_8_abstrak_je__dh_pdf_.pdf
url-record http://psasir.upm.edu.my/id/eprint/206/
work_keys_str_mv AT mohamedkhmagasemib modifieddataencryptionstandardalgorithmfortextbasedapplications