Team Work

Performance Comparison Of SVM ,Random Forest, And Extreme Learning Machine For Intrusion Detection

Abstract:

The principal goal guiding the design of any encryption algorithm must be security against unauthorized attacks. However, for all practical applications, performance and the cost of implementation are also important concerns. A data encryption algorithm would not be of much use if it is secure enough but slow in performance because it is a common practice to embed encryption algorithms in other applications such as e-commerce, banking, and online transaction processing applications. Embedding of encryption algorithms in other applications also precludes a hardware implementation, and is thus a major cause of degraded overall performance of the system. In this paper, the four of the popular secret key encryption algorithms, i.e., DES, 3DES, AES (Rijndael), and the Blowfish have been implemented, and their performance is compared by encrypting input files of varying contents and sizes, on different Hardware platforms. The algorithms have been implemented in a uniform language, using their standard specifications, to allow a fair comparison of execution speeds. The performance results have been summarized and a conclusion has been presented. Based on the experiments, it has been concluded that the Blowfish is the best performing algorithm among the algorithms chosen for implementation.

Existing system :

The main consideration in designing an encryption algorithm has to be the security of the algorithm against undesirable attacks. However, in the real world, performance and implementation cost is also important concerns. In this paper, security of the algorithms against attacks has not been compared. The primary focus is on comparing the encryption algorithms on the basis of their performance and ease of implementation.

In this paper, the security issues have been completely ignored, and only the performance of the leading secret key algorithms has been compared on different platforms, using input data files of varying sizes and formats.

While comparing the performance of algorithms, the time required to set up the key(s) has been ignored.

Proposed system :

* DES

* Triple DES

 * AES (Rijndael)

Data Encryption Standard (DES

DES (Data Encryption Standard) is currently the most widely used block cipher in the world. In May 1973, NIST (then NBS) called for possible encryption algorithms for use in unclassified adopted encryption algorithm and is in many standards around the world (e.g. Australian Standard AS2805.5-1985). One of the largest users of the DES is the banking industry. It is for this use that the DES was primarily standardized, with ANSI reconfirming its use for 5 year periods – in future it will be replaced with AES.

Although the DES standard is public, the design criteria used are classified. There has been considerable controversy over the design, particularly in the choice of a 56-bit key.

Triple DES (3DES)

The triple DES (3DES) algorithm was needed as a replacement for DES due to advances in key searching. 3DES is a proposal based on the existing DES, and was standardized in ANSI X9.17 & ISO 8732 and in PEM for key management. It was also proposed for general EFT standard by ANSI X9 [1]. It is backwards compatible with existing single DES (when K1=K2=K3). The 3DES algorithm uses either two or three 56-bit keys. Thus the effective key length is up to 168 bits. 3DES is defined by the following function:

C = DESK3 {DES-i

K2{DESKl(P)}

where P = Plaintext

C = Ciphertext

DESK= DES encryption using key K

DES-i K= DES decryption using key K

Advanced Encryption Standard (AES)

In September 1997, US NIST announced a call for candidate ciphers for its new Advanced Encryption Standard (AES), because clearly a replacement for DES was needed at that time [2]. The candidate ciphers were to be submitted by June 1998, and a finalist was selected in October 2000. In total 15 candidates were accepted in June 98 (6 were rejected as incomplete), and 5 were short-listed in August 99. Finally, Rijndael was selected as the AES finalist in October 2000.

NIST has released all submissions and unclassified analyses. The AES candidates are the latest generation of block ciphers, and have a significant increase in the block size – from the old standard of 64-bits up to 128-bits; and keys from 128 to 256-bits. In part this has been driven by the public demonstrations of exhaustive key searches of DES & RC-5 (at 64-bits).

SYSTEM REQUIREMENTS
SOFTWARE REQUIREMENTS:
• Programming Language : Python
• Font End Technologies : TKInter/Web(HTML,CSS,JS)
• IDE : Jupyter/Spyder/VS Code
• Operating System : Windows 08/10

HARDWARE REQUIREMENTS:

 Processor : Core I3
 RAM Capacity : 2 GB
 Hard Disk : 250 GB
 Monitor : 15″ Color
 Mouse : 2 or 3 Button Mouse
 Key Board : Windows 08/10

For More Details of Project Document, PPT, Screenshots and Full Code
Call/WhatsApp – 9966645624
Email – info@srithub.com

Facebook
Twitter
WhatsApp
LinkedIn

Enquire Now

Leave your details here for more details.