Noise-Resistant Image Encryption Scheme for Medical Images in the Chaos and Wavelet Domain

May combine two claims.

The proposed algorithm is lossless because it can decrypt the exact pixel values of an image.

“The proposed algorithm is lossless because it can decrypt the exact pixel values of an image.”

May combine two claims.

After cropping and noise attacks on enciphered images, the proposed algorithm can decrypt the plaintext image with little loss of information, but the content of the original image is visible.

“We have also tested the proposed algorithm by performing attacks such as cropping and noise attacks on enciphered images, and we found that the proposed algorithm can decrypt the plaintext image with little loss of information, but the content of the original image is visible.”

May combine two claims.

For equation 1, the initial values x0 in (0,1) and phi in [1.42,1.60) are those in which the system comes into the chaotic state and can generate values in (0,1].

“The intervals mentioned above are those in which the system 1 comes into the chaotic state and can generate the values ranges (0 1].”

May combine two claims.

As phi increases, C-LM transitions from constant to periodic to chaotic behavior.

“When the value of ϕ is from 1 to 1.2, the generated stream is constant in which the one value is repeating again and again.While increasing the value of ϕ from 1.2 to 1.3, two possible values are generated, which are repeating.After ϕ = 1.38, the system bifurcates into four different trajectories.”

Probably not a substantial claim: may not pass S4 (based).

During the decryption process, every single bit can be recovered.

“The proposed algorithm is suitable for both image and text encryption because, during the decryption process, every single bit can be recover.”

Probably not a substantial claim: may not pass S3 (load-bearing), S4 (based).

C-LM is highly dependent on the parameter phi.

“The C-LM is highly dependent on the parameter ϕ.”

May combine two claims.

The MSB bit-plane (8th) occupies the highest information, the LSB bit-plane (1st) contains the least information, and information gradually decreases from MSB to LSB.

“Among all the eight bitplanes, the MSB bit-plane (8 th bit-plane) occupies the highest information while the least information present in the LSB bit-plane (1 st bit-plane).The information of the plain image gradually decreases from the last MSB bit-plane to the first LSB bit-plane.”

May combine two claims.

The MSE and PSNR values of the proposed algorithm for all images are zero and infinity respectively.

“From Table 7, it can be seen that the MSE and PSNR values of the proposed algorithm for all the images are zero and infinity respectively.”

May combine two claims.

The proposed encryption algorithm can generate NPCR and UACI values above 99.6073% and 33.4351% respectively.

“We found that the proposed encryption algorithm can generate the values of NPCR and UACI are above 99.6073% and 33.4351% respectively”

May combine two claims.

The MSB bit-plane contains more than 50% of the information of the plain image, and the LSB bit-plane contains less than 1%.

“From Table 1, it can be seen that the MSB bit-plane (8 th bit-plane) contained more than 50% of the information of the plain image, which is the highest information occupied bitplane among all other extracted bit-planes.The least information present in the LSB is bit-plane (1 st bit-plane), which is less than 1%.”

May combine two claims.

The proposed encryption algorithm's NPCR and UACI values are higher than the compared schemes.

“and higher than the compared schemes.”

May combine two claims.

The proposed encryption scheme is robust against cropping attack, noise attack, and brute force.

“The proposed algorithm is also tested against different attacks such as cropping attack, noise attack and brute force to prove that our encryption scheme is robust against different attacks.”

Probably not a substantial claim: may not pass S4 (based).

The security of the proposed encryption is enhanced significantly by its three-section design.

“It has three different sections, based on which the security of proposed encryption is enhanced significantly.”

Probably not a substantial claim: may not pass S1 (asserted), S3 (load-bearing).

The CLM is able to generate more random values.

“it can be seen that the CLM is now able to generate more random values.”

Probably not a substantial claim: may not pass S3 (load-bearing).

In every level of DWT decomposition, the sub-band image size becomes half of the previous sub-band.

