scholarly journals A White-Box Implementation of IDEA

Symmetry ◽  
2021 ◽  
Vol 13 (6) ◽  
pp. 1066
Author(s):  
Siyu Pang ◽  
Tingting Lin ◽  
Xuejia Lai ◽  
Zheng Gong
Keyword(s):  
Block Ciphers ◽  
Encryption Algorithm ◽  
Symmetric Encryption ◽  
Practical Applications ◽  
Original Algorithm ◽  
Algebraic Analysis ◽  
Lookup Tables ◽  
Algebraic Operations ◽  
Encryption Method

IDEA is a classic symmetric encryption algorithm proposed in 1991 and widely used in many applications. However, there is little research into white-box IDEA. In traditional white-box implementations of existing block ciphers, S-boxes are always converted into encoded lookup tables. However, the algebraic operations of IDEA without S-boxes, make the implementation not straight forward and challenging. We propose a white-box implementation of IDEA by applying a splitting symmetric encryption method, and verify its security against algebraic analysis and BGE-like attacks. Our white-box implementation requires an average of about 2800 ms to encrypt a 64-bit plaintext, about 60 times more than the original algorithm would take, which is acceptable for practical applications. Its storage requirements are only about 10 MB. To our knowledge, this is the first public white-box IDEA solution, and its design by splitting can be applied to similar algebraic encryption structures.

scholarly journals Security Analysis and Improvement of an Image Encryption Cryptosystem Based on Bit Plane Extraction and Multi Chaos

Entropy ◽  
2021 ◽  
Vol 23 (5) ◽  
pp. 505
Author(s):  
Shuqin Zhu ◽  
Congxu Zhu
Keyword(s):  
Image Encryption ◽  
Random Sequence ◽  
Security Analysis ◽  
Encryption Algorithm ◽  
Original Algorithm ◽  
Plane Extraction ◽  
Bit Plane ◽  
Bit Planes ◽  
And Diffusion ◽  
Improved Algorithm

This paper analyzes the security of image encryption systems based on bit plane extraction and multi chaos. It includes a bit-level permutation for high, 4-bit planes and bit-wise XOR diffusion, and finds that the key streams in the permutation and diffusion phases are independent of the plaintext image. Therefore, the equivalent diffusion key and the equivalent permutation key can be recovered by the chosen-plaintext attack method, in which only two special plaintext images and their corresponding cipher images are used. The effectiveness and feasibility of the proposed attack algorithm is verified by a MATLAB 2015b simulation. In the experiment, all the key streams in the original algorithm are cracked through two special plaintext images and their corresponding ciphertext images. In addition, an improved algorithm is proposed. In the improved algorithm, the generation of a random sequence is related to ciphertext, which makes the encryption algorithm have the encryption effect of a “one time pad”. The encryption effect of the improved algorithm is better than that of the original encryption algorithm in the aspects of information entropy, ciphertext correlation analysis and ciphertext sensitivity analysis.

Proximal policy optimization with model-based methods

2022 ◽  
pp. 1-12
Author(s):  
Shuailong Li ◽  
Wei Zhang ◽  
Huiwen Zhang ◽  
Xin Zhang ◽  
Yuquan Leng
Keyword(s):  
Reinforcement Learning ◽  
State Of The Art ◽  
Transition Model ◽  
Practical Applications ◽  
Original Algorithm ◽  
Policy Performance ◽  
Model Based ◽  
Model Free ◽  
Future State ◽  
Policy Optimization

Model-free reinforcement learning methods have successfully been applied to practical applications such as decision-making problems in Atari games. However, these methods have inherent shortcomings, such as a high variance and low sample efficiency. To improve the policy performance and sample efficiency of model-free reinforcement learning, we propose proximal policy optimization with model-based methods (PPOMM), a fusion method of both model-based and model-free reinforcement learning. PPOMM not only considers the information of past experience but also the prediction information of the future state. PPOMM adds the information of the next state to the objective function of the proximal policy optimization (PPO) algorithm through a model-based method. This method uses two components to optimize the policy: the error of PPO and the error of model-based reinforcement learning. We use the latter to optimize a latent transition model and predict the information of the next state. For most games, this method outperforms the state-of-the-art PPO algorithm when we evaluate across 49 Atari games in the Arcade Learning Environment (ALE). The experimental results show that PPOMM performs better or the same as the original algorithm in 33 games.

Device Authentication and Data Encryption for IoT Network by Using Improved Lightweight SAFER Encryption With S-Boxes

