Securing Healthcare Data in IoMT Network Using Enhanced Chaos Based Substitution and Diffusion

Patient privacy and data protection have been crucial concerns in Ehealthcare systems for many years.In modern-day applications,patient data usually holds clinical imagery,records,and other medical details.Lately,the Internet of Medical Things(IoMT),equipped with cloud computing,has come out to be a beneficial paradigm in the healthcare field.However,the openness of networks and systems leads to security threats and illegal access.Therefore,reliable,fast,and robust security methods need to be developed to ensure the safe exchange of healthcare data generated from various image sensing and other IoMT-driven devices in the IoMT network.This paper presents an image protection scheme for healthcare applications to protect patients’medical image data exchanged in IoMT networks.The proposed security scheme depends on an enhanced 2D discrete chaotic map and allows dynamic substitution based on an optimized highly-nonlinear S-box and diffusion to gain an excellent security performance.The optimized S-box has an excellent nonlinearity score of 112.The new image protection scheme is efficient enough to exhibit correlation values less than 0.0022,entropy values higher than 7.999,and NPCR values around 99.6%.To reveal the efficacy of the scheme,several comparison studies are presented.These comparison studies reveal that the novel protection scheme is robust,efficient,and capable of securing healthcare imagery in IoMT systems.

Efficient image encryption scheme with synchronous substitution and diffusion based on double S-boxes

Single or multiple S-boxes are widely used in image encryption schemes, and in many image encryption schemes the asynchronous encryption structure is utilized, which separates the processes of substitution and diffusion. In this paper, we analyze the defects of this structure based on the example of an article and crack it using a simpler method. To address the defects of the asynchronous encryption structure, a novel encryption scheme is proposed, in which the structure of synchronous substitution and diffusion based on double S-boxes is utilized, so the processes of substitution and diffusion are combined together and the attackers cannot crack the cryptosystem by any of the processes. The simulation results and security analysis show that the proposed encryption scheme is safer and more efficient to expediently use in the real-time system.

S-box:six-dimensional compound hyperchaotic map and artificial bee colony algorithm

Being as unique nonlinear components of block ciphers,substitution boxes（S-boxes） directly affect the security of the cryptographic systems.It is important and difficult to design cryptographically strong S-boxes that simultaneously meet with multiple cryptographic criteria such as bijection,non-linearity,strict avalanche criterion（SAC）,bits independence criterion（BIC）,differential probability（DP） and linear probability（LP）.To deal with this problem,a chaotic S-box based on the artificial bee colony algorithm（CSABC） is designed.It uses the S-boxes generated by the six-dimensional compound hyperchaotic map as the initial individuals and employs ABC to improve their performance.In addition,it considers the nonlinearity and differential uniformity as the fitness functions.A series of experiments have been conducted to compare multiple cryptographic criteria of this algorithm with other algorithms.Simulation results show that the new algorithm has cryptographically strong S-box while meeting multiple cryptographic criteria.

Effective method for the design of S-Boxes satisfying the strict avalanche criterion(SAC)

The strict avalanche criterion(SAC)is one of the most important cryptographic criteria for substitution boxes(S-boxes)used in many symmetric encryption systems.However,there are few constructive methods for S-boxes fulfilling the SAC until now.In this paper,to construct S-boxes satisfying the SAC directly,we generalize the concatenation techniques of Boolean functions to S-boxes.Using the idea of concatenating small variable S-boxes,we present a simple yet effective construction method of S-boxes satisfying the SAC.Finally,a simple example on how to construct SAC S-boxes with large input variables by small variables SAC S-boxes is given.

A Review of Existing 4-Bit Crypto S-Box Cryptanalysis Techniques and Two New Techniques with 4-Bit Boolean Functions for Cryptanalysis of 4-Bit Crypto S-Boxes

