Search

The MQTT (Message Queuing Telemetry Transport) protocol used the pub-sub model for IoT communication. Bolstering security with two-way authentication becomes a critical necessity. This paper presents a novel algorithm that fortifies MQTT with enhanced security measures, utilizing a refined MQTT implementation that integrates with a Merkle tree. HBMQTT Broker increases security as it uses different plugins, like the authentication plugin and the authorization plugin. These plugins serve to add extra layers of protection, reinforcing security protocols and heightening resilience to potential threats. The Merkle tree integration enhances data security during data transmission, effectively distinguishing between authentic and inauthentic data streams. Merkle trees generate tokens, which are used for secure data transmission. The algorithm is tested with four different hacking adversarial attacks: man-in-The-Middle (MITM), malware attack, denial of service (DoS), and phishing attack. Space and time complexity are also calculated for these attacks.

We live in a world where the Internet has become the backbone of most of our dealings. The Internet has turned this big planet into a small village. The internet can be reached by everyone, everywhere, and anytime. Some authors predict that the number of various types of devices capable of connecting via the Internet will reach 75.44 billion by 2025. These devices vary from low processing power processors to heavy processing power processors. It often requires the protection of mobile data between devices, these devices that have limited energy and resources require the protection technology to be adapted This paper gives complete guidelines for adapting the original Data Encryption Standard Algorithm (DES) and make it more secure and better performance than existing standard encryption algorithms, such as Advanced Encryption Standard (AES). The proposed approach improves the original DES security by extending the key size of DES without affecting the cost of DES. The new algorithm is called DES22, and it is convenient for low processing power devices, such as wireless sensors. DES22 has three variants for key size: 128 bits, 256 bits and 512 bits. The paper also proposes another improvement to DES through random permutation and the distribution of the initial permutation and final permutation tables between the encryption and decryption algorithms. The experiment results show that DES22 is more secure and faster than AES. [JJCIT 2022; 8(1.000): 18-32]

The Advanced Encryption Standard (AES) is widely recognized as a robust cryptographic algorithm utilized to protect data integrity and confidentiality. When it comes to lightweight implementations of the algorithm, the literature mainly emphasizes area and power optimization, often overlooking considerations related to performance and security. This paper evaluates two of our previously proposed lightweight AES implementations using both profiled and non-profiled attacks. One is an unprotected implementation, and the other one is a protected version using Domain-Oriented Masking (DOM). The findings of this study indicate that the inclusion of DOM in the design enhances its resistance to attacks at the cost of doubling the area.

The Advanced Encryption Standard (AES) has become an attractive encryption method for its high security and fast implementation. The encryption algorithm is approved as a standard to be used in widely used communication and data processing units However, the advance in technology and the introduction of quantum computers made the encryption scheme vulnerable to attack. Different attack procedures are continuously being developed for attacking end decrypted important and sensitive data. This paper evaluated an enhanced Advanced Encryption System operating in Cipher Block Chaining mode that suggests a promising solution for resisting future attacks. The approach depends on a time-dependent initialization vector that produces the initialization vector block depending on the epoch time without sharing any encryption key. The evaluation process includes correlation analysis, global and local Shannon entropy analysis, chi-square analysis, histogram analysis, and differential analysis. The results showed that the enhanced encryption scheme is reliable and can resist most cyber-attacks without exposing any encrypted data to the public. The results were compared with previously published and tested algorithms and found that it satisfies and exceeds the minimum requirement. So, the encryption method can be implemented safely in future communication channels or used in the file encryption process. . .