2021 ◽  
Vol 12 (3) ◽  
pp. 1-13
Author(s):  
Hamza Sajjad Ahmad ◽  
Muhammad Junaid Arshad ◽  
Muhammad Sohail Akram
Keyword(s):  
Low Power ◽  
Secure Communication ◽  
Data Encryption ◽  
Important Task ◽  
Encryption Algorithm ◽  
Authentication Mechanism ◽  
Iot Devices ◽  
Encryption Method ◽  
Secure Authentication

To send data over the network, devices need to authenticate themselves within the network. After authentication, the device will be able to send the data in-network. After authentication, secure communication of devices is an important task that is done with an encryption method. IoT network devices have a very small circuit with low resources and low computation power. By considering low power, less memory, low computation, and all the aspect of IoT devices, an encryption technique is needed that is suitable for this type of device. As IoT networks are heterogeneous, each device has different hardware properties, and all the devices are not on one scale. To make IoT networks secure, this paper starts with the secure authentication mechanism to verify the device that wants to be a part of the network. After that, an encryption algorithm is presented that will make the communication secure. This encryption algorithm is designed by considering all the important aspects of IoT devices (low computation, low memory, and cost).

scholarly journals Mahaviracharya Encryption Standard (MES)

2020 ◽  
Vol 8 (6) ◽  
pp. 5759-5764
Keyword(s):  
Encryption Algorithm ◽  
The Internet ◽  
Symmetric Encryption ◽  
Important Thing ◽  
New Process ◽  
Encryption Algorithms ◽  
Use Of The Internet

Given the current use of the Internet, The most important thing is to provide security to the user's information. Many encryption algorithms already exist for this purpose. Here we discussed a new process called Mahaviracharya Encryption Standard. MES is a symmetric encryption algorithm. Here, this algorithm is cryptanalyzed, and compared with blowfish algorithm. MES algorithm can be used instead off algorithms like AES, Blowfish etc.

scholarly journals An Efficient Method of Image Encryption Using Rossler Chaotic System

2021 ◽  
Vol 10 (2) ◽  
pp. 11
Author(s):  
Yasir Ahmed Hamza ◽  
Marwan Dahar Omer
Keyword(s):  
Image Encryption ◽  
Chaotic System ◽  
Initial Conditions ◽  
Computation Time ◽  
Encryption Algorithm ◽  
Brute Force ◽  
Symmetric Encryption ◽  
New Approach ◽  
System Parameters ◽  
Plain Image

In this study, a new approach of image encryption has been proposed. This method is depends on the symmetric encryption algorithm RC4 and Rossler chaotic system. Firstly, the encryption key is employed to ciphering a plain image using RC4 and obtains a ciphered-image. Then, the same key is used to generate the initial conditions of the Rossler system. The system parameters and the initial conditions are used as the inputs for Rossler chaotic system to generate the 2-dimensional array of random values. The resulted array is XORed with the ciphered-image to obtain the final encrypted-image. Based on the experimental results, the proposed method has achieved high security and less computation time. Also, the proposed method can be resisted attacks like (statistical, brute-force, and differential).

scholarly journals Image Encryption Algorithm Based on the H-Fractal and Dynamic Self-Invertible Matrix

2019 ◽  
Vol 2019 ◽  
pp. 1-12 ◽  
Author(s):  
Xuncai Zhang ◽  
Lingfei Wang ◽  
Ying Niu ◽  
Guangzhao Cui ◽  
Shengtao Geng
Keyword(s):  
Image Encryption ◽  
Security Analysis ◽  
Encryption Algorithm ◽  
Hyperchaotic System ◽  
Original Image ◽  
Invertible Matrix ◽  
Pseudorandom Sequences ◽  
Pixel Location ◽  
Encryption Method ◽  
Image Encryption Algorithm

In this paper, an image encryption algorithm based on the H-fractal and dynamic self-invertible matrix is proposed. The H-fractal diffusion encryption method is firstly used in this encryption algorithm. This method crosses the pixels at both ends of the H-fractal, and it can enrich the means of pixel diffusion. The encryption algorithm we propose uses the Lorenz hyperchaotic system to generate pseudorandom sequences for pixel location scrambling and self-invertible matrix construction to scramble and diffuse images. To link the cipher image with the original image, the initial values of the Lorenz hyperchaotic system are determined using the original image, and it can enhance the security of the encryption algorithm. The security analysis shows that this algorithm is easy to implement. It has a large key space and strong key sensitivity and can effectively resist plaintext attacks.

Sign in / Sign up

Export Citation Format

Share Document