scholarly journals Symmetric Cryptographic Framework for Network Security

2019 ◽  
Vol 8 (10) ◽  
pp. 3803-3808
Keyword(s):  
Network Security ◽  
Entropy Measure ◽  
Brute Force ◽  
Symmetric Encryption ◽  
Digital Environment ◽  
Differential Attack ◽  
Mean Values ◽  
Cryptographic Algorithm ◽  
Encryption Algorithms ◽  
Brute Force Attack

In this rapidly developing digital environment, a single cryptographic algorithm becomes inefficient and incapable to hold the secrecy of data. A symmetric cryptographic framework is proposed which provides the platform for using the existing and future algorithms in a secured manner. In this research paper, totally six algorithms have been taken into the framework, two algorithms for text, three algorithms for image, and one algorithm for video. The algorithms are grouped into the proposed symmetric encryption framework which provides better network security for the adopted environment. Cryptanalysis and brute force attack have been done to assess the strength of the algorithms incorporated in the framework. Character repetition frequency and brute force attack are analyzed for text encryption algorithms. Mean values, Entropy measure, Differential attack and brute force attack are analyzed and used to assess the reliability of the image and video encryption algorithms. The framework is designed in such a way to adopt the existing and future algorithms. The proposed framework provides a bridge to achieve quality, upgradability, maintainability, and longer usability in applied applications..

A Method for Security Estimation of the Spn-Based Block Cipher Against Related-Key Attacks

2014 ◽  
Vol 60 (1) ◽  
pp. 25-45 ◽  
Author(s):  
Dmytro Kaidalov ◽  
Roman Oliynykov ◽  
Oleksandr Kazymyrov
Keyword(s):  
Block Cipher ◽  
Block Ciphers ◽  
Message Authentication ◽  
Brute Force ◽  
Symmetric Encryption ◽  
Authentication Codes ◽  
Cryptographic Primitives ◽  
Encryption Algorithms ◽  
Brute Force Attack ◽  
Symmetric Block

Abstract Symmetric block ciphers are the most widely used cryptographic primitives. In addition to providing privacy, block ciphers are used as basic components in the construction of hash functions, message authentication codes, pseudorandom number generators, as a part of various cryptographic protocols, etc. Nowadays the most popular block cipher is AES (Advanced Encryption Standard). It is used as a standard of symmetric encryption in many countries. Several years ago it was found a theoretical attack exploiting the AES key expansion algorithm that allows reducing significantly the complexity comparing to the brute force attack. This article presents an advanced method of finding the number of active substitutions that helps to estimate the security of encryption algorithms against related-key attacks. The method was applied to a prospective block cipher, which is a candidate for the Ukrainian standard

scholarly journals A New Symmetric Key Cryptographic Algorithm using Paley Graphs and ASCII Values

2021 ◽  
Vol 297 ◽  
pp. 01046
Author(s):  
Zhour Oumazouz ◽  
Driss Karim
Keyword(s):  
Brute Force ◽  
Strong Regularity ◽  
Quadratic Residues ◽  
Cryptographic Algorithm ◽  
Paley Graph ◽  
Encryption And Decryption ◽  
Symmetric Key ◽  
Brute Force Attack ◽  
The Moment ◽  
Paley Graphs

The main objective of the study conducted in this article is to introduce a new algorithm of encryption and decryption of a sensitive message after transforming it into a binary message. Our proposed encryption algorithm is based on the study of a particular graph constructed algebraically from the quadratic residues. We have exploited the Paley graph to introduce an abstract way of encryption of such message bit according to the other message bits by the intermidiate study of the neighborhood of a graph vertex. The strong regularity of the Paley graphs and the unknown behavior of the quadratic residues will play a very important role in the cryptanalysis part which allows to say that the brute force attack remains for the moment the only way to obtain the set of possible messages.

Image Encryption Algorithm Based on Chaos and S-Boxes Scrambling

2010 ◽  
Vol 171-172 ◽  
pp. 299-304 ◽  
Author(s):  
Zhuo Hui Xian ◽  
Shi Liang Sun
Keyword(s):  
Image Encryption ◽  
Chaotic Maps ◽  
Encryption Algorithm ◽  
Brute Force ◽  
Simulation Experiments ◽  
Encryption Algorithms ◽  
Brute Force Attack ◽  
Image Encryption Algorithm

Due to some features of images, traditional encryption algorithms are not suitable for practical image encryption. Considering this problem, a novel feistel network image encryption algorithm is proposed in this paper. Taking advantage of the desirable properties of mixing and sensitivity to initial parameters of chaotic maps, a sub key generator with couple chaotic maps is presented in this scheme. Meanwhile, the encryption algorithm includes a new mixing algorithm which is designed with thirty s-boxes of AES. To enhance the security of the new scheme, the encryption processes were combined in feistel network. The results of analysis and simulation experiments indicate that the scheme is secure and performed well in preventing attacks, such as brute force attack, entropy attack and statistics attack.

Scalable MD5 Crypt Cracker on PetaScale Supercomputer