“in every level of decomposition using DWT, the sub-bands image's size becomes half of the previous sub-band.”

May combine two claims.

Images have more redundancy, bulk data, and high correlation, so traditional cryptosystems such as AES and DES are not suitable for them.

“Compare with the textual information; images have more redundancy, the bulk of data and high correlation in which traditional cryptosystems such as Advanced Encryption Standard (AES), Data Encryption Standard (DES) [3], [4] are not suitable.”

• cites [3]Not matched

  Couldn’t be matched to a paper in Crossref, so it can’t be checked.

• cites [4]Not matched

  Couldn’t be matched to a paper in Crossref, so it can’t be checked.

Probably not a substantial claim: may not pass S3 (load-bearing).

Bit-level encryption may produce better-encrypted images because it encrypts the image at the bit level, the smallest element in an image.

“Bit-level encryption may produce better-encrypted images as it encrypts the image at bit-level, which is the smallest element in an image.”

Probably not a substantial claim: may not pass S2 (checkable), S3 (load-bearing).

Any encryption scheme can be considered more secure if it encrypts digital information at the smallest level.

“Any encryption scheme can be considered more secure if it encrypts the digital information at the smallest level [25].”

• cites [25]Not matched

  Couldn’t be matched to a paper in Crossref, so it can’t be checked.

Probably not a substantial claim: may not pass S3 (load-bearing).

Different chaotic structures such as logistic map, gauss iterated, and sine map have some mapping drawbacks.

“Different chaotic structures like a logistic map, gauss iterated and sine map has some mapping drawbacks.”

• cites [56]Not matched

  Couldn’t be matched to a paper in Crossref, so it can’t be checked.

May combine two claims.

Wang et al. reduced encryption computational time but security was compromised.

“In [39], Wang et al. put his effort to achieve the confusion and diffusion simultaneously to reduce encryption computational time.Although the authors were successful in reducing the processing time, but the security was compromised a bit.”

• cites [39]Not matched

  Couldn’t be matched to a paper in Crossref, so it can’t be checked.

Probably not a substantial claim: may not pass S3 (load-bearing), S4 (based).

A plain image can be recovered in bit-plane encryption methods by combining only four MSB bit-planes with little information loss.

“A plain image can be recovered in the bit-plane encryption methods by combining only four MSBs bit-planes with little information loss.”

May combine two claims.

The LL sub-band consists of low frequencies and contains most of the information of the plain image, while the LH, HL, and HH sub-bands contain very little information.

“LL sub-band consists of low frequencies, which means most of the information of the plain image present in the LL sub-band while very little information lies in the other three sub-bands (LH, HL, HH).”

May combine two claims.

The gray values in the ciphertext image obtained through the proposed algorithm are uniformly distributed and pass the chi-square test.

“Therefore, the gray values in the ciphertext image obtained through the proposed algorithm are uniformly distributed and pass the chi-square test.”

Probably not a substantial claim: may not pass S3 (load-bearing).

Bit-level substitution cannot be effective because bit-planes consist of only two values, 0 and 1.

“But in the case of bit-level substitution, it cannot be effective because bit-planes consist of only two values 0 and 1.”

Classified as probably not a substantial claim. May combine two claims.

C-LM is a one-dimensional modified version of a chaotic logistic map and can be used for random number generation, key image generation, and keystream generation.

“C-LM is a one-dimensional modified version of a chaotic logistic map and can be used for various purposes such as random number generation, key image generation and keystream generation.”

• cites [58]Not matched

  Couldn’t be matched to a paper in Crossref, so it can’t be checked.

Probably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.

Adopting the four-MSB recovery methodology achieves high security with less processing time, but the encryption scheme would be lossy, which is not suitable where exact recovery of information is required.

“By adopting this methodology, one can achieve high security with less processing time, but that encryption scheme would be lossy, which is not suitable for those applications where we required the exact recovery of information.”

