ENCRYPTION & DECRYPTION USING DEFFIE HELLMAN ALGORITHM



This research project material is available: ENCRYPTION & DECRYPTION USING DEFFIE HELLMAN ALGORITHM



Download Complete Research Project Material on ENCRYPTION & DECRYPTION USING DEFFIE HELLMAN ALGORITHM



Project Category:
Type: Project Materials| Format: Ms Word| Attribute: Documentation Only| Pages: 64 Pages| Chapters: 1-5 chapters | Price: ₦ 3,000.00



Call or whatsapp: +2347063298784 or email: in[email protected]

Download Chapter One (DOC | DOCX)

Download Chapter One (PDF)



Download complete Chapters



ENCRYPTION & DECRYPTION USING DEFFIE HELLMAN ALGORITHM



ABSTRACT

In cryptography, encryption is the process of transforming information to make it unreadable to anyone except those possessing special knowledge, usually referred to as a key. The result of the process is encrypted information. This research is intended to introduce a new approach for encryption is the design and implement Kurdish and English languages cipher system. It uses Kurdish letters and their diacritics for encrypting English messages and vice versa. A pseudo random generator is used to generate integer numbers to represent each character in Kurdish language. The same numbers are used again after sorting them to represent the English characters. The conclusions that are extracted indicate the efficiency of Deffie Hellman Algorithm according to security and time performance.

The selective application of technology and related procedural safeguard is an important responsibility for cryptographic algorithm to its electronic data systems. This work specifies the functionality of Deffie Hellman encryption and decryption to protect the sensitive unclassified data. Hellman is made available within the context of a total security program consisting of physical security procedure.

In the absence of generally acknowledged metrics in the public area that could be used to compute and spell out cryptographic strength, a small operational group agreed to look at the possibility of developing an approach to cryptographic metrics The purpose of this project is to report the results of the limited exploratory effort by the above operational group that investigated the practicality of developing metrics for use in specifying the strength of cryptographic algorithms. This work is only deals with a small sample of selected symmetric cipher block encryption algorithms.

The selective application of technological and related procedural safeguard is an important responsibility of every cryptographic algorithm in providing adequate security to its electronic data systems. This work specifies Hellman algorithm including its primary component, cryptographic engines, MODDES, DES, TDES, AES to compare in terms of memory required and encryption, decryption time.

In today''s epoch, most of the means of secure data and code storage and distribution rely on using cryptographic Schemes, such as certificates or encryption keys. This research project is devoted to the security and attack aspects of cryptographic techniques with new symmetric key algorithm. This algorithm is proposed to achieve the different goals of security i.e., Availability, Confidentiality and Integrity. We will also discuss the security threats in this algorithm.

Security is a very complex and vast topic. There is such a tool available in markets which easily crack the conventional cryptographic data. It is necessary to design such an Algorithm which approaches a different from these algorithms. Hellman is the one of best direction in this approach.

The proposed system is successfully tested on text. The performance and security provided by proposed system is better than other secret key algorithm for the message of fixed size. The main advantage of proposed system is that it is not fully dependent on the key and for the same plain text it produces different modified secure codes.

 

 

 

 

 

 

 

 

 

 

 

 

 

 

CHAPTER ONE

1.1 INTRODUCTION

Cryptographic algorithms exist to protect information first, by transforming data into a form that is meaningless to humans, such as a string of zeroes and ones, and, second, by performing certain manipulations to these transformed data so that even a specially designed machine cannot recover the original text unless provided with a secret key. The data that has been transformed can be transmitted electronically, so that even if an eavesdropper manages to read the message, its true content will remain hidden. The receiving party, however, is equipped with a secret key, so it can read the original data. This process of hiding data is referred to as encryption. The process of reversing the transformation is called decryption. Sometimes the entire process that includes both the encryption and decryption of data is called cipher. Plaintext refers to data in plain or unencrypted form. Cipher text refers to data in encrypted or enciphered form. The following are some of the previous studies that introduced new approaches in encryption or improved old ones. However, Deffie Hellman system uses different approach and new ideas.

1.2 BACKGROUND OF STUDY

Digital communication has become an essential part of infrastructure nowadays, a lot of applications are internet-based and in some cases it is desired that the communication be made secret. Two techniques are available to achieve this goal:

One is Cryptography, where the sender uses an encryption key to scramble the message, this scrambled message is transmitted through the insecure public channel, and the reconstruction of the original, unencrypted message is possible only if the receiver has the appropriate decryption key. The second method is Steganography, where the secret message is embedded in another message, image or audio [Sha02].

 

There are two main directions in information hiding: protecting only against the detection of a secret message by a passive adversary, and hiding data so that even an active adversary cannot remove it. The classic situation, known as Simmons “Prisoners Problem”, is the following: Alice and Bob are in jail and try to discuss an escape plan, but all their communication can be observed by the warden. If their plan or the fact that they are discussing an escape plan were detected they would be transferred to a more secure prison. So they can only succeed if Alice can send messages to Bob so that the warden can’t even detect the presence of a secret [Ach98].

 

Steganographic techniques can be used to hide data within digital images with little or no visible change in the perceived appearance of the image and can be exploited to export sensitive information. Since images are frequently compressed for storage or transmission, effective steganography must employ coding techniques to counter the errors caused by lossy compression algorithms [Ande98]. The Joint Photographic Expert Group (JPEG) compression algorithm, while producing only a small amount of visual distortion, introduces a relatively large number of errors in the bitmap data [Cur02]. It is often thought that communications may be secured by encrypting the traffic, but this is not really true in practice. The history teaches that it is better hiding messages rather than enciphering them, because it arouses less suspicion [Cac01]. So the study of communications security includes not just encryption but also traffic security, whose essence lies in hiding information. Differently from cryptography that is about protecting the content of messages, Steganography is about concealing their existence [Ande98], i.e. hiding information in other information.

 

One possible approach to content security is the using of cryptographic techniques [Bena87], but those encryption systems do not completely solve the problem of unauthorized copying. All encrypted content needs to be decrypted, before it can be used, but if encryption is removed, there is no way to prove the ownership or copyright of the content.

 

Piracy of digital audio, video, pictures and books is already a common phenomenon on the internet. So the main interest is concern over copyright that drives recent research into digital “Watermarks” and “Fingerprints”. A digital watermark [Cac01] is hidden copyright messages added to the original digital data which can later be extracted or detected, while a fingerprint is hidden serial numbers. The latter is useful to identify copyright violators, checking the serial number, and to officially accuse them. Then steganography literally mean, "Covered writing" and encompasses methods of transmitting secret messages through innocuous cover carriers in such a manner that the existence of the embedded messages is undetectable [Hab06].

 

Carriers of such messages may resemble innocent images, audio, video, text. The hidden message may be plaintext, cipher text [Rob01].

Citation - Reference

All Project Materials Inc. (2020). ENCRYPTION & DECRYPTION USING DEFFIE HELLMAN ALGORITHM. Available at: https://researchcub.info/department/paper-8468.html. [Accessed: ].

ENCRYPTION & DECRYPTION USING DEFFIE HELLMAN ALGORITHM


Download Complete Project Material

Call: +2347063298784

Hire a Writer
Search Word Tags: