TriviA: A Fast and Secure Authenticated Encryption Scheme

<p>In this paper we present the design of a new encryption scheme. The scheme we propose is a very exible encryption and authentication primitive. We build this scheme on two relatively new design principles: t-functions and fast pseudo hadamard transforms. We recapitulate the theory behind these principles and analyze their security properties and efficiency. In more detail we propose a streamcipher which outputs a message authentication tag along with theencrypted data stream with only little overhead. Moreover we proposesecurity-speed tradeoffs. Our scheme is faster than other comparablet-function based designs while offering the same security level.</p>

The security protocols used in ZigBee rely on an advanced encryption standard-counter mode (AES-CTR) algorithm to encrypt data before transmission. This algorithm is very robust, but it is time consuming. For some industrial and medical applications, it does not meet the real-time requirement. When the AES is used in counter mode CTR, it becomes like a stream cipher that aims to generate pseudorandom bits. Also, to encrypt data, the latter are combined with the plaintext using the XOR operation. New fast stream ciphers were proposed for the eStream project, but these ciphers have shown some weakness. On the other hand, ciphers based on chaotic functions seem to be more promising. Detailed analyses have shown that chaotic functions have very good cryptographic properties and can be used to construct high speed and strong stream ciphers. In this paper, a new robust and fast chaotic encryption algorithm RFCA is presented. This consists of a chaotic cipher composed of two perturbed maps piecewise linear chaotic map. This algorithm is, in particular, adequate for data encryption in ZigBee networks where robustness and real time are both essential. A comparison between our algorithm (RFCA) and the AES-CTR, the simplified AES, and the eStream finalist candidates, is presented with regard to speed and robustness. This is done using correlation coefficients, unified average changing intensity, number of pixels change rate, and test of randomness for the generated bit sequences using the National Institute of Standards and Technology statistical test suite.

We examine a natural, but non-tight, reductionist security proof for deterministic message authentication code (MAC) schemes in the multi-user setting. If security parameters for the MAC scheme are selected without accounting for the non-tightness in the reduction, then the MAC scheme is shown to provide a level of security that is less than desirable in the multi-user setting. We find similar deficiencies in the security assurances provided by non-tight proofs when we analyze some protocols in the literature including ones for network authentication and aggregate MACs. Our observations call into question the practical value of non-tight reductionist security proofs. We also exhibit attacks on authenticated encryption schemes, disk encryption schemes, and stream ciphers in the multi-user setting.

A novel method to combine encryption and channel coding in such a way as to get increased security without any additional complexity is presented in this paper. A secure communication system usually consists of an encryption block followed by the channel coder. The encryption block here is a Shrinking generator which is a Linear Feedback Shift Register (LFSR) based stream cipher system. The channel coding technique used is Turbo codes or Low Density Parity Check Codes (LDPC) that performs very well and provides results near Shannon's Limit. Controlled randomness using Pseudo Random Bit Sequence (PRBS) generator is incorporated during encoding of these codes to provide additional level of security in the system without any additional complexity. To achieve optimum decoding, soft decision decoding algorithms are used rather than hard decisions. Bit Error Rate (BER) performance of the proposed channel coders with keyed randomness is well analyzed for intended and un-intended users. Security of the system is analyzed by mounting Improved Linear Consistency Attack and the results show that a significant increase in security is achieved in a stream cipher based secure communication system without any additional increase in complexity by introducing security in channel coding.

Increasing the efficiency of internal combustion engines is of major interest for reduced greenhouse gas emission. A significant improvement potential is given with the reduction of friction losses. Here, especially the friction between the piston ring and the cylinder liner is of interest. This article describes a study with the target to enhance the piston ring–cylinder liner conformation through increasing the roundness of the deformed liner during the warm operation state. The approach is based on the assumption that a non-circular liner in the cold state can deform due to thermal and mechanical stresses toward a circular shape under typical hot operation conditions. To test this hypothesis, a computational model for a gasoline engine was built and simulated using advanced finite element methods. The simulation describes the deformation process of the liner from the thermal and mechanical stresses. First, the deformation of a circular liner is simulated, showing asymmetric deformations of up to 30 µm in the warm state for the cylinder positioned at the end of the four-cylinder bank. As experimental data are readily available, a comparison was possible, showing good agreement. Then, three liner configurations with non-circular shape in the cold stage are investigated. For an elliptically shaped configuration, a nearly circular-shaped liner is reached under typical operation conditions. This numerical approach shows the potential for reduced friction of the piston–liner arrangement within internal combustion engines. The planned next step is the extension of this method to three-dimensional shape aspects and the application to the geometry of our test engine of our lab where friction can be measured in detail with a floating-liner measurement system.