2012 ◽  
Vol 532-533 ◽  
pp. 1080-1084 ◽  
Author(s):  
Zhi Cai Shi ◽  
Can Qun Yang ◽  
Qiang Wu
Keyword(s):  
Large Scale ◽  
Experimental Results ◽  
Brute Force ◽  
Full System ◽  
Computing Systems ◽  
Unix System ◽  
Cryptographic Algorithm ◽  
Brute Force Attack ◽  
Heterogeneous Programming ◽  
Password Cracking

MD5 Crypt is a cryptographic algorithm used commonly in UNIX system for authentication. Thanks to the additional randomization of the salt and complexity of the scheme, it makes the traditional password cracking techniques invalid on common computing systems so that the security of the system is guaranteed. As a result of the thriving of petaflops heterogeneous supercomputer system in recent decades, the security of MD5 Crypt is facing a threat of brute-force attack again. However, the complexity of heterogeneous programming and the sophistication of large-scale parallelism still hamper the password recovering. In this paper, we implemented brute-force attack of MD5 Crypt on Tianhe-1A，the world’s fastest supercomputer， by organizing the assignment between CPU and GPU reasonably and making several optimizations according to MD5 Crypt for GPU. Based on the experimental results, our algorithm achieves a great scalability. It checked more than 1.8 billion passwords in a second on the full system. Thus it issues a new challenge to the security of MD5 crypt for authentication.

scholarly journals FPGA Hardware Co-Simulation of Image Encryption using Hybrid Chaotic Maps Based Stream Cipher

2020 ◽  
Vol 9 (4) ◽  
pp. 215-225
Keyword(s):  
Image Encryption ◽  
Stream Cipher ◽  
Chaotic Maps ◽  
Chaotic Map ◽  
Security Analysis ◽  
Differential Attack ◽  
Finite Precision ◽  
System Generator ◽  
Encryption Algorithms ◽  
Brute Force Attack

In This paper, new model of image encryption is designed. This model using stream cipher based on finite precision chaotic maps. The model designed in efficient way by using Xilinx System Generator (XSG). Pseudo Random Bit Generator (PRBG) depends on chaotic maps is proposed to design Fixed Point Hybrid Chaotic Map-PRBG (FPHYBCM-PRBG). National Institute of Standards and Technology (NIST) randomness measures tested the randomness of the proposed FPHYBCM-PRBG system. The security analysis, such as histogram, correlation coefficient, information entropy, differential attack (NPCR and UACI) are used to analyze the proposed system. Also, FPGA Hardware Co-Simulation over Xilinx SP605 XC6SLX45T provided to test the reality of image encryption system. The results show that FPHYBCM-PRBG is suitable for image encryption based on stream cipher and outperform some encryption algorithms in sufficient way to enhance the security and robust against brute force attack with low maximum frequency and throughput.

PARTIALLY PIPELINED VLSI IMPLEMENTATION OF BLOWFISH ENCRYPTION/DECRYPTION ALGORITHM

2010 ◽  
Vol 10 (03) ◽  
pp. 327-341 ◽  
Author(s):  
P. KARTHIGAIKUMAR ◽  
K. BASKARAN
Keyword(s):  
Scenario Analysis ◽  
Hardware Implementation ◽  
Third Party ◽  
Brute Force ◽  
Case Scenario ◽  
Worst Case ◽  
Quantum Transmission ◽  
Cryptographic Algorithm ◽  
Encryption Decryption ◽  
Brute Force Attack

Information security has always been important in all aspects of life as technology controls various operations. Cryptography provides a layer of security in cases where the medium of transmission is susceptible to interception, by translating a message into a form that cannot be read by an unauthorized third party. All non-quantum transmission media known today are capable of being intercepted in one way or another. This paper seeks to implement a novel partial pipelined, robust architecture of Blowfish algorithm in hardware. Blowfish algorithm has no known cryptanalysis. The best proven attack against Blowfish till date is an exhaustive brute-force attack. This makes Blowfish an attractive cryptographic algorithm since it is not susceptible to any reasonable attack. The hardware implementation of Blowfish would be a powerful tool for any mobile device, or any technology requiring strong encryption. The proposed design uses the core_slow library for worst-case scenario analysis and attains an incredible encryption speed of 2670 MBits/sec and decryption speed of 2642 MBits/sec. The area is 5986 LUT's and the power is a mere 77 mW.

scholarly journals Smart Security Algorithm: Ensured Confidentiality and Integrity

2019 ◽  
Vol 9 (1) ◽  
pp. 1994-1998
Keyword(s):  
Brute Force ◽  
Dictionary Attack ◽  
Server Side ◽  
Hill Cipher ◽  
Man In The Middle ◽  
Private And Public ◽  
Encryption Algorithms ◽  
Brute Force Attack ◽  
Python Programming ◽  
Client Side

