Brute Force Attack Research Articles

Evaluation of Rijndael Algorithm for Audio Encryption by Brute Force Attack

The use of information transfer is a major reason for the spread of information piracy, especially digital information that includes audio or other information, to preserve data. Encrypting voice messages is considered one of the most secure ways to protect information due to the difficulty of disclosing it. Our algorithm is robust, effective, efficient, and has security capabilities due to the different key lengths and block sizes (128 bits, 192 bits, or 256 bits). The Rijndael algorithm is an effective tool for encoding audio files and has won many awards. The Rijndael algorithm is compatible with many different audio formats. We will use it to encrypt WAVE files. The first step is to generate keys using the proposed method consisting of key lengths and block sizes (128 bits, 192 bits, or 256 bits). We convert the audio data into a 256 sample. After that, the cipher text will be generated for us. Once we encrypt the audio file, we will have several audio files. We will then use a proactive approach to evaluate the success of this initiative through a brute force attack to break the code. The Rijndael algorithm plays a role in this study by demonstrating the effectiveness of encryption, Reijndeal encryption, is designed to withstand brute force attacks, employs a strong key, proper encryption algorithm, secure hardware, and software to prevent side-channel attacks, and thwart cryptanalysis attempts. It also offers a cutting-edge perspective. Its primary goal is to protect data across the digital landscape during transmission, storage, and protection processes.

Generating of A Dynamic and Secure S-Box for AES Block Cipher System Based on Modified Hexadecimal Playfair Cipher

In today's digital world, the extensive use of devices, including smartphones, tablets, IoT devices, and the internet, emphasizes the necessity for strong security measures. These measures are essential to safeguard both user data and sensitive government information. As technology advances, the enhancement of cryptographic methods becomes imperative, ensuring alignment with this rapid progression. This paper introduces a novel approach to encrypting classified data using the modified AES cipher system. It employs a dynamic and secure substitution byte operation with a 4×4 matrix, replacing the static and public 16×16 S-box found in the original version of AES. To construct the presented S-box, the system makes a secret key of 56 bytes (4×14 Rounds), where each round of the AES-256 utilizes 4 bytes to generate a 4×4 Hexadecimal Playfair matrix. By altering the S-boxes in each round and block (where each block utilizes AES key expansion to generate a 56-byte secret key for the Playfair matrix), it becomes feasible to produce distinct encrypted blocks even when the original blocks remain identical. In terms of security, the effectiveness of the provided method has been verified by experimental and analytical studies including the Avalanche effect, Balanced output, Hamming distance, and Time complexity. The result shows that the Avalanche effect of the proposed method exceeds 50% and increase the time of brute force attack. Moreover, the proposed algorithm exhibits impressive execution speed, handling approximately 200 KB in just one second.

Selective Encryption Algorithm for Vectoral Geographic Data under Feature Point Grouping Strategy

Abstract. Selective encryption technology is a data security protection method that can balance encryption security and efficiency. Currently, there is ongoing research on applying this technology to vector geographic data. However, existing algorithms often use random selection methods for choosing objects to be encrypted, which results in lower security. To address this problem, we proposed a selective encryption algorithm for vector geographic data based on feature point grouping strategy. The study includes four steps: (1) Based on the user-input encryption ratio, calculate the feature point grouping thresholds for each element in the data. (2) Extract feature point sets for each element based on the grouping threshold. (3) Sort and group the feature point sets, reducing the smallest encryption unit to group objects within individual elements. (4) To reduce encryption costs and enhance the algorithm's resistance to attacks, perform frequency domain coefficient encryption and spatial domain coordinate value encryption in a stepwise manner on the group objects, ultimately producing the encryption results. The experiment showed that: (1) The decrypted encrypted data maintains consistency with the original data coordinates, achieving lossless decryption. (2) The correlation between encrypted data and the original data is significantly disrupted, resulting in a high level of randomness and thereby ensuring the algorithm's robust security. (3) The key space is substantial and highly sensitive, capable of withstanding brute force attacks. (4) The algorithm significantly improves encryption efficiency. (5) The algorithm displays resilience against deletion attacks and noise attacks. In conclusions, the proposed method enhances encryption efficiency while upholding a high level of security, thus it is an efficient selective encryption algorithm for vector geographic data.

