By researching into the attack to present block cipher, we find an essential reason leading to the assailable encryption strength, set up a new block cipher idea and put forward a block cipher encryption concept path ...By researching into the attack to present block cipher, we find an essential reason leading to the assailable encryption strength, set up a new block cipher idea and put forward a block cipher encryption concept path encryption. We present permutation code encryption which is based on path encryption. Now permutation code encryption is a patent of Chinese invention. In Permutation Code Encryption, we use a pseudo-random sequence of the keys to control the paths. The simulation result shows that for n-bit block the encryption strength is novel higher than 2^n and the algorithm can finish the encryption of one block in 7.5 ns, which is unrelated with the block length.展开更多
This article proposes an enhanced differential fault analysis（DFA） method named as fault-propagation pattern-based DFA（FPP-DFA）.The main idea of FPP-DFA is using the FPP of the ciphertext difference to predict the...This article proposes an enhanced differential fault analysis（DFA） method named as fault-propagation pattern-based DFA（FPP-DFA）.The main idea of FPP-DFA is using the FPP of the ciphertext difference to predict the fault location and the fault-propagation path.It shows that FPP-DFA is very effective on SPN structure block ciphers using bitwise permutation,which is applied to two block ciphers.The first is PRESENT with the substitution permutation sequence.With the fault model of injecting one nibble fault into the r-2nd round,on average 8 and 16 faults can reduce the key search space of PRESENT-80/128 to 214.7 and 221.1,respectively.The second is PRINTcipher with the permutation substitution sequence.For the first time,it shows that although the permutation of PRINTcipher is secret key dependent,FPP-DFA still works well on it.With the fault model of injecting one nibble fault into the r-2nd round,12 and 24 effective faults can reduce the key search space of PRINTcipher-48/96 to 213.7 and 222.8,respectively.展开更多
This paper design the P-permutation with cryptologic properties beyond certain bound based on BCH code and Goppa code, which is the generalization of the design method utilizing the maximum distance separable （MDS） ...This paper design the P-permutation with cryptologic properties beyond certain bound based on BCH code and Goppa code, which is the generalization of the design method utilizing the maximum distance separable （MDS） code, and presents the novel algorithms to generate the P-permutations with the branch number no less than a preset low bound. The new generation algorithms provide a theoretical basis for automation design of the cryptosystem.展开更多
While designing and developing encryption algorithms for text and images,the main focus has remained on security.This has led to insufficient attention on the improvement of encryption efficiency,enhancement of hyperc...While designing and developing encryption algorithms for text and images,the main focus has remained on security.This has led to insufficient attention on the improvement of encryption efficiency,enhancement of hyperchaotic sequence randomness,and dynamic DNA-based S-box.In this regard,a new symmetric block cipher scheme has been proposed.It uses dynamic DNA-based S-box connected with MD5 and a hyperchaotic system to produce confusion and diffusion for encrypting color images.Our proposed scheme supports various size color images.It generates three DNA based Sboxes for substitution namely DNA_1_s-box,DNA_2_s-box and DNA_3_sbox,each of size 16×16.Next,the 4D hyperchaotic system followed by MD5 is employed in a novel way to enhance security.The three DNAbased S-boxes are generated from real DNA sequences taken from National Center for Biotechnology Information(NCBI)databases and are dependent on the mean intensity value of an input image,thus effectively introducing content-based confusion.Finally,Conservative Site-Specific Recombination(CSSR)is applied on the output DNA received from DNA based S-boxes.The experimental results indicate that the proposed encryption scheme is more secure,robust,and computationally efficient than some of the recently published similar works.Being computational efficient,our proposed scheme is feasible on many emergent resource-constrained platforms.展开更多
We design a practical and provablysecure block ciper over small domain and non-binary inputs,which is also can be considered as a pseudorandom permutation on N elements.Our work is based on a relation we found between...We design a practical and provablysecure block ciper over small domain and non-binary inputs,which is also can be considered as a pseudorandom permutation on N elements.Our work is based on a relation we found between the small domain ciper and the negative hypergeometric probability(NHG) distribution.We prove that our block ciper achieves ideal security,that is,it is indistinguishable from a random permutation even if the adversary had already observed N plaintext-cipertext pairs.In particular,we initiate an efficient and sufficiently precise sampling algorithm for negative hypergeometric distribution.展开更多
Non-malleable code is an encoding scheme that is useful in situations where traditional error correction or detection is impossible to achieve.It ensures with high probability that decoded message is either completely...Non-malleable code is an encoding scheme that is useful in situations where traditional error correction or detection is impossible to achieve.It ensures with high probability that decoded message is either completely unrelated or the original one,when tampering has no effect.Usually,standard version of non-malleable codes provide security against one time tampering attack.Block ciphers are successfully employed in the construction of non-malleable codes.Such construction fails to provide security when an adversary tampers the codeword more than once.Continuously non-malleable codes further allow an attacker to tamper the message for polynomial number of times.In this work,we propose continuous version of non-malleable codes from block ciphers in split-state model.Our construction provides security against polynomial number of tampering attacks and it preserves non-malleability.When the tam-pering experiment triggers self-destruct,the security of continuously non-malleable code reduces to security of the underlying leakage resilient storage.展开更多
With the development of the information technology ,information security ,as well as the implementation ofthe encryption system becomes more and more complexity,and therefore new methods are explored to simplify com-p...With the development of the information technology ,information security ,as well as the implementation ofthe encryption system becomes more and more complexity,and therefore new methods are explored to simplify com-plexity of the implementation. Cellular automata has the characters of simplicity of basic components ,locality of cellu-lar automata interactions ,massive parallelism of information processing ,and exhibits complex global properties, whichmakes it suitable for the application in cryptography. This paper presents a new method of encryption,the key of thenew method consists of the permutation cellular automata, the vectors inputted, and the number of the itera-tion. Evidently,it has larger kev space than other methods with only the cellular automata itself as the key.展开更多
文摘By researching into the attack to present block cipher, we find an essential reason leading to the assailable encryption strength, set up a new block cipher idea and put forward a block cipher encryption concept path encryption. We present permutation code encryption which is based on path encryption. Now permutation code encryption is a patent of Chinese invention. In Permutation Code Encryption, we use a pseudo-random sequence of the keys to control the paths. The simulation result shows that for n-bit block the encryption strength is novel higher than 2^n and the algorithm can finish the encryption of one block in 7.5 ns, which is unrelated with the block length.
基金Supported by the National Natural Science Foundation ofChina (60772082,61173191,and 61272491)
文摘This article proposes an enhanced differential fault analysis（DFA） method named as fault-propagation pattern-based DFA（FPP-DFA）.The main idea of FPP-DFA is using the FPP of the ciphertext difference to predict the fault location and the fault-propagation path.It shows that FPP-DFA is very effective on SPN structure block ciphers using bitwise permutation,which is applied to two block ciphers.The first is PRESENT with the substitution permutation sequence.With the fault model of injecting one nibble fault into the r-2nd round,on average 8 and 16 faults can reduce the key search space of PRESENT-80/128 to 214.7 and 221.1,respectively.The second is PRINTcipher with the permutation substitution sequence.For the first time,it shows that although the permutation of PRINTcipher is secret key dependent,FPP-DFA still works well on it.With the fault model of injecting one nibble fault into the r-2nd round,12 and 24 effective faults can reduce the key search space of PRINTcipher-48/96 to 213.7 and 222.8,respectively.
基金Supported by the National Natural Science Foundation of China (60673071, 60970115, 60970116)
文摘This paper design the P-permutation with cryptologic properties beyond certain bound based on BCH code and Goppa code, which is the generalization of the design method utilizing the maximum distance separable （MDS） code, and presents the novel algorithms to generate the P-permutations with the branch number no less than a preset low bound. The new generation algorithms provide a theoretical basis for automation design of the cryptosystem.
基金supported in part by the Basic Science Research Program through the National Research Foundation of Korea(NRF)funded by the Ministry of Education under Grant NRF-2019R1A2C1006159 and Grant NRF-2021R1A6A1A03039493.
文摘While designing and developing encryption algorithms for text and images,the main focus has remained on security.This has led to insufficient attention on the improvement of encryption efficiency,enhancement of hyperchaotic sequence randomness,and dynamic DNA-based S-box.In this regard,a new symmetric block cipher scheme has been proposed.It uses dynamic DNA-based S-box connected with MD5 and a hyperchaotic system to produce confusion and diffusion for encrypting color images.Our proposed scheme supports various size color images.It generates three DNA based Sboxes for substitution namely DNA_1_s-box,DNA_2_s-box and DNA_3_sbox,each of size 16×16.Next,the 4D hyperchaotic system followed by MD5 is employed in a novel way to enhance security.The three DNAbased S-boxes are generated from real DNA sequences taken from National Center for Biotechnology Information(NCBI)databases and are dependent on the mean intensity value of an input image,thus effectively introducing content-based confusion.Finally,Conservative Site-Specific Recombination(CSSR)is applied on the output DNA received from DNA based S-boxes.The experimental results indicate that the proposed encryption scheme is more secure,robust,and computationally efficient than some of the recently published similar works.Being computational efficient,our proposed scheme is feasible on many emergent resource-constrained platforms.
基金National 973 Fundamental Basic Research Program under grant No.2014CB340600 and by the National Natural Science Foundations of China
文摘We design a practical and provablysecure block ciper over small domain and non-binary inputs,which is also can be considered as a pseudorandom permutation on N elements.Our work is based on a relation we found between the small domain ciper and the negative hypergeometric probability(NHG) distribution.We prove that our block ciper achieves ideal security,that is,it is indistinguishable from a random permutation even if the adversary had already observed N plaintext-cipertext pairs.In particular,we initiate an efficient and sufficiently precise sampling algorithm for negative hypergeometric distribution.
文摘Non-malleable code is an encoding scheme that is useful in situations where traditional error correction or detection is impossible to achieve.It ensures with high probability that decoded message is either completely unrelated or the original one,when tampering has no effect.Usually,standard version of non-malleable codes provide security against one time tampering attack.Block ciphers are successfully employed in the construction of non-malleable codes.Such construction fails to provide security when an adversary tampers the codeword more than once.Continuously non-malleable codes further allow an attacker to tamper the message for polynomial number of times.In this work,we propose continuous version of non-malleable codes from block ciphers in split-state model.Our construction provides security against polynomial number of tampering attacks and it preserves non-malleability.When the tam-pering experiment triggers self-destruct,the security of continuously non-malleable code reduces to security of the underlying leakage resilient storage.
文摘With the development of the information technology ,information security ,as well as the implementation ofthe encryption system becomes more and more complexity,and therefore new methods are explored to simplify com-plexity of the implementation. Cellular automata has the characters of simplicity of basic components ,locality of cellu-lar automata interactions ,massive parallelism of information processing ,and exhibits complex global properties, whichmakes it suitable for the application in cryptography. This paper presents a new method of encryption,the key of thenew method consists of the permutation cellular automata, the vectors inputted, and the number of the itera-tion. Evidently,it has larger kev space than other methods with only the cellular automata itself as the key.
