Securing Medical Images via a Texture and Chaotic Key Framework

Banday, Shoaib Amin; Pandit, Mohammad Khalid; Khan, Ab Rouf

doi:10.1007/978-981-15-8711-5_1

Cited by 5 publications

(3 citation statements)

References 54 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The secret keyspace is the size of the total of all variables utilized in the cryptosystem. To avoid brute-force attacks, the secret keyspace should be greater than 2 100 [45]. For our proposed image cryptosystem, the secret keys are comprised of the initial values,𝑦 0 ,𝑧 0 , ν, ε , τ and the encryption round T. Using the double-precision IEEE-754 standard, each initial value and control parameter of the Zaslavsky map will take10 15 .…”

Section: Keyspace and Key Sensitivitymentioning

confidence: 99%

Image Cryptosystem for IoT Devices Using 2-D Zaslavsky Chaotic Map

2022

IJIES

View full text Add to dashboard Cite

Recently, the proliferation of the Internet of Things (IoT) services and applications has prompted several governments to deploy many cameras in critical sites, such as embassies, military institutions, and ministries. The images must be encrypted to protect data shared between IoT sensors/devices and embedded subsystems. Often, IoT devices are smaller and less powerful. A lot of traditional encryption methods are computationally inefficient. They require many rounds of coding, which takes up much space on a device. Despite this, this paper has developed a lightweight encryption algorithm based on chaos theory suitable for IoT devices with limited processing power. The confusion-diffusion structure is often divided into two independent components in chaotic image cryptosystems. However, it reduces the security of the cryptosystem since the independent design may be subjected to cryptanalysis individually. This paper presents an efficient chaotic image encryption algorithm based on a plaintext-associated approach. It incorporates confusion-diffusion operation to increase encryption reliability. The Zaslavsky map initial values are determined by the values and locations of an input image and random values to resist chosen-plaintext cryptanalysis. Furthermore, the proposed method uses a simultaneous confusion-diffusion process to resist any separate attack. The simulation and experimental analysis demonstrate that the proposed encryption algorithm has 0.3927 seconds as a fast encryption time. Moreover, it provides a high performance compared to several other chaotic-based image cryptosystems. as measured by the histogram, entropy (7.99723), pixel change rate (99.7194), unified average changing intensity (33.4635) within the critical interval, pixel correlation, global and local entropy, CDR (ciphertext difference rate), and gray difference degree (GDD). It also has higher security than other chaoticbased image cryptosystems.

show abstract

Section: Keyspace and Key Sensitivitymentioning

confidence: 99%

Image Cryptosystem for IoT Devices Using 2-D Zaslavsky Chaotic Map

2022

IJIES

View full text Add to dashboard Cite

show abstract

“…In the proposed approach, the key length used was 2 128 is quite enough for security. Since the efficient key space should be larger than 2 100 [25]. Therefore, the proposed approach can avoid attacks of the brute-force.…”

Section: A Sizes Of Block and Lengths Of Keymentioning

confidence: 99%

Designing a New Lightweight AES Algorithm to Improve the Security of the IoT Environment

2022

IJCCCE

View full text Add to dashboard Cite

Recently, the Internet of Things (IoT) is begin used in many fields such as smart homes, healthcare systems, industrial applications, etc. Therefore, the use of the IoT led to a growth in the number of dangers especially in the areas of privacy and security for applications running on low-resource computers. Consequently, the demand for lightweight encryption methods is growing. To safeguard sensing data, this study introduces a Lightweight Advanced Encryption Standard (LAES) depending on dynamic ShiftRows, initial permutation instead of MixColumns, and a dynamic number of rounds. It was created with the goal of reducing encryption/decryption time. The proposed approach was assessed by using various measurements such as lengths of the key used was 2128 and it is quite enough for security, key sensitivity values were 100%, Also, this study compared the encryption/decryption time, NIST statistical test, and security strength of the proposed architecture to those of XTEA, SIMON, Skinny, SPECK, and PRESENT. The encryption/decryption time of the proposed approach was had the shortest period (0.0169 S) while the SPECK algorithm was had the longest period (4.1249 S) among the comparative algorithms. Whereas, NIST statistical test values of the proposed approach were passed successfully and had higher values than the comparative algorithms. Moreover, the proposed approach utilized 1280, 1024, and 768 GE with 6, 8, or 10 rounds respectively. The average number of GE was approximately 1000 GE. These numbers of GE are considered highly efficient with the IoT environment. Index Terms— IoT, AES, Lightweight systems, Chaotic systems, Cryptography.

show abstract

“…A robust encryption technique should have a large enough keyspace in order to overcome brute-force attacks [22]. Keyspace should be larger than 2 100 to avoid brute-force attacks [23]. The secret keys are made up of three parts in the suggested approach: a master key, a Chebyshev map, and a logistic map.…”

Section: Keyspace and Key Sensitivitymentioning

confidence: 99%

Combined Chebyshev and logistic maps to generate pseudorandom number generator for internet of things

Jassim

Farhan

2022

IJECE

View full text Add to dashboard Cite

<span>Sensitive data exchanging among things over the Internet must be protected by a powerful cryptographic system. Conventional cryptographic such as advanced encryption standard (AES), and respiratory sinus arrhythmia (RSA) are not effective enough to protect internet of things (IoT) because of certain inveterate IoT properties like limited memory, computation, and bandwidth. Nowadays, chaotic maps with high sensitivity to initial conditions, strong ergodicity, and non-periodicity have been widely used in IoT security applications. So, it is suitable for IoT. Also, in a stream cipher method, the user needs to deliver the keystream to all clients in advance. Consequently, this paper proposed a method to solve the keys distribution problem based on combine both Chebyshev and logistic maps techniques as well as a master key to generate a random key. The suggested method was compared with the other stream cipher algorithms (Chacha20, RC4, Salsa20) by utilizing the same plaintext and master key as input parameters and the results were successful in the statistical national institute of standards and technology (NIST) test. Simultaneously, the suggestion was evaluated through different evaluation methods like statistical NIST test, histogram, Shannon entropy, correlation coefficient analysis, keyspace and key sensitivity, and others. All mentioned tests are passed successfully. Therefore, the suggested approach was proved it is effective in security issues.</span>

show abstract

Securing Medical Images via a Texture and Chaotic Key Framework

Cited by 5 publications

References 54 publications

Image Cryptosystem for IoT Devices Using 2-D Zaslavsky Chaotic Map

Image Cryptosystem for IoT Devices Using 2-D Zaslavsky Chaotic Map

Designing a New Lightweight AES Algorithm to Improve the Security of the IoT Environment

Combined Chebyshev and logistic maps to generate pseudorandom number generator for internet of things

Contact Info

Product

Resources

About