Enhancing the security of image communication with a new hyper-chaotic system

The rapid expansion of multimedia communication necessitates the development of advanced and resilient cryptographic systems. As computational power grows, traditional encryption methods become susceptible to brute-force attacks. Cybersecurity threats are in a constant state of flux, requiring the creation of innovative cryptographic systems to outpace these developments. Chaotic systems offer a very good promise in cryptography as they are sensitive to initial conditions and parameters. In this study, the authors propose a novel hypercryptographic system (referred as NHCS) for color images that integrates a new hyperchaotic system with the RSA algorithm. This approach combines the unpredictable behavior of the hyper-chaotic system with the robust encryption capabilities of the RSA algorithm. This combination provides an additional layer of security. The hyper-chaotic systems offer a broader range of parameter values leading to chaos. Moreover, due to their four-dimensional nature, they can be employed to encrypt four-color channels. The NHCS algorithm has a large key space (of size 2704), 1024-bit RSA encrypted for higher security. The key sensitivity of this algorithm is of the order 10−16. The effectiveness of NHCS is validated through numerous test images from the USC-SIPI database and is bolstered by statistical analysis. The two indicators NPCR (∽100% ) and UACI (>33%) ensure that the system is robust against differential attacks. We perform a correlation analysis of the images and observe that correlation coefficients between adjacent pixels of the encrypted images are close to zero. Further, the information entropy values of the encrypted images are close to the ideal value 8. PSNR, MSE, and other statistical measures are found near their respective ideal values. A comparison with the other methods shows that NHCS is very promising.

AI-optimized elliptic curve with Certificate-Less Digital Signature for zero trust maritime security

The proliferation of sensory applications has led to the development of the Internet of Things (IoT), which extends connectivity beyond traditional computing platforms and connects all kinds of everyday objects. Marine Ad Hoc Networks are expected to be an essential part of this connected world, forming the Internet of Marine Things (IoMaT). However, marine IoT systems are often highly distributed, and spread across large sparse areas which makes it challenging to implement and manage centralized security measures. Despite some ongoing efforts to establish network connectivity in such environment, securing these networks remains an unreached goal. The use of Certificate-Less Digital Signatures (CLDS) with Elliptic Curve Cryptography (ECC) shows great promise in providing secure communication in these networks and achieving zero trust IoMaT security. By eliminating the need for certificates and associated key management infrastructure, CLDS simplifies the key management process. ECC also enables secure communication with smaller key sizes and faster processing times, which is crucial for resource-limited IoMaT devices. In this paper, we introduce CLDS using ECC as a means of securing IoT networks in a marine environment, creating a zero trust security framework for Internet of Marine Things (IoMaT). To increase security and robustness of the framework, we optimize the ECC parameters using two vital artificial intelligence algorithms, namely Genetic Algorithm (GA) and Particle Swarm Optimization (PSO). Evaluation results demonstrate a reduction in ECC parameter generation time by over 40% with GA optimization and 20% with PSO optimization. Additionally, the computational cost and memory usage for major ECC attacks increased significantly by up to 40% and 67% for Rho attacks, 34% and 53% for brute-force attacks, and 30% and 67% for improved hybrid attacks, respectively.

Secure Framework Optimizes QAES Technique Used for Computing in the Cloud

Several consumers are concerned about the security of their data kept in the cloud, and many see local servers as a safer choice due to perceived control. However, cloud service companies frequently promise greater security procedures and employ dedicated security specialists, making data stored in the cloud potentially more secure. When the data holder expires, new files are saved in the cloud and encrypted with the QAES technology. The data owner then receives the encrypted data request. The sender and user both analyze data before sending encoded documents to the cloud. The key will be used to remove encryption from subsequent data. If users are unable to access the desired data, they should submit a fresh request. The most recent innovation focuses on combining an enhanced form of Quantum Key Distribution (QKD) with AES. This integration resulted in Quantum-AES (QAES), a novel quantum symmetric encryption scheme. QAES is based on the development of a quantum encryption key using dynamic quantum S-Boxes (DQS-Boxes), as opposed to the frequently utilized static S-Boxes. This strategy enhances security. Comparably, time is required to build files faster than they do now. This approach prevents brute force attacks since it uses the QAES algorithm, which provides additional security.