4-bit linear relations play an important role in cryptanalysis of 4-bit crypto S-boxes. 4-bit finite differences have also been a major part of cryptanalysis of 4-bit S-boxes. Existence of all 4-bit linear relations have been counted for all of 16 input and 16 output 4-bit bit patterns of 4-bit Crypto S-boxes said as S-boxes has been reported in Linear Cryptanalysis of 4-bit S-boxes. Count of existing finite differences from each element of output S-boxes to distant output S-boxes have been noted in Differential Cryptanalysis of S-boxes. In this paper a brief review of these two cryptanalytic methods for 4-bit S-boxes has been introduced in a very lucid and conceptual manner. Two new analysis techniques, one to search for the existing linear approximations among the input vectors (IPVs) and output Boolean functions (BFs) of a particular S-box has also been introduced in this paper. The search is limited to find the existing linear relations or approximations in the contrary to count the number of existent linear relations among all 16, 4-bit input and output bit patterns within all possible linear approximations. Another is to find number of balanced BFs in difference output S-boxes. Better the number of Balanced BFs, Better the security.

Dynamic inhomogeneous S-Boxes in AES: a novel countermeasure against power analysis attacks

Substitution boxes (S-Boxes) in advanced encryption standard (AES) are vulnerable to attacks bypower analysis.The general S-Boxes masking schemes in circuit level need to adjust the design flow andlibrary databases.The masking strategies in algorithm level view each S-Box as an independent moduleand mask them respectively,which are costly in size and power for non-linear characteristic of S-Boxes.The new method uses dynamic inhomogeneous S-Boxes instead of traditional homogeneous S-Boxes,andarranges the S-Boxes randomly.So the power and data path delay of substitution unit become unpre-dictable.The experimental results demonstrate that this scheme takes advantages of the circuit character-istics of various S-Box implementations to eliminate the correlation between crypto operation and power.Itneeds less extra circuits and suits resource constrained applications.

基于复合混沌的数字图像加密算法

由于单混沌系统加密存在密钥空间小,安全性低的问题,提出了一种基于二维超混沌与三维混沌复合的图像加密算法。首先采用Kawakami超混沌生成超混沌序列进行像素置换,并产生三维Bao系统的初始值;然后通过明文像素值与Bao系统共同产生加密序列,用来进行像素替代和扩散;最后用C++对算法进行实现。整个加密过程加强了密文与明文关系的复杂性,增大了密钥空间,并能够有效地抵抗基于统计分析的攻击和差分攻击,使得算法速率也得到了较大提升。

基于分数阶Chen超混沌的频域自适应图像加密算法

随着互联网科技的发展与繁荣,数字图像的传播与应用越来越广泛,数字图像的安全性也越来越受到重视。在图像加密算法中,置乱-扩散结构的加密算法因符合图像数据二维分布的特点,得到了普遍的应用。然而,普通的置乱-扩散加密算法存在安全性不高、加密效率低等问题。因此,文中使用分数阶Chen超混沌在频域上置乱,再设计超混沌S盒进行代换,最后用双向异或循环左移扩散,从而达到了结合频域与空域,置乱、代换、扩散相结合的一整套加密流程。该算法的密钥空间大、密钥敏感性高、密文统计直方图均匀、密文相邻像素的相关性低、安全性高、抗差分攻击能力强,并且信息熵接近理想值。该算法仅通过3轮迭代就可达到与以前提出的图像加密算法相同的安全级别,加密效率得到了显著提高。

基于分数阶超混沌的混沌细胞自动机图像加密算法

为了保证信息传输过程中图像的安全性和可靠性,普通的置乱-扩散加密算法已不能够满足现有的安全与效率问题。文中将明文转化为哈希值作为混沌的初始值,使用分数阶Chen超混沌产生4个混沌序列。首先运用了三维Arnold映射进行双向变参置乱,再设计了超混沌S盒进行代换,最后用混沌细胞自动机循环扩散,从而达到了置乱、代换、扩散(DSD)相结合的一整套加密流程。该算法的密钥空间大、密钥敏感性高、安全性高、抗差分攻击能力强、密文统计直方图均匀、密文相邻像素相关性低,信息熵接近理想值。该算法不需要多轮迭代就可达到很高的安全级别,加密安全性与加密效率得到了显著提高。