New approach of cryptography algorithm for e- mail applications

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

Full description

Saved in:
Bibliographic Details
Main Authors: Khmag, Asem, Babiker, Elsadig, Ramli, Abd Rahman
Format: Conference or Workshop Item
Language:English
Published: 2005
Online Access:http://psasir.upm.edu.my/id/eprint/38981/1/38981.pdf
http://psasir.upm.edu.my/id/eprint/38981/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.upm.eprints.38981
record_format eprints
spelling my.upm.eprints.389812015-07-13T07:51:06Z http://psasir.upm.edu.my/id/eprint/38981/ New approach of cryptography algorithm for e- mail applications Khmag, Asem Babiker, Elsadig Ramli, Abd Rahman Today security is the important thing that we need to transpose data from a location to another safely. As there is strong security, there is great hacker and spire 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 paper is to introduce and demonstrate a new algorithm for Internet and e-mail security. The purposed 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 eight 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 massage 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. 2005 Conference or Workshop Item NonPeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/38981/1/38981.pdf Khmag, Asem and Babiker, Elsadig and Ramli, Abd Rahman (2005) New approach of cryptography algorithm for e- mail applications. In: International Advanced Technology Congress: Conference on Intelligent Systems and Robotics, 6-8 Dec. 2005, Putrajaya, Malaysia. .
institution Universiti Putra Malaysia
building UPM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Putra Malaysia
content_source UPM Institutional Repository
url_provider http://psasir.upm.edu.my/
language English
description Today security is the important thing that we need to transpose data from a location to another safely. As there is strong security, there is great hacker and spire 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 paper is to introduce and demonstrate a new algorithm for Internet and e-mail security. The purposed 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 eight 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 massage 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 Conference or Workshop Item
author Khmag, Asem
Babiker, Elsadig
Ramli, Abd Rahman
spellingShingle Khmag, Asem
Babiker, Elsadig
Ramli, Abd Rahman
New approach of cryptography algorithm for e- mail applications
author_facet Khmag, Asem
Babiker, Elsadig
Ramli, Abd Rahman
author_sort Khmag, Asem
title New approach of cryptography algorithm for e- mail applications
title_short New approach of cryptography algorithm for e- mail applications
title_full New approach of cryptography algorithm for e- mail applications
title_fullStr New approach of cryptography algorithm for e- mail applications
title_full_unstemmed New approach of cryptography algorithm for e- mail applications
title_sort new approach of cryptography algorithm for e- mail applications
publishDate 2005
url http://psasir.upm.edu.my/id/eprint/38981/1/38981.pdf
http://psasir.upm.edu.my/id/eprint/38981/
_version_ 1643832290457944064
score 13.211869