The proliferation of mobile phones with integrated sensors makes large scale sensing possible at low cost. During mobile sensing, data mostly contain sensitive information of users such as their real-time location. When such information are not effectively secured, users’ privacy can be violated due to eavesdropping and information disclosure. In this paper, we demonstrated the possibility of unauthorized access to location information of a user during sensing due to the ineffective security mechanisms in most sensing applications. We analyzed 40 apps downloaded from Google Play Store and results showed a 100% success rate in traffic interception and disclosure of sensitive information of users. As a countermeasure, a security scheme which ensures encryption and authentication of sensed data using Advanced Encryption Standard 256-Galois Counter Mode was proposed. End-to-end security of location and motion data from smartphone sensors are ensured using the proposed security scheme. Security analysis of the proposed scheme showed it to be effective in protecting Android based sensor data against eavesdropping, information disclosure and data modification.

Differential fault attack (DFA) is a distinctive methodology for acquiring the key to block ciphers, which comprises two distinct strategies: DFA on the state and DFA on the key schedule. Given the widespread adoption of the Advanced Encryption Standard (AES), it has emerged as a prominent target for DFA. This paper presents an efficient DFA on the AES, utilizing a two−byte fault model that induces faults at the state with discontiguous rows. The experiment demonstrates that, based on the proposed fault model, the key for AES–128, AES–192, and AES–256 can be successfully recovered by exploiting two, two, and four faults, respectively, without the need for exhaustive research. Notably, in the case of AES–256, when considering exhaustive research, two (or three) faults are needed with 232 (or 216) exhaustive searches. In comparison to the currently available DFA on the AES state, the proposed attack method shows a higher efficiency due to the reduced induced faults.

A Vehicular Ad-hoc Network (VANET) is a type of Mobile Ad-hoc Network (MANET) that is used to provide communications between nearby vehicles, and between vehicles and fixed infrastructure on the roadside. VANET is not only used for road safety and driving comfort but also for infotainment. Communication messages in VANET can be used to locate and track vehicles. Tracking can be beneficial for vehicle navigation using Location Based Services (LBS). However, it can lead to threats on location privacy of vehicle users; since it can profile them and track their physical location. Therefore, to successfully deploy LBS, user's privacy is one of major challenges that must be addressed. In this paper, we propose Privacy-Preserving Fully Homomorphic Encryption over Advanced Encryption Standard (P2FHE-AES) scheme for LBS query. This scheme is required for location privacy protection to encourage drivers to use this service without any risk of being pursued. It is implemented using Network Simulator (NS-2), Simulation of Urban Mobility (SUMO), and Cloud simulation (CloudSim). Analysis and evaluation results demonstrate that P2FHE-AES scheme can preserve the privacy of the drivers' future routes in an efficient and secure way. The results prove the feasibility and efficiency of P2FHE-AES scheme in terms of query's response time, query accuracy, throughput and query overhead.

This paper proposes an image encryption scheme based on a discrete-time alternating quantum walk (AQW) and the advanced encryption standard (AES). We use quantum properties to improve the AES algorithm, which uses a keystream generator related to AQW parameters to generate a probability distribution matrix. Some singular values of the matrix are extracted as the key to the AES algorithm. The Rcon of the AES algorithm is replaced with the elements of the probability distribution matrix. Then, the ascending order of the size of the clone probability distribution matrix scrambles the mapping rules of the S-box and ShiftRow transformations in the AES algorithm. The algorithm uses a probability distribution matrix and plaintext XOR operation to complete the preprocessing and uses the modified AES algorithm to complete the encryption process. The technology is based on simulation verification, including pixel correlation, histograms, differential attacks, noise attacks, information entropy, key sensitivity, and space. The results demonstrate a remarkable encryption effect. Compared with other improved AES algorithms, this algorithm has the advantages of the original AES algorithm and improves the ability to resist correlation attacks.