Blockchain Based Secure File Transfer System with Password Protection

The need of secure file transfer systems is higher nowadays. In order to enhance the security and privacy of private information transferred over the internet, our paper presents a blockchain-based secure file transfer system (BSFTS) with password protection. This system takes advantage of the decentralized and immutable properties of blockchain technology to ensure that every file transfer is Safe and Secure, offering verifiable audit trails that can minimize the threats associated with data tampering and unauthorized access. Through forcing people to use strong, unique passwords for decryption as well as encryption, the combination of password protection further secures files by ensuring that only specified people may access the information. In addition to enhancing data confidentiality, this dual-layer strategy increases defences against possible cyberthreats, including phishing and brute force attacks. Research shows that the blockchain-based secure file transfer system with password protection far exceeds standard file transfer techniques in terms of security and user experience. The results illustrate that password protection and blockchain technology work together to build a robust framework for secure file sharing. For companies trying to enhance their data protection plans in the face of changing security threats in the world of technology, this study provides helpful data

The Rise of Bot-Driven Fraud: Understanding Threats and Implementing Advanced Prevention Strategies

In today’s digital landscape, the proliferation of bots has fundamentally changed the cybersecurity ecosystem. While bots were initially designed to automate simple, repetitive tasks, they have since evolved into sophisticated tools used by cybercriminals to carry out large-scale attacks. From brute force attacks and credential stuffing to account takeovers and denial of service (DoS) attacks, bots pose a growing threat to businesses across all sectors. The damage caused by bot-driven fraud extends far beyond financial losses—it affects operational efficiency, customer trust, and brand reputation. This paper explores the various types of bot-driven fraud, the consequences businesses face as a result of these activities, and the advanced prevention strategies that are being developed to counter these threats. By understanding how bots are used in cybercrime and implementing proactive defense mechanisms, businesses can reduce their vulnerability to fraud and better protect their customers and assets.

No Sum (NS) Sequence: A Tool for Quantum-Safe Cryptography

Quantum computing is emerging as a promising technology that can solve the world’s most complex and computationally intensive problems, including cryptography. Conventional cryptography is now facing a severe threat because of the speed of computation offered by quantum computers. There is a need for the standardization of novel quantum-resistant public-key cryptographic algorithms. In this article, the No-Sum (NS) sequence-based public key cryptosystem is proposed, increasing the computational resource requirement against the quantum computer-assisted bruteforce attack. In this paper, we demonstrate an elevation of security of the public key cryptosystem with NS sequence. The proposed methodology works in two phases; in the first phase, the conventional RSA algorithm is used to share the first element and offset parameter between the receiver and sender. In the second phase, prime numbers are generated from the NS sequence and used for encryption/ decryption of messages/ciphers. This paper illustrates the potential of the NS sequence in developing a quantum-resistant cryptosystem, contributing to the advancement of secure communication in the quantum computing era.

LINGPASS: An approach for multilingual passphrase generation by integrating English and Tamil

AbstractIn today's world of ever‐increasing cyber threats, safeguarding digital accounts is paramount. Traditional passwords are often vulnerable to brute force attacks and can be easily guessed, leading to a shift towards passphrases. However, using monolingual passphrases can pose several challenges, such as lack of diversity, predictability, memorability, and accessibility. To address this issue, this paper presents a model called LINGPASS, short for Language INtegrated Graph‐based PASSphrase, which generates multilingual passphrases by combining English and Tamil languages. The proposed approach is implemented as a web application for user convenience, and the entropy of the passphrase is evaluated using Shannon entropy. The LINGPASS model generates higher entropy passphrases than existing multilingual passphrase generators, increasing the security of digital accounts. By integrating two languages, LINGPASS increases the entropy of the passphrase by approximately 72%, making it less vulnerable to dictionary attacks. Additionally, the copy/paste functionality reduces typing errors, making it more user‐friendly.

A comprehensive investigation of an LTE-enabled smart door system using the Arduino UNO

