Data could be in many forms like text, image, audio, video and many others. Amongst these data, processing image is of important concern even with sophisticated technologies. Generally, images consume more storage space and processing time. This work aims in attaining a novel image encryption strategy that consumes very less computational time with maximum security. The idea is to split the image into blocks and rearrange the pixels in diagonal fashion to achieve confusion. Next, the blocks are combined to form sub images and one block of the sub image is subjected to Secure Hash Algorithm (SHA 512 bits). The SHA bits are XORed with the remaining blocks of the sub image. Finally, the entire image is encrypted using Advanced Encryption Standard (AES). Decryption process is the exact reverse of encryption process. The computational overhead is very low, and security is efficient. The results are compared with existing encryption techniques.

MAACS is a software architecture which layers multiple standard cipher algorithms together to increase the overall strength of the encrypted data stream, without modifying the standard algorithms, which have been heavily vetted from a cryptanalysis perspective and are already widely deployed. This layering technique makes the combination of algorithms significantly more resistant to traditional cryptanalysis attacks, while also addressing increased concerns over future quantum computing attacks against these algorithms. For example, concerns over published attacks against 256-bit AES and potential future attacks emanating from Grover’s algorithm and other unknowns in the quantum computing era are explored. Several approaches for evolving AES are considered. MAACS uses a concept termed "aperiodic modulation", whereby of a set of cryptographic algorithms are modified by an- other, independent software algorithm in an unpredictable, pseudo-random manner. In the MAACS reference architecture, a 256-bit ChaCha20 cryptographically secure pseudorandom number generator (CSPRNG) drives an aperiodic modulator that orchestrates encryption/decryption processes multiplexed across eight parallel 128-bit AES instances, yielding a cryptosystem with a composite strength of 1,376 bits or more in larger configurations.

: In today’s rapidly expanding era of the Internet of Things (IoT) and the Industrial Internet of Things (IIoT), the emphasis on robust data security and insightful data interpreta- tion is more pronounced than ever. This research introduces a comprehensive approach to both data protection and predictive analytics, leveraging the diverse dataset TON IoT.csv, sourced from a myriad of IoT and IIoT environments. For data security, a dual-encryption technique incorporating both AES and RSA algorithms is established. Its efficacy is evidenced by a perfect match between the original and decrypted datasets, underscoring the integrity of our encryption process. Concurrently, the study ventures into predictive modeling using a modified Snake Optimization Algorithm (SOA) to streamline hyperparameter selection. This subsequently aids in the development and fine-tuning of an LSTM network, which exhibits remarkable predictive accuracy. Additionally, the paper provides an in-depth examination of various encryption methodologies like elliptic curve cryptography (ECC), Lightweight Cryptography for Cloud computing, and homomorphic encryption, while also emphasizing the nuances of encryption in cloud setups, particularly contrasting server-side with client-side encryption and efficient key management. The insights presented serve as a cornerstone for ensuing research, promising a bright future for advancements in IoT and IIoT data protection and analysis

The focus of this research is to analyze the results of encrypting audio using various authenticated encryption algorithms implemented in the Python cryptography library for ensuring authenticity and confidentiality of the original contents. The Advanced Encryption Standard (AES) is used as the underlying cryptographic primitive in conjunction with various modes including Galois Counter Mode (GCM), Counter with Cipher Block Chaining Message Authentication Code (CCM), and Cipher Block Chaining (CBC) with Keyed-Hashing for encrypting a relatively small audio file. The resulting encrypted audio shows similarity in the variance when encrypting using AES-GCM and AES-CCM. There is a noticeable reduction in variance of the performed encodings and an increase in the amount of time it takes to encrypt and decrypt the same audio file using AES-CBC with Keyed-Hashing. In addition, the corresponding encrypted using this mode audio spans a longer duration. As a result, AES should either have GCM or CCM for an efficient and reliable authenticated encryption integration within a workflow.

With the emerging technology connected with the internet, there is one constant issue related to that is data security. The only solution with which this issue can be resolved at a limit and can be used to protect the data is various algorithms for encryption. Though different approaches were used for the same, Cryptography seems to be efficiently protecting the data while transmitting in network from sender to receiver. Firstly the data is encrypted before sending to receiver using the most secure and reliable encryption algorithm. Secondly, at the receiver end it can be decrypted using the same decryption algorithm. Only receiver will have the key with which the data can be decrypted. In this paper, AES, DSS and RSA algorithms were implemented. These algorithms are encryption algorithms which perform encoding and decoding of data, to be sent from sender to receiver, using the keys. Each have different criteria for encryption and are then compared based on different parameters viz. delay, throughput, PDR is an acronym for packet delivery ratio, PLR represents packet loss ratio and RPC denotes Received Packet Count. The results in the form of graphs are given to analyze the security provided by each algorithm.

In recent years, CPU caches have revealed themselves as one of the most powerful sources of information leakage. This information leakage affects any implementation whose memory accesses, to data or instructions, depend on sensitive information such as private keys. In most cases, side-channel cache attacks do not require any specific permission and just need access to a shared cache. This fact, combined with the spread of cloud computing, where the infrastructure is shared between different customers, have made these attacks quite popular. In this paper, we present a novel approach to exploit the information obtained from the CPU cache. First, we introduce a non-access attack that provides a 97\% reduction in the number of encryptions required to obtain a 128-bit AES key. Next, this attack is adapted and extended in what we call the encryption-by-decryption cache attack or EBD, to obtain a 256-bit AES key. When EBD is applied to AES-256, we are able to obtain the 256 bits of the key with less than 10000 encryptions. These results make EBD, to the best of our knowledge, the first practical attack on AES-256 and also demonstrate that AES-256 is only about 3 times more complex to attack than AES-128 via cache attacks. In both cases the target is the AES T-table-based implementation, and we also demonstrate that our approach works in a cross-VM scenario.