The main aim of this paper is to provide confidentiality, integrity to the message. It Encrypts the message when it is passing from the sender side to the receiver side. If we take the Caesar cipher it is weak against the brute force attack, dictionary attack but this algorithm is stronger against the brute-force attack and dictionary attack. It has both private and public key encryption which is unlikely for other encryption algorithms like hill cipher, play fair cipher etc. Some Encryption algorithms will prone to be attacked with man-in-the-middle attack but this will be overcome with using hash code concept. This proposal encrypts the message with the novel algorithm at the client side and does the counterpart at the server side. Algorithm implemented using python programming and proves our algorithm is stronger against brute force and dictionary attacks.

scholarly journals Developing and Evaluation of New Hybrid Encryption Algorithms

2014 ◽  
Vol 13 (1) ◽  
pp. 4038-4052
Author(s):  
DiaaSalama AbdElminaam ◽  
Hatem M. Abdul Kader ◽  
Mohie M. Hadhoud ◽  
Salah M El-Sayed
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Encryption ◽  
Wireless Sensor ◽  
Symmetric Encryption ◽  
Hybrid Encryption ◽  
Cryptographic Algorithm ◽  
Encryption Algorithms ◽  
Asymmetric Encryption ◽  
Cryptographic Techniques

Wireless Sensor networks consist of hundreds or thousands of low cost, low power and self-organizing nodes which are highly distributed. As wireless sensor networks continue to grow, so does the need for effective security mechanisms because sensor networks may interact with sensitive data. Encryption algorithms play good roles in information security systems (ISS). Those algorithms consume a significant amount of computing resources such as battery power. Wireless Sensor networks are powered by a battery which is a very limited resource. At present, various types of cryptographic algorithms provide high security to information on networks, but there are also has some drawbacks.  The present asymmetric encryption methods and symmetric encryption methods can offer the security levels but with many limitations. For instance key maintenance is a great problem faced in symmetric encryption methods and less security level is the problem of asymmetric encryption methods even though key maintenance is easy. To improve the strength of these algorithms, we propose a new hybrid cryptographic algorithm in this paper. The algorithm is designed using combination of two symmetric cryptographic techniques and two Asymmetric cryptographic techniques. This protocol provides three cryptographic primitives, integrity, confidentiality and authentication. It is a hybrid encryption method where elliptical curve cryptography (ECC) and advanced encryption (AES) are combined to provide node encryption. RSA algorithm and Blowfish are combined to provide authentication and (MD5) for integrity. The results show that the proposed hybrid cryptographic algorithm gives better performance in terms of computation time and the size of cipher text.This paper tries to present a fair comparison between the new protocols with four existing different hybrid protocols according to power consumption. A comparison has been conducted for those protocols at different settings for each protocol such as different sizes of data blocks, and finally encryption/decryption speed. Experimental results are given to demonstrate the effectiveness of each algorithm.

scholarly journals Dekripsi Algoritma Rivest-Shamir-Adleman Dengan Komputasi Paralel Menggunakan Message Parsing Interface

2017 ◽  
Vol 8 (1) ◽  
Author(s):  
Evangs Mailoa
Keyword(s):  
Parallel Computing ◽  
Parallel Computation ◽  
Message Passing ◽  
Message Passing Interface ◽  
Prime Numbers ◽  
Brute Force ◽  
Cryptographic Algorithm ◽  
Large Numbers ◽  
Long Time ◽  
Brute Force Attack

Abstract. Rivest-Shamir-Adleman algorithm is a cryptographic algorithm that is difficult to be dismantled. This is due to the difficulty of factoring large numbers modulus n into prime factors (p and q). The process of modulus factoring requires a very long time if solved by serial computation. Brute Force Attack method is used to find large prime numbers p and q with parallel computation. Applications for the factorization of prime numbers p and q are developed using Visual C ++ and Message Passing Interface, while the decryption process developed with Java. The results show a parallel computing process faster than a serial for factoring very large numbers n, and very slow if the n is too small.Keywords: Rivest-Shamir-Adleman Algorithm, Brute Force Attack, Message Passing Interface. Abstrak. Algoritma Rivest-Shamir-Adleman merupakan salah satu algoritma kriptografi yang sukar untuk dibongkar. Hal ini dikarenakan sulitnya memfaktorkan bilangan modulus n yang besar menjadi faktor-faktor prima (nilai p dan q). Proses untuk faktorisasi modulus n membutuhkan waktu yang sangat lama apabila diselesaikan dengan komputasi serial. Penelitian ini menggunakan metode Brute Force Attack untuk menemukan bilangan prima p dan q yang sangat besar yang dikerjakan secara paralel. Aplikasi untuk faktorisasi bilangan prima p dan q dikembangkan menggunakan Visual C++ memanfaatkan Message Passing Interface, sedangkan aplikasi proses dekripsi dengan Java. Hasil ujicoba menunjukkan proses komputasi paralel lebih cepat dibandingkan secara serial untuk memfaktorkan bilangan n yang sangat besar, dan menjadi sangat lambat apabila bilangan n terlalu kecil. Kata kunci: Algoritma Rivest-Shamir-Adleman, Brute Force Attack, Message Passing Interface.

Sign in / Sign up

Export Citation Format

Share Document