Traditional residential security systems frequently lack remote access and real-time reaction capabilities, necessitating home automation security technology developments. With the rise of the Internet of Things (IoT), solutions such as the Smart Door are prepared to transcend these constraints by leveraging modern communication technology. The article aims to develop, implement, and evaluate an LTE-enabled Smart Door system built on the Arduino Uno platform. The goal is to improve home security by offering keyless entry, real-time surveillance, and remote operation, increasing user convenience and system reliability. We created a Smart Door system with an Arduino Uno microcontroller and LTE connectivity. The system's performance was measured using a variety of measures, including response time, reliability, and security against unwanted access. Testing included simulation environments and real-world scenarios to ensure the system's operational efficacy and security. The Smart Door system performed admirably, with a reaction time of less than two seconds in 95% of commands and strong resilience to brute force attacks. It effectively incorporated keyless entry, live video streaming, and real-time alarms, all controlled by a smartphone app, demonstrating the system's dependability and efficiency in live scenarios. The LTE-enabled Smart Door system considerably improves over traditional home security options. It provides enhanced security, simple operation, and more outstanding remote management capabilities by utilizing IoT technology. These enhancements fill essential holes in existing systems, providing a safer, dependable, and convenient answer for modern home security requirements.

A robust color image encryption scheme with complex whirl wind spiral chaotic system and quadrant-wise pixel permutation

This paper presents a novel encryption technique that uses a unique chaotic circuit design called as 3D Complex Whirl Wind Spiral chaotic system (CWWS). The major goal of this novel approach is to create an efficient 3D chaotic systems with increased randomness and multistability, specifically designed to encrypt multimedia data. The design incorporates the sine function sin(x) to introduce complexity and unpredictability in the chaotic circuit. The dynamic behaviour of the proposed scheme’s chaotic system is thoroughly evaluated using a variety of analyses, including KY dimension, dissipativity, Lyapunov exponent spectra, and bifurcation diagrams. There are two key stages to the encryption process: diffusion and confusion. The diffusion process is strengthened by the smooth integration of quadrant-wise pixel permutation (QWPP) algorithms, which eliminate correlations between neighbouring pixels. Following that, the image components are concealed using the chaotic sequence that was generated from the 3D CWWS chaotic system. The complete encrypted image is then created by combining these encrypted components. The simulation results of the proposed strategy are thoroughly investigated using statistical analysis, differential analysis, and brute force attacks. The system has optimal key space, entropy, UACI, and NPCR metric values of 2400, 7.99, 0.334, and 0.996, respectively. Furthermore, the experimental findings show robust resistance to statistical, differential, and brute force attacks for a single round of iteration.

Advance in Applied Cryptography Theory: Survey and New Results. Part 1. Key Cryptography

In the current paper, consisting from two parts, are presented both results already published before (but hard for access) and new once. Actuality of this work is firstly in a fact that recently has been obtained a number of new results in area of applied cryptography that are needed both in a clarification and be put into practice. This is namely the main goal of the current paper. The setting problem in the first paper part concerns to a complexity of symmetric cipher breaking while in the second part of the paper is discussed, so called, keyless cryptography, namely: wiretap channel concept, execution of communication channels which allow to provide information security without of key exchange procedure between legal correspondences. In the part widely used methods of applied mathematics, namely: algebra, number, probability and information theories. Computer simulation also used there. A novelty of the first part of work consists in the following: first of all it is clarified the sense of a key lifetime limitation for different symmetric cipher modes, secondly, it is explained an approach of cipher breaking by the use of quantum computers, finely, the key authentication for the Diffie ‒ Hellman protocol based on the mobile device pairing technology is investigated in detail. In the second part of the current paper has been presented a vulnerability of Dean ‒ Goldsmith cryptosystem under some extension of attacks. The main results of this paper are: estimation of the key lifetime of single key for symmetric cipher in CBC mode, clarifying of Grover’s algorithm breaking of symmetric ciphers by brute force attack, development of a method for authentication of Diffie ‒ Hellman values based on pre-distributed sequences, selection of ciphers which allow to execute with Shamir’s protocol without any key sharing in advance, breaking of Dean ‒ Goldsmith protocol under some conclusions, proof the fact regarding of a possible breakability of the key sharing protocol over noiseless communication channels. Practical application of paper results consists in the fact of stimulation the correct choice of ciphers and their parameters in order to provide their resistance to different attacks and more attention to algorithms of keyless cryptography.