Encryption and decryption are the two most important complex methods for achieving security in any type of smart devices and systems/machines through transport layer security protocol (TLS). The symmetric key algorithms are the significant method for encrypting and decrypting the data/information using block cipher or stream cipher which is used for TLS protocol. The primary symmetric key block cipher algorithm used in TLS is Advanced Encryption standard (AES) and it provides security based on the key bits used in AES operation. The TLS protocol provides confidentiality(C), integrity (I) and Authenticity (A) in a single pass communication that is Authentication Encryption and Authentication Data (AEAD) between web browser and web server. It uses well known TLS cipher suite AES-GCM (Galois Counter mode) which is commonly used in TLS1.2. Suppose AES-NI hardware acceleration is not available in smart devices like tablets it causes performance issues in smart devices using TLS 1.2 protocol. If the smart device does not possess AES-NI, it can use software for running AES-GCM but it takes a lot of time for encryption/decryption of information, ergo causing the battery performance in smart devices. The newer symmetric Stream cipher CHACHA20-POLY1305 provides AEAD for securing the communication in smart devices thus reducing the battery cycles which is used for TLS 1.3. The paper discusses the pros and cons of AES-GCM authentication encryption used in TLS 1.2.

Authenticated Encryption (AE) schemes are an important security tool. Especially, GCM has been widely adopted on account of its performance and efficiency and used widely. As GCM has some weaknesses, SGCM has been proposed in 2011 and both AE schemes sometimes are used in the same system or hardware architecture. In this paper, we present the novel unified hardware for GCM and SGCM. Both modes are readily integrated into single architecture with little modification. The main contributions are three folded. Firstly, we unified GCM and SGCM using dual field adder. Secondly, we improved the previous dual field multiplier to fit our architecture. Our dual field multiplier just needs half cycles of referred one. For quantitative analysis, we calculate areas except for LEA core and add areas of AES which was used by each of previous works. We expect to achieve 29 % or 35 % less size than previous one. Lastly, we applied LEA instead of AES for the compact hardware implementation. Our unified hardware for GCM and SGCM is implemented within 16,133 GE and achieves 0.5 Gbps on 500 Mhz. Our unified hardware using LEA has 48 % less size than the one using AES.

Due to the widespread application of augmented and virtual environments, the research into 3D content protection is fundamentally important. To maintain confidentiality, encryption of 3D content, including the 3D objects and texture images, is essential. In this paper, a novel texture encryption scheme is proposed which complements the existing 3D object encryption methods. The proposed method encrypts texture images by bit masking and a permutation procedure using the Salsa20/12 stream cipher. The method is lightweight and satisfies the security requirement. It also prevents the partial disclosure of the encrypted 3D surface geometry by protecting the texture patterns from being partially leaked. The scheme has a better speed-security profile than the full encryption and the selective 4 most significant bit-plane encryption by 128-bit AES. The encryption schemes are implemented and tested with 500 sample texture images. The experimental results show that the scheme has a better encryption performance compared to the full/selective encryption by 128-bit AES.

The development of cloud computing attracts enterprises and individuals to outsource their data, such as images, to the cloud server. However, direct outsourcing causes the extensive concern of privacy leakage, as images often contain rich sensitive information. A straightforward way to protect privacy is to encrypt the images using the standard cryptographic tools before outsourcing. However, in such a way the possible usage of the outsourced images would be strongly limited together with the services provided to users, like the Content-Based Image Retrieval (CBIR). In this article, we propose a secure outsourced CBIR scheme, in which an encryption scheme is designed for the widely used JPEG-format images, and the secure features can be directly extracted from such encrypted images. Specifically, the JPEG images are encrypted by the block permutation, intra-block permutation, polyalphabetic cipher, and stream cipher. Then secure local histograms are extracted from the encrypted DCT blocks and the Bag-Of-Words (BOW) model is further used to organize the encrypted local features to represent the image. The proposed image encryption gets all of the image data protected and the experimental results show that the proposed scheme achieves improved accuracy with a small file size expansion.