This paper provides a comparative analysis of AES (Advanced Encryption Standard) and Salsa20 algorithm implementations, focusing on power consumption efficiency in passive RFID (Radio Frequency Identification) tags and ultra-low-power devices. The main objective of this work is to determine which of these algorithms is more suitable to operate in these types of devices. For this purpose, ASIC (Application-Specific Integrated Circuit) implementations of AES and Salsa20 based on low-power approaches were developed and their power consumption was evaluated. Results demonstrate that Salsa20 power consumption is lower than AES (2.82μW and 4.01μW, respectively - both in 0.18μm), indicating that Salsa20 is a better choice than AES for passive RFID tags.

User-generated passwords often pose a security risk in authentication systems. However, providing a comparative substitute poses a challenge, given the common tradeoff between security and user experience. This paper integrates cryptographic methods (both asymmetric and symmetric), steganography, and a combination of physiological and behavioral biometrics to construct a prototype for a passwordless authentication system. We demonstrate the feasibility of scalable passwordless authentication while maintaining a balance between usability and security. We employed threat modeling techniques to pinpoint the security prerequisites for the system, along with choosing appropriate cryptographic protocols. In addition, a comparative analysis is conducted, examining the security impacts of the proposed system in contrast to that of traditional password-based systems. Results from the prototype indicate that authentication is possible within a timeframe similar to passwords (within 2 seconds), without imposing additional hardware costs on users to enhance security or compromising usability. Given the scalable nature of the system design and the elimination of shared secrets, the financial and efficiency burdens associated with password resets are alleviated. Furthermore, the risk of breaches is mitigated, as there is no longer a need to store passwords and/or their hashes. Differing from prior research, our study presents a pragmatic design and prototype that deserves consideration as a viable alternative for both password-based and passwordless authentication systems.

This work introduces a novel facial image capture system that utilizes computer vision technology and artificial intelligence for real-time detecting, tracking, and capturing of human faces. The objective of this study is to address the challenges posed by poor-quality facial images in biometric authentication, especially in passport photo acquisition and recognition. By combining face-aware capture technology with AES encryption for secure image storage, we present a completely open-source hardware solution that consists of a Jetson processor, a 16MP autofocus RGB camera, a custom enclosure, and a touch sensor LCD for user interaction. Pilot data collection demonstrates the system's ability to capture high-quality images, achieving a 98.98% accuracy in storing images of acceptable quality. The integration of AES encryption ensures data security, making the proposed system suitable for real-time applications in other domains beyond identity verification in passport applications, such as security systems, video conferencing, etc

Among the possible improvements of Autonomous Emergency Braking (AEB) systems, reducing the intensity of the automatic braking process by studying the kinematics and general behavior of the pedestrian while crossing is crucial to determine the progressiveness of the braking, or replacing part of the braking process by an evasive maneuver when a collision is imminent. This paper proposes the integration of an autonomous avoidance system (Automatic Emergency Steering, AES) that acts directly on the steering system to generate an evasive maneuver and avoid a possible pedestrian collision (OPREVU-AES system), as well as the assessment of its effectiveness compared to a commercial AEB system. OPREVU and VULNEUREA are research projects in which INSIA and CEDINT have cooperated to improve driving assistance systems and the safety of pedestrians and cyclists through Virtual Reality (VR) techniques. The analysis of the kinematic and dynamic response of the OPREVU-AES system is conducted in CarSim© software. The effectiveness evaluation procedure is based on the reconstruction of a sample of road vehicle-to-pedestrian crashes (INSIA-UPM database), using the PCCrash® software, and taking as an indicator the probability of head injury severity (ISP). The results show that the AEB system would have prevented part of the collisions, especially after the incorporation of the OPREVU-AES system. In most of the cases where avoidance is not possible, a significant reduction of the ISP is achieved.

The Onion Route Network (also called TOR) is by far the most efficient and widely used anonymity platform with millions of users daily and an expanding size and capacities. Since its public deployment in 2002, the Onion Routing network (also known as TOR) has maintained its leading position and dozens of propositions aiming to improve its performance and enhance the security (anonymity and privacy) have been made. Given the significance of this research area, this work seek to contribute into the improvement of TOR by investigating and testing revolutionary cryptographic and routing mechanism. This work is justified by the current TOR vulnerability and observed weaknesses, and set the challenging aim of covering these security flaws by proposing the relevant security and performances improvement such as the authenticated-encryption for onion construction, the lightened onion encapsulation approach and the secured circuit selection and cell routing mechanisms. The obtained results from implementing the proposed improvements and testing them into a TOR-like simulation platform permit to validate not only, the performances and security contributions brought by the improvement, but also the suitability of their potential implementation into the real TOR network.

H-adaptivity is an effective tool to introduce local mesh refinement in FEM-based numerical simulation of crack propagation. The implementation of h-adaptivity could benefit the numerical simulation of fatigue or accidental load scenarios involving large structures such as ship hulls. In engineering applications, the element deletion method is frequently used to represent cracks. However, the element deletion method has some drawbacks such as strong mesh dependency and loss of mass or energy. In order to mitigate this problem, the element splitting method could be applied. In this study, a numerical method called ‘h-adaptive element splitting’ (h-AES) is introduced. The h-AES method is applied in FEM programs by combining h-adaptivity with the element splitting method. Two examples using the h-AES method to simulate cracks in large structures under linear-elastic fracture mechanics scenario are presented. The numerical results are verified against analytical solutions. Based on the examples, the h-AES method is proven to be able to introduce mesh refinement in large-scale numerical models that consist of structured coarse meshes. By employing the mesh refinement introduced in this paper, very small cracks are well represented in large structures.