A New Diffusion Strategy Using an Epidemic Spreading Model for Encryption.

The diffusion phenomenon that exhibits intrinsic similarities is pervasive in cryptography and natural systems, evident in liquid diffusion, epidemic spread, animal migration, and encryption techniques. In cryptography, bytes are systematically diffused in a sequential manner to encrypt the value of each byte in the plaintext in a linear fashion. In contrast, within an epidemic spreading model, the diffusion process can be represented within a complex, multilayered network, encompassing layers such as familial and social transmission dynamics. Transmission links establish connections both within and between individual layers. It has had a more rapid spread than linear approaches due to the particularization of non-linear transmission. In this study, the novelty of a cryptography diffusion strategy based on an epidemic model is first proposed, in which pixels and their dynamic adjacency are considered as vertices and edges, respectively, within a complex network framework. Subsequently, the encryption process is governed by the Susceptible-Vaccinated-Infected-Recovered (SVIR) model integrated with chaotic dynamics. Simulation results demonstrate that the proposed algorithm exhibits faster encryption speed while effectively resisting brute force, statistical, and differential attacks. Furthermore, it demonstrates strong robustness against noise interference and data loss.

An Improved Multi-Chaotic Public Key Algorithm Based on Chebyshev Polynomials

Due to the similar characteristics of chaotic systems and cryptography, public key encryption algorithms based on chaotic systems are worth in-depth research and have high value for the future. Chebyshev polynomials have good properties and are often used in the design of public key algorithms. This paper improves the Bose Multi-Chaotic Public Key Cryptographic Algorithm (BMPKC) by applying Chebyshev polynomials. The proposed algorithm (CMPKC-) introduces the selective coefficient based on the properties of Chebyshev polynomials, allowing the special functions that need to be negotiated in the original system to be freely and randomly chosen as Chebyshev polynomials, and can also be expanded to m levels. The improved cryptographic algorithm also utilizes chaotic hash functions and logistic mapping to generate pseudo-random sequences and overcomes shortcomings of the Bose algorithm by iteratively iterating the selected Chebyshev polynomials based on the number of 0s or 1s in the pseudo-random sequence, thus providing better security. Analysis and software testing results indicate that this algorithm has strong robustness against brute force attacks, achieving a higher attack time for breaking the private key compared to the CEPKC, BMPKC, and CMPKC algorithms. Compared to the CMPKC algorithm, our proposal algorithm achieves better performance in the encryption and decryption phases. Furthermore, we combine this Multi-Chaotic System Key Exchange Protocol with the Advanced Encryption Standard (AES) algorithm, while providing a demonstration, offering more possibilities for practical applications of this system.

Hybrid Block Chaotic Compressive Sensing and Chaotic Scrambling Algorithms for Color Image Encryption System

This paper suggests a new image encryption algorithm based on block compressive sensing (BCS) and chaotic scrambling techniques. With compressive sensing (CS), signals can be sampled much lower than the Nyquist-Shannon rate while preserving their information content. BCS can be used as a one-step process by using a 3D logistic chaotic map, the measurement matrix is used as a secret key for encryption. BCS algorithm used an individual image reconstruction algorithm that leverages l_1norm minimization to promote signal sparsity, and a smoothing operator to enhance image quality. An encrypted image is first decomposed into three sub-images based on the tricolor theory; then, a discrete wavelet transform is used to sparsely process the three decomposed images. A 2D Henon map is used to scramble the compressed image after compression. This process further enhances the security of the system by increasing the complexity of the encryption process. The results showed that the proposed system provides better security and has a lower computational complexity than other methods. Furthermore, the proposed system is resistant to known attacks such as brute force and statistical attacks.

Sudoku Solver – A Novel Approach Using Recognition of Printed Text Image