The need for cloud storage grows day after day due to its reliable and scalable nature. The storage and maintenance of user data at a remote location are severe issues due to the difficulty of ensuring data privacy and confidentiality. Some security issues within current cloud systems are managed by a cloud third party (CTP), who may turn into an untrustworthy insider part. This paper presents an automated Encryption/Decryption System for Cloud Data Storage (AEDS) based on hybrid cryptography algorithms to improve data security and ensure confidentiality without interference from CTP. Three encryption approaches are implemented to achieve high performance and efficiency: Automated Sequential Cryptography (ASC), Automated Random Cryptography (ARC), and Improved Automated Random Cryptography (IARC) for data blocks. In the IARC approach, we have presented a novel encryption strategy by converting the static S-box in the AES algorithm to a dynamic S-box. Furthermore, the algorithms RSA and Twofish are used to encrypt the generated keys to enhance privacy issues. We have evaluated our approaches with other existing symmetrical key algorithms such as DES, 3DES, and RC2. Although the two proposed ARC and ASC approaches are more complicated, they take less time than DES, DES3, and RC2 in processing the data and obtaining better performance in data throughput and confidentiality. ARC outperformed all of the other algorithms in the comparison. The ARC’s encrypting process has saved time compared with other algorithms, where its encryption time has been recorded as 22.58 s for a 500 MB file size, while the DES, 3DES, and RC2 have completed the encryption process in 44.43, 135.65, and 66.91 s, respectively, for the same file size. Nevertheless, when the file sizes increased to 2.2 GB, the ASC proved its efficiency in completing the encryption process in less time.

For achieving security in wireless sensor networks (WSNs), cryptography plays an important role. In this paper, a new security algorithm using combination of both symmetric and asymmetric cryptographic techniques is proposed to provide high security with minimized key maintenance. It guarantees three cryptographic primitives, integrity, confidentiality and authentication. Elliptical Curve Cryptography (ECC) and Advanced Encryption Standard (AES) are combined to provide encryption. XOR-DUAL RSA algorithm is considered for authentication and Message Digest-5 (MD5) for integrity. The results show that the proposed hybrid algorithm gives better performance in terms of computation time, the size of cipher text, and the energy consumption in WSN. It is also robust against different types of attacks in the case of image encryption.

The majority of imaging techniques use symmetric and asymmetric cryptography algorithms to encrypt digital media. Most of the research works contributed in the literature focus primarily on the Advanced Encryption Standard (AES) algorithm for encryption and decryption. This paper propose an analysis for performing image encryption and decryption by hybridization of Elliptic Curve Cryptography (ECC) with Hill Cipher (HC), ECC with Advanced Encryption Standard (AES) and ElGamal with Double Playfair Cipher (DPC). This analysis is based on the following parameters: (i) Encryption and decryption time, (ii) entropy of encrypted image, (iii) loss in intensity of the decrypted image, (iv) Peak Signal to Noise Ratio (PSNR), (v) Number of Pixels Change Rate (NPCR), and (vi) Unified Average Changing Intensity (UACI). The hybrid process involves the speed and ease of implementation from symmetric algorithms, as well as improved security from asymmetric algorithms. ECC and ElGamal cryptosystems provide asymmetric key cryptography, while HC, AES, and DPC are symmetric key algorithms. ECC with AES are perfect for remote or private communications with smaller image sizes based on the amount of time needed for encryption and decryption. The metric measurement with test cases finds that ECC and HC have a good overall solution for image encryption.

Information security is a very important issue in data communication. Any loss or threat to information transfer can prove to be great loss in the process of sending information. Encryption technique plays a main role in information security systems. The advanced encryption standard algorithm is widely accepted due to its strong encryption, complex processing and its resistance to Brute-force attack. This paper presents a proposed algorithm to enhance the encryption process of advanced encryption standard algorithm (AES) by introducing a new algorithm to generate dynamic S-Box from cipher key. This algorithm will lead to generate more secure block ciphers, and solve the problem of the fixed structure S-Boxes and will increase the security level of the AES block cipher system. The main advantage of this algorithm is that many S-Boxes can be generated by changing cipher key. The proposed algorithm leads to increase the complexity of encryption process and makes the differential and linear cryptanalysis more difficult. MATLAB (R2013a) program is used for simulation.