Probably not a substantial claim: may not pass S3 (load-bearing).

The GA-based scheme in [55] had interpretation problems of function and selection of ciphering.

“In the GA algorithm, there were some interpretation problems of function and selection of ciphering.”

• cites [55]Not matched

  Couldn’t be matched to a paper in Crossref, so it can’t be checked.

Probably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.

The homomorphic cryptosystem in [52] provides quite better security but does not provide high computational speed.

“Although the proposed algorithm's security was quite better, it does not provide high computational speed.”

• cites [52]Not matched

  Couldn’t be matched to a paper in Crossref, so it can’t be checked.

Probably not a substantial claim: may not pass S3 (load-bearing).

The GGH-based scheme in [54] cannot resist the chosen-Cipher attack.

“The only flaw in this scheme was, it cannot resist the chosen-Cipher attack.”

• cites [54]Not matched

  Couldn’t be matched to a paper in Crossref, so it can’t be checked.

Probably not a substantial claim: may not pass S3 (load-bearing).

If bit-planes are extracted using equation 5, equation 2 can be used to compose the plain image from the eight extracted bit-planes.

“Here, one thing can be noted that if we extract the bit-planes by using equation 5, equation 2 can be used to composition the plain image from the eight extracted bit-planes.”

May combine two claims.

The encryption scheme proposed in [45] was based only on the diffusion mechanism and may be considered insecure because it does not satisfy Shannon's criteria.

“While the encryption scheme proposed in [45] was based only on the diffusion mechanism, and it may consider an insecure scheme because this scheme does not satisfy Shannon's criteria.”

• cites [45]Not matched

  Couldn’t be matched to a paper in Crossref, so it can’t be checked.

• cites [21]Not matched

  Couldn’t be matched to a paper in Crossref, so it can’t be checked.

Probably not a substantial claim: may not pass S3 (load-bearing).

Zhou et al. used 5 rounds rather than a single encryption round to enhance security.

“The encryption scheme is consists of 5 rounds rather than single encryption round to enhance the security.”

• cites [40]Not matched

  Couldn’t be matched to a paper in Crossref, so it can’t be checked.

May combine two claims.

Shafique et al.'s IEC-BPMC applied permutation only on the most significant bitplanes to reduce computational time, but security was compromised and it was broken in [42].

“Shafique et al.Proposed a bit-level encryption scheme (IEC-BPMC) [41], in which the author(s) applied the permutation function only on the most significant bitplanes to reduce the computational time.”

• Also stated in: § II. RELATED WORK AND PRELIMINARIES · plain

  “Although the author(s) has designed the encryption schemes for real-time applications, security was compromised and it was a break in [42].”

• cites [41]Not matched

  Couldn’t be matched to a paper in Crossref, so it can’t be checked.

• cites [42]Not matched

  Couldn’t be matched to a paper in Crossref, so it can’t be checked.

May combine two claims.

The proposed encryption scheme is suitable for gray scale as well as binary images.

“The proposed encryption scheme is suitable for gray scale as well as binary images.”

May combine two claims.

If the HL and HH sub-bands are ignored while taking the IDWT of the LL and LH sub-bands, the original image can still be recovered with little loss of information, but perceptually there will be no difference between the plain and recovered image.

“if we ignore the HL and HH sub-bands while taking the IDWT of LL and LH subbands, the original image can still recover with little loss of information, but perceptually there will be no difference between the plain and the recovered image.”

Classified as probably not a substantial claim. May combine two claims.

There is always a tradeoff between security and encryption computational time; increasing the number of rounds enhances security but compromises processing time, which is not suitable for real-time applications.

“There is always a tradeoff between security and encryption computational time.Obviously, as we increase the number of rounds, the security of the encryption scheme enhances.Nevertheless, with the enhancement of security by increases the number of rounds, we must compromise on the processing time, which is not suitable for real-time applications.”