Detecting and analyzing text in multimedia is required for recognition of characters which can be used for performing multi-objectives in numerous research areas and applications. Characters or numbers in images can be hand-written, printed document, typewritten or artificially added for the purpose of searching or indexing, editing or image understanding. Various applications such as License Plate Detection, Handwritten documents recognition, Sudoku Solving, multi-oriented recognition focuses on character recognition. Image Sudoku solver works on Sudoku puzzle images. In this paper, the printed text Sudoku image is used as the input. The image is enhanced by filling the horizontal and vertical gaps in the grids that may occur due to shadow or distortion of the scanned image such that all the 81 grids are extracted. Secondly, the numbers and grids in the enhanced image are extracted and a dancing link approach using Algorithm X is adopted to solve the Sudoku. The proposed work is compared with a backtracking approach and dancing link approach without enhancing the image and its computation time for various ranks of difficulty of a puzzle taken. The Sudoku puzzle can be used to secure information stored in an image as the number of solutions to solve a Sudoku puzzle is very large, allowing it to be used as a security tool resistant to brute force attacks.

Composite Fixed-Length Ordered Features with Index-of-Max Transformation for High-Performing and Secure Palmprint Template Protection

Palmprint recognition has attracted considerable attention due to its advantages over other biometric modalities such as fingerprints, in that it is larger in area, richer in information and able to work at a distance. However, the issue of palmprint privacy and security (especially palmprint template protection) remains under-studied. Among the very few research works, most of them only use orientational features of the palmprint with transformation processing, yielding unsatisfactory recognition and protection performance. Thus, this research work proposes a palmprint feature extraction method for palmprint template protection that is fixed-length and ordered in nature, by fusing point features and orientational features. Firstly, dual orientations are extracted and encoded with more accuracy based on the Modified Finite Radon Transform (MFRAT). Then, SURF feature points are extracted and converted to be fixed-length and ordered features. Finally, Composite Fixed-Length Ordered Features that fuse up the dual orientations and SURF points are transformed using the irreversible transformation of Index-of-Max (IOM) to generate the revocable palmprint templates. Experiments show that the matching accuracy of the proposed method of fixed-length and ordered point features are superior to all other feature extraction methods on the PolyU and CASIA datasets. It is also demonstrated that the EERs before and after IOM transformation are better than all other representative template protection methods. A thorough security and privacy analysis including brute-force attack, false accept attack, birthday attack, attack via record multiplicity, irreversibility, unlinkability and revocability is also given, which proves that our proposed method has both high performance and security.

A Comparative Study Between Two Cybersecurity Attacks: Brute Force and Dictionary Attacks

In today's world, information drives not only business but nearly every aspect of human life. Therefore, safeguarding valuable information from malicious activities like attacks has become essential. Brute force search and dictionary attacks are prevalent cybersecurity threats, in which an attacker systematically attempts all possible passwords and passphrases to gain access to a user's account. These types of attacks are common due to the widespread reuse of simple password variations. The goal of this study is to discover as many passwords as possible and demonstrate their predictability and susceptibility. Our focus was on comparing two cracking methods, such as brute force search attacks and dictionary attacks, assessing their effectiveness and time requirements.

COLOR IMAGE ENCRYPTION THROUGH MULTI-S-BOX GENERATED BY HYPERCHAOTIC SYSTEM AND MIXTURE OF PIXEL BITS

The growing demand for maintaining secure communication channels with the advancements in digital technologies has led to an intensified interest in designing reliable image encryption schemes. Despite various encryption schemes that have been used, some are considered to have insecurity regarding data transmission and multimedia. Motivated by this concern, this paper proposes a new color image encryption algorithm of a multi-key generation-based nD-Hyperchaotic (HC) system. The new algorithm achieves Shannon’s confusion and diffusion principles using a two S-box generation approach, where the first S-box is generated from the proposed nD-HC system and the resulting sequence is used to increase encryption complexity, while the second S-box is generated from ([Formula: see text])D-HC system. Afterward, mathematical analysis is carried out to showcase the robustness and efficiency of the proposed algorithm, as well as its resistance to visual, statistical, differential, and brute-force attacks. The proposed scheme successfully passes all NIST SP 800 suite tests. The cryptographic system demonstrated by the proposed scheme has proven to have outstanding performance through simulation tests, which indicates promising potential applicability aspects in secure and real-time image communication settings.