Query：
学者姓名：刘倩
Refining：
Year
Type
Indexed by
Source
Complex
Co-
Language
Clean All
Abstract ：
Permutation polynomials with low boomerang uniformity have wide applications in cryptography. In this paper, by utilizing the Weil sums technique and solving some certain equations over F-2n, we determine the boomerang uniformity of these permutation polynomials: (1) f(1)(x) = (x(2m) + x + delta)(22m)+1 + x, where n = 3m, delta is an element of F-2n with Tr-m(n)(delta) = 1; (2) f(2)(x) = (x(2m) + x + delta)(22m-1)+2(m-)1 + x, where n = 3m, delta is an element of F-2n with Tr-m(n)(delta) = 0; (3) f(3)(x) = (x(2m) + x + delta)2(3m-1)+2(m-1) + x, where n = 3m, delta is an element of F-2n with Tr-m(n)(delta) = 0. The results show that the boomerang uniformity of f(1)(x), f(2)(x) and f(3)(x) can attain 2(n).
Keyword ：
boomerang uniformity boomerang uniformity Finite field Finite field permutation polynomial permutation polynomial Weil sum Weil sum
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Liu, Qian , Chen, Zhixiong , Liu, Ximeng . The boomerang uniformity of three classes of permutation polynomials over F2n [J]. | JOURNAL OF ALGEBRA AND ITS APPLICATIONS , 2024 . |
| MLA | Liu, Qian 等. "The boomerang uniformity of three classes of permutation polynomials over F2n" . | JOURNAL OF ALGEBRA AND ITS APPLICATIONS (2024) . |
| APA | Liu, Qian , Chen, Zhixiong , Liu, Ximeng . The boomerang uniformity of three classes of permutation polynomials over F2n . | JOURNAL OF ALGEBRA AND ITS APPLICATIONS , 2024 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
In this paper, we present some new key-recovery attacks on Misty L-KF, Misty R-KF, and generalized Feistel schemes. Firstly, we propose a new 5-round distinguisher on Misty L-KF structure. Based on our new distinguisher attack, we propose a new6-round Demiric-Sel & ccedil;uk meet-in-the-middle attack (DS-MITM attack) against Misty L-KF structure. Secondly, we extend our classical DS-MITM attack to a new quantum DS-MITM attack on Misty L-KF structure by using the quantum claw finding algorithm. In addition, we apply the above method to attack Misty R-KF and generalized Feistel schemes. To sum up, we construct our classical key-recovery attacks on the 6-round Misty L-KF structure and Misty R-KF structure with O(2(3n/4)) time and O(2(n/2)) memory cost. By using a quantum computer, our new quantum key-recovery attacks on the 6-round Misty L-KF structures and Misty R-KF structures can be constructed with O(2n/2) time and O(2n/2) memory cost. Furthermore, we can construct our new quantum (5d-4)-round key-recovery attacks on the d-branch contracting Feistels with O(2(d-1)n/d) time and O(2(d-1)n/d) memory cost. In the end, we can construct our new quantum(4d-3)-round and (5d-4)-round key-recovery attacks on the two types of d-branch expanding Feistels with O(2(d-1)n/d) time and O(2(d-1)n/d) memory cost.
Keyword ：
Cryptanalysis Cryptanalysis Generalized Feistel scheme Generalized Feistel scheme Misty structure Misty structure Quantum DS-MITM attack Quantum DS-MITM attack
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Zou, Jian , Huang, Kairong , Zhu, Min et al. New Demiric-Selcuk meet-in-the-middle attacks on Misty and Feistel schemes [J]. | QUANTUM INFORMATION PROCESSING , 2024 , 23 (4) . |
| MLA | Zou, Jian et al. "New Demiric-Selcuk meet-in-the-middle attacks on Misty and Feistel schemes" . | QUANTUM INFORMATION PROCESSING 23 . 4 (2024) . |
| APA | Zou, Jian , Huang, Kairong , Zhu, Min , Zou, Hongkai , Luo, Yiyuan , Liu, Qian . New Demiric-Selcuk meet-in-the-middle attacks on Misty and Feistel schemes . | QUANTUM INFORMATION PROCESSING , 2024 , 23 (4) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Permutation polynomials with low c-differential uniformity and boomerang uniformity have wide applications in cryptography. In this paper, by utilizing the Weil sums technique and solving some certain equations over F-2n, we determine the c-differential uniformity and boomerang uniformity of these permutation polynomials: (1) f1(x) = x + Tr-1(n)( x(2k+1)+1+ x(3)+ x + ux), where n = 2k+ 1, u is an element of F-2n with Tr-1(n)(u) = 1; (2) f(2)(x) = x + Tr-1(n)( x(2k+3)+( x + 1)(2k)+3), where n = 2k+ 1; (3) f(3)(x) = x(-1)+ Tr-1(n)(( x(-1)+ 1)(d)+ x(-d)), where nis even and dis a positive integer. The results show that the involutions f(1)(x) and f(2)(x) are APcN functions for c is an element of F(2)n\{0, 1}. Moreover, the boomerang uniformity of f(1)(x) and f(2)(x) can attain 2(n). Furthermore, we generalize some previous works and derive the upper bounds on the c-differential uniformity and boomerang uniformity of f(3)(x). (c) 2023 Elsevier Inc. All rights reserved.
Keyword ：
Boomerang uniformity Boomerang uniformity C-differential uniformity C-differential uniformity Permutation polynomial Permutation polynomial
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Liu, Qian , Huang, Zhiwei , Xie, Jianrui et al. The c-differential uniformity and boomerang uniformity of three classes of permutation polynomials over F-2(n) [J]. | FINITE FIELDS AND THEIR APPLICATIONS , 2023 , 89 . |
| MLA | Liu, Qian et al. "The c-differential uniformity and boomerang uniformity of three classes of permutation polynomials over F-2(n)" . | FINITE FIELDS AND THEIR APPLICATIONS 89 (2023) . |
| APA | Liu, Qian , Huang, Zhiwei , Xie, Jianrui , Liu, Ximeng , Zou, Jian . The c-differential uniformity and boomerang uniformity of three classes of permutation polynomials over F-2(n) . | FINITE FIELDS AND THEIR APPLICATIONS , 2023 , 89 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
In this paper, we study the permutation property of pentanomials with the form xrh(xpm-1) over Fp2m , where p is an element of {2, 3}. More precisely, based on some seventh-degree and eighth-degree irreducible pentanomials over F2, we present eight classes of permutation pentanomials over F22m by determining the solutions of some equations with low degrees. In addition, based on the investigation of algebraic curves associated with fractional polynomials over finite fields, eight classes of permutation pentanomials over F32m are discovered by choosing some seventh-degree irreducible pentanomials over F3. Finally, several classes of permutation pentanomials and heptanomials over F22m and F32m are derived from known permutation polynomials on mu 2m+1 and mu 3m+1, respectively, where mu d is the set of d-th roots of unity.(c) 2023 Elsevier Inc. All rights reserved.
Keyword ：
Finite fields Finite fields Permutation heptanomial Permutation heptanomial Permutation pentanomial Permutation pentanomial Permutation polynomial Permutation polynomial
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Liu, Qian , Chen, Guifeng , Liu, Ximeng et al. Several classes of permutation pentanomials with the form xrh(xpm-1) over Fp2m [J]. | FINITE FIELDS AND THEIR APPLICATIONS , 2023 , 92 . |
| MLA | Liu, Qian et al. "Several classes of permutation pentanomials with the form xrh(xpm-1) over Fp2m" . | FINITE FIELDS AND THEIR APPLICATIONS 92 (2023) . |
| APA | Liu, Qian , Chen, Guifeng , Liu, Ximeng , Zou, Jian . Several classes of permutation pentanomials with the form xrh(xpm-1) over Fp2m . | FINITE FIELDS AND THEIR APPLICATIONS , 2023 , 92 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Functions with low differential uniformity have wide applications in cryptography. In this paper, by using the quadratic character of F-pn*, we further investigate the (-1)-differential uniformity of these functions in odd characteristic: (1) f(1)(x) = x(d), where d = - p(n)-1/2 + p(k) + 1, n and k are two positive integers satisfying n/gcd(n,k) is odd; (2) f(2)(x) = (x(pm) - x)(pn-1/2) (+1) + x + x(pm), where n = 3m; (3) f(3)(x) = (x(3m) - x) 3(n-1/2 +1) + (x(3m) - x) 3(n-1/2) +3(m) + x, where n = 3m. The results show that the upper bounds on the (-1)-differential uniformity of the power function f(1)(x) are derived. Furthermore, we determine the (-1) -differential uniformity of two classes of permutation polynomials f(2)(x) and f(3)(x) over F-pn and F-3n, respectively. Specifically, a class of permutation polynomial f(3)(x) that is of P-1N or AP(-1)N function over F-3n is obtained.
Keyword ：
C-differential uniformity C-differential uniformity Differential uniformity Differential uniformity Perfect and almost perfect c-nonlinear functions Perfect and almost perfect c-nonlinear functions
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Liu, Qian , Liu, Ximeng , Chen, Meixiang et al. Further results on the (-1)-differential uniformity of some functions over finite fields with odd characteristic [J]. | APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING , 2023 . |
| MLA | Liu, Qian et al. "Further results on the (-1)-differential uniformity of some functions over finite fields with odd characteristic" . | APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING (2023) . |
| APA | Liu, Qian , Liu, Ximeng , Chen, Meixiang , Zou, Jian , Huang, Zhiwei . Further results on the (-1)-differential uniformity of some functions over finite fields with odd characteristic . | APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING , 2023 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Cryptographic bent functions are maximally nonlinear Boolean functions with an even number of variables. They are not only closely related to some interesting combinatorial objects, but also have important applications in coding, sequence design, cryptography and cyber security. In this paper, we firstly investigate the Walsh transform of two families of functions via Maiorana-MacFarland's class. Secondly, we present new infinite families of permutations. We show that those families have nice property that one can select three elements among them which can be used to construct bent functions. Finally, by using two linear translators, we construct bent functions from the class of Maiorana-MacFarland. © 2023 IEEE.
Keyword ：
Boolean functions Boolean functions Cryptography Cryptography Cybersecurity Cybersecurity Walsh transforms Walsh transforms
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Liu, Qian , Chen, Yan , Chen, Zhixiong et al. New Cryptographic Bent Functions from Permutations and Linear Translator in Cyber Security [C] . 2023 : 515-522 . |
| MLA | Liu, Qian et al. "New Cryptographic Bent Functions from Permutations and Linear Translator in Cyber Security" . (2023) : 515-522 . |
| APA | Liu, Qian , Chen, Yan , Chen, Zhixiong , Liu, Ximeng , Lin, Hui . New Cryptographic Bent Functions from Permutations and Linear Translator in Cyber Security . (2023) : 515-522 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Cryptographic functions with low differential uniformity have wide applications in cryptography and cyber security. In this paper, we further investigate c-differential uniformity proposed by Ellingsen et al. (IEEE Transactions on Information Theory. 2020, 66(9): 5781-5789). Specifically, two classes of power functions with low (1)-differential uniformity over finite fields with odd characteristic are obtained. In addition, a class of permutation polynomials and P1N or AP1N functions over F3n are proposed. These functions with low c-differential uniformity are utilized to resist against c-differential attacks in cyberspace from those with the usual low differential uniformity. © 2023 IEEE.
Keyword ：
Cryptography Cryptography Cybersecurity Cybersecurity Information theory Information theory Polynomials Polynomials
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Liu, Qian , Dong, Xiaobei , Chen, Zhixiong et al. Some Classes of Cryptographic Power Functions and Permutation Polynomials with Low (-1)-Differential Uniformity in Cyber Security [C] . 2023 : 109-115 . |
| MLA | Liu, Qian et al. "Some Classes of Cryptographic Power Functions and Permutation Polynomials with Low (-1)-Differential Uniformity in Cyber Security" . (2023) : 109-115 . |
| APA | Liu, Qian , Dong, Xiaobei , Chen, Zhixiong , Liu, Ximeng , Xu, Li . Some Classes of Cryptographic Power Functions and Permutation Polynomials with Low (-1)-Differential Uniformity in Cyber Security . (2023) : 109-115 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
In this paper, we propose some new quantum circuit implementations of SM4 block cipher and SM3 hash function, which are based on the following ideas. Firstly, we propose an improved classical circuit of SM4's S-box, which requires less AND gates than the previous works. Our improved classical circuit of SM4's S-box can be used for constructing a new quantum circuit of SM4's S-box. Secondly, we propose a new implementation of the Feistel-like structure of SM4 so as to reduce the number of qubits and T-depth simultaneously. Thirdly, we reduce the number of qubits in our quantum circuit of SM3 by making use of linear message expansion algorithm of SM3. Fourthly, we propose some in-place implementations of the linear permutations of SM4 and SM3. Based on our new techniques, our stand-alone memory-efficient quantum circuit implementation of SM4 only requires 384 qubits, seven ancilla qubits and 33,024 T-depth, while our depth-efficient quantum circuit of SM4 requires 384 qubits, 1080 ancilla qubits and 455 T-depth. Furthermore, we propose a stand-alone memory-efficient quantum circuit implementation of SM3 with 768 qubits, 33 ancilla qubits and 144,768 T-depth, while our depth-efficient quantum circuit of SM3 requires 768 qubits, 202 ancilla qubits, and 25,344 T-depth. Compared to the previous work, our new quantum circuits of SM3 requires less qubits and T-depth.
Keyword ：
Quantum circuit Quantum circuit Quantum gate Quantum gate Quantum resource estimation Quantum resource estimation SM3 hash function SM3 hash function SM4 block cipher SM4 block cipher
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Zou, Jian , Li, Liji , Wei, Zihao et al. New quantum circuit implementations of SM4 and SM3 [J]. | QUANTUM INFORMATION PROCESSING , 2022 , 21 (5) . |
| MLA | Zou, Jian et al. "New quantum circuit implementations of SM4 and SM3" . | QUANTUM INFORMATION PROCESSING 21 . 5 (2022) . |
| APA | Zou, Jian , Li, Liji , Wei, Zihao , Luo, Yiyuan , Liu, Qian , Wu, Wenling . New quantum circuit implementations of SM4 and SM3 . | QUANTUM INFORMATION PROCESSING , 2022 , 21 (5) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
In this paper, we propose some new methods to reduce the time and memory cost in our quantum circuit implementations of Camellia block cipher. Firstly, we present some new quantum circuits of Camellia's S-box, which are based on our improved classical circuit of Camellia's S-box. That is, we not only propose an improved classical circuit of Camellia's S-box by using the tower field architecture, but also explore the linear relationship between different parameters in Camellia's S-box. Based on our improved classical circuit of Camellia's S-box, we can reduce the number of qubits and the T-depth in the quantum circuit of Camellia's S-box. Secondly, we propose a new in-place implementation of the inverse linear layer of Camellia, which can be used to construct an efficient quantum circuit of the Feistel-SPN structure in Camellia. To sum up, our quantum circuit implementations of Camellia-128/-192/-256 with fewer qubits only require 391/647/647 qubits, while the T-depth of our depth-efficient quantum circuits of Camellia-128/-192/-256 are 114/156/156.
Keyword ：
Camellia Camellia Quantum circuit Quantum circuit Quantum gate Quantum gate Quantum resource estimation Quantum resource estimation
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Zou, Jian , Wei, Zihao , Sun, Siwei et al. Some efficient quantum circuit implementations of Camellia [J]. | QUANTUM INFORMATION PROCESSING , 2022 , 21 (4) . |
| MLA | Zou, Jian et al. "Some efficient quantum circuit implementations of Camellia" . | QUANTUM INFORMATION PROCESSING 21 . 4 (2022) . |
| APA | Zou, Jian , Wei, Zihao , Sun, Siwei , Luo, Yiyuan , Liu, Qian , Wu, Wenling . Some efficient quantum circuit implementations of Camellia . | QUANTUM INFORMATION PROCESSING , 2022 , 21 (4) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
In this paper, by transforming the permutation problem into the root distribution problem in the unit circle of certain quadratic and cubic equations, we investigate the permutation behavior of the type f (x) = x + x(23m-2m+1) + x(24m-23m+2m) over F-24m and f(x) = x + x(2m) + x2(m+1-1) + ax(22m-2m+1) over F-22m, respectively.
Keyword ：
Finite field Finite field permutation quadrinomial permutation quadrinomial permutation trinomial permutation trinomial
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Liu, Qian . Two classes of permutation polynomials with Niho exponents over finite fields with even characteristic [J]. | TURKISH JOURNAL OF MATHEMATICS , 2022 , 46 (3) : 919-928 . |
| MLA | Liu, Qian . "Two classes of permutation polynomials with Niho exponents over finite fields with even characteristic" . | TURKISH JOURNAL OF MATHEMATICS 46 . 3 (2022) : 919-928 . |
| APA | Liu, Qian . Two classes of permutation polynomials with Niho exponents over finite fields with even characteristic . | TURKISH JOURNAL OF MATHEMATICS , 2022 , 46 (3) , 919-928 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Export
| Results： |
Selected to |
| Format： |