Smart vehicles and industrial control systems becoming increasingly complex. They are comprised of a large number of connected intelligence sensor devices. For such systems, Controller Area Network (CAN) bus offer high-integrity serial communication capabilities. It transformed the way how these systems are networked. Due to the lack of data security features on CAN-enabled systems, many of these systems are vulnerable to a wide range of cyber threats. This article proposed the development of a crypto-based subsystem that is capable of supporting CAN authenticated data encryption/decryption, crypto-provable data traceability, and replay attack detection capabilities. Data confidentiality was achieved via the deployment of a lightweight block cipher authenticated encryption scheme based on TinyJAMBU-128. Crypto-provable data traceability was accomplished through the utilization of a block-chaining approach. Meanwhile, an anti-replay attack mechanism that implements CAN message context awareness has been tested and validated under various data infection rates. Our CAN security subsystem was fully implemented and deployed on a testbed with multiple STM32 Nucleo development boards. System performance for our security schemes was analyzed and compared with traditional encryption schemes AES, ARIA, and Camellia with SHA-512 for supporting message authentication. Based on our performance results, the proposed security subsystem achieved the lowest CAN bus load and average message overhead compared to other encryption schemes. In the case of the anti-replay attack mechanism, we were able to reach a detection rate of 99.99% for data infection rate below 20%.

The Rivest Cipher 4 (RC4) has been one of the most popular stream ciphers for providing symmetric key encryption, and is now proposed as an efficient cipher within light-weight cryptography. As an algorithm it has been considered to be one of the fastest stream ciphers and one of the easiest to implement. Unfortunately, despite its simplicity of usage, a number of attacks on it have been found. Therefore, various improvements of this algorithm exist in cryptography, but none of them use proper randomness. This paper outlines modified version of RC4 and which has the desirable features of an efficient stream cipher algorithm, and which integrates the Symmetric Random Function Generator (SRFG) method. Though RC4 uses pseudorandom features with an initialisation vector and a seed value, the use of true randomness in RC4 is novel in this domain. Therefore, this paper proposes a modified RC4 as <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">MRC4</i> , and which then evaluates the statistical features of MRC4 based upon parameters such as non-linearity, resiliency, balancedness, propagation and immunity. Further, we have compared the security features and confusion-diffusion attributes with some recent variants of RC4 and have found that MRC4 is efficient in withstanding against attacks. The experimental results show that MRC4 supports a 60% better confusion property and 50% better diffusion as compared to the original RC4 method.

This paper presents a lightweight, sponge-based authenticated encryption (AE) family called Beetle. When instantiated with the PHOTON permutation from CRYPTO 2011, Beetle achieves the smallest footprint—consuming only a few more than 600 LUTs on FPGA while maintaining 64-bit security. This figure is significantly smaller than all known lightweight AE candidates which consume more than 1,000 LUTs, including the latest COFB-AES from CHES 2017. In order to realize such small hardware implementation, we equip Beetle with an “extremely tight” bound of security. The trick is to use combined feedback to create a difference between the cipher text block and the rate part of the next feedback (in traditional sponge these two values are the same). Then we are able to show that Beetle is provably secure up to min{ c − log r , b /2, r } bits, where b is the permutation size and r and c are parameters called rate and capacity, respectively. The tight security bound allows us to select the smallest security parameters, which in turn result in the smallest footprint.

MULTIPLE SECRET SHARE CREATION SCHEME WITH ELEPHANT HERD OPTIMIZATION ALGORITHM FOR BIOMETRIC IMAGE SECURITY

CHAPTER 1 - 802.11 Wireless – Infrastructure Attacks

With the rapid development of autonomous vehicles (AVs), vehicle safety has attracted attention. Controller area network (CAN) bus without authentication and encryption mechanisms is a weakness of the in-vehicle network (IVN), and attackers always primarily target the CAN bus. Attacks on the AVs' CAN bus are more frequent because AVs have more external interfaces and sensors than ordinary vehicles. To address the abovementioned issues, this paper proposes a lightweight encryption and authentication scheme for the CAN bus of AVs using message authentication codes and Grain stream cipher. The scheme realizes efficient authentication between electronic control units and a counter re-synchronization protocol is used to ensure that authentication failure owing to counter inconsistency is prevented. Blom key management scheme is employed to rapidly distribute and update session keys, avoiding the complicated process of updating pairwise keys. In addition, considering the scalability of the IVN, a key distribution protocol for new nodes was provided. The security proof using Burrows-Abadi-Needham logic and security analysis prove that the proposed scheme can satisfy the security requirements of the IVN. In addition, performance analysis shows that the proposed scheme can meet real-time requirements and has little impact on the busload.