The Experts below are selected from a list of 17982 Experts worldwide ranked by ideXlab platform
Yongge Wang - One of the best experts on this subject based on the ideXlab platform.
-
quantum resistant random Linear Code based public key encryption scheme rlce
International Symposium on Information Theory, 2016Co-Authors: Yongge WangAbstract:Lattice based encryption schemes and Linear Code based encryption schemes have received extensive attention in recent years since they have been considered as post-quantum candidate encryption schemes. Though LLL reduction algorithm has been one of the major cryptanalysis techniques for lattice based cryptographic systems, key recovery cryptanalysis techniques for Linear Code based cryptographic systems are generally scheme specific. In recent years, several important techniques such as Sidelnikov-Shestakov attack, filtration attacks, and algebraic attacks have been developed to crypt-analyze Linear Code based encryption schemes. Though most of these cryptanalysis techniques are relatively new, they prove to be very powerful and many systems have been broken using them. Thus it is important to design Linear Code based cryptographic systems that are immune against these attacks. This paper proposes Linear Code based encryption scheme RLCE which shares many characteristics with random Linear Codes. Our analysis shows that the scheme RLCE is secure against existing attacks and we hope that the security of the RLCE scheme is equivalent to the hardness of decoding random Linear Codes. Example parameters are recommended for the scheme RLCE.
-
quantum resistant random Linear Code based public key encryption scheme rlce
arXiv: Cryptography and Security, 2015Co-Authors: Yongge WangAbstract:Lattice based encryption schemes and Linear Code based encryption schemes have received extensive attention in recent years since they have been considered as post-quantum candidate encryption schemes. Though LLL reduction algorithm has been one of the major cryptanalysis techniques for lattice based cryptographic systems, key recovery cryptanalysis techniques for Linear Code based cryptographic systems are generally scheme specific. In recent years, several important techniques such as Sidelnikov-Shestakov attack, filtration attacks, and algebraic attacks have been developed to crypt-analyze Linear Code based encryption schemes. Though most of these cryptanalysis techniques are relatively new, they prove to be very powerful and many systems have been broken using them. Thus it is important to design Linear Code based cryptographic systems that are immune against these attacks. This paper proposes Linear Code based encryption scheme RLCE which shares many characteristics with random Linear Codes. Our analysis shows that the scheme RLCE is secure against existing attacks and we hope that the security of the RLCE scheme is equivalent to the hardness of decoding random Linear Codes. Example parameters for different security levels are recommended for the scheme RLCE.
Keping Long - One of the best experts on this subject based on the ideXlab platform.
-
circular shift Linear network coding
IEEE Transactions on Information Theory, 2019Co-Authors: Hanqi Tang, Zongpeng Li, Xiaolong Yang, Keping LongAbstract:We study a class of Linear network coding (LNC) schemes, called circular-shift LNC, whose encoding operations consist of only circular-shifts and bit-wise additions. Formulated as a special vector Linear Code over GF(2), an $L$ -dimensional circular-shift Linear Code of degree $\delta $ restricts its local encoding kernels to be the summation of at most $\delta $ cyclic permutation matrices of size $L$ . We show that on a general network, for a certain block length $L$ , every scalar Linear solution over GF( $2^{L-1}$ ) can induce an $L$ -dimensional circular-shift Linear solution with 1-bit redundancy per-edge transmission. Consequently, specific to a multicast network, such a circular-shift Linear solution of an arbitrary degree $\delta $ can be efficiently constructed, which has an interesting complexity tradeoff between encoding and decoding with different choices of $\delta $ . By further proving that circular-shift LNC is insufficient to achieve the exact capacity of certain multicast networks, we show the optimality of the efficiently constructed circular-shift Linear solution in the sense that its 1-bit redundancy is inevitable. Finally, both theoretical and numerical analysis imply that with increasing $L$ , a randomly constructed circular-shift Linear Code has Linear solvability behavior comparable to a randomly constructed permutation-based Linear Code, but has shorter overheads.
-
Circular-Shift Linear Network Coding
IEEE Transactions on Information Theory, 2019Co-Authors: Hanqi Tang, Zongpeng Li, Xiaolong Yang, Keping LongAbstract:We study a class of Linear network coding (LNC) schemes, called circular-shift LNC, whose encoding operations consist of only circular-shifts and bit-wise additions. Formulated as a special vector Linear Code over GF(2), an L-dimensional circular-shift Linear Code of degree δ restricts its local encoding kernels to be the summation of at most δ cyclic permutation matrices of size L. We show that on a general network, for a certain block length L, every scalar Linear solution over GF(2L-1) can induce an L-dimensional circular-shift Linear solution with 1-bit redundancy per-edge transmission. Consequently, specific to a multicast network, such a circular-shift Linear solution of an arbitrary degree δ can be efficiently constructed, which has an interesting complexity tradeoff between encoding and decoding with different choices of δ. By further proving that circular-shift LNC is insufficient to achieve the exact capacity of certain multicast networks, we show the optimality of the efficiently constructed circular-shift Linear solution in the sense that its 1-bit redundancy is inevitable. Finally, both theoretical and numerical analysis imply that with increasing L, a randomly constructed circular-shift Linear Code has Linear solvability behavior comparable to a randomly constructed permutation-based Linear Code, but has shorter overheads.
Hanqi Tang - One of the best experts on this subject based on the ideXlab platform.
-
circular shift Linear network coding
IEEE Transactions on Information Theory, 2019Co-Authors: Hanqi Tang, Zongpeng Li, Xiaolong Yang, Keping LongAbstract:We study a class of Linear network coding (LNC) schemes, called circular-shift LNC, whose encoding operations consist of only circular-shifts and bit-wise additions. Formulated as a special vector Linear Code over GF(2), an $L$ -dimensional circular-shift Linear Code of degree $\delta $ restricts its local encoding kernels to be the summation of at most $\delta $ cyclic permutation matrices of size $L$ . We show that on a general network, for a certain block length $L$ , every scalar Linear solution over GF( $2^{L-1}$ ) can induce an $L$ -dimensional circular-shift Linear solution with 1-bit redundancy per-edge transmission. Consequently, specific to a multicast network, such a circular-shift Linear solution of an arbitrary degree $\delta $ can be efficiently constructed, which has an interesting complexity tradeoff between encoding and decoding with different choices of $\delta $ . By further proving that circular-shift LNC is insufficient to achieve the exact capacity of certain multicast networks, we show the optimality of the efficiently constructed circular-shift Linear solution in the sense that its 1-bit redundancy is inevitable. Finally, both theoretical and numerical analysis imply that with increasing $L$ , a randomly constructed circular-shift Linear Code has Linear solvability behavior comparable to a randomly constructed permutation-based Linear Code, but has shorter overheads.
-
Circular-Shift Linear Network Coding
IEEE Transactions on Information Theory, 2019Co-Authors: Hanqi Tang, Zongpeng Li, Xiaolong Yang, Keping LongAbstract:We study a class of Linear network coding (LNC) schemes, called circular-shift LNC, whose encoding operations consist of only circular-shifts and bit-wise additions. Formulated as a special vector Linear Code over GF(2), an L-dimensional circular-shift Linear Code of degree δ restricts its local encoding kernels to be the summation of at most δ cyclic permutation matrices of size L. We show that on a general network, for a certain block length L, every scalar Linear solution over GF(2L-1) can induce an L-dimensional circular-shift Linear solution with 1-bit redundancy per-edge transmission. Consequently, specific to a multicast network, such a circular-shift Linear solution of an arbitrary degree δ can be efficiently constructed, which has an interesting complexity tradeoff between encoding and decoding with different choices of δ. By further proving that circular-shift LNC is insufficient to achieve the exact capacity of certain multicast networks, we show the optimality of the efficiently constructed circular-shift Linear solution in the sense that its 1-bit redundancy is inevitable. Finally, both theoretical and numerical analysis imply that with increasing L, a randomly constructed circular-shift Linear Code has Linear solvability behavior comparable to a randomly constructed permutation-based Linear Code, but has shorter overheads.
Jean-pierre Tillich - One of the best experts on this subject based on the ideXlab platform.
-
PQCrypto - Recovering Short Secret Keys of RLCE in Polynomial Time
Post-Quantum Cryptography, 2019Co-Authors: Alain Couvreur, Matthieu Lequesne, Jean-pierre TillichAbstract:We present a key recovery attack against Y. Wang's Random Linear Code Encryption (RLCE) scheme recently submitted to the NIST call for post-quantum cryptography. This attack recovers the secret key for all the short key parameters proposed by the author.
-
Recovering short secret keys of RLCE in polynomial time
arXiv: Cryptography and Security, 2018Co-Authors: Alain Couvreur, Matthieu Lequesne, Jean-pierre TillichAbstract:We present a key recovery attack against Y. Wang's Random Linear Code Encryption (RLCE) scheme recently submitted to the NIST call for post-quantum cryptography. This attack recovers the secret key for all the short key parameters proposed by the author.
Xiaolong Yang - One of the best experts on this subject based on the ideXlab platform.
-
circular shift Linear network coding
IEEE Transactions on Information Theory, 2019Co-Authors: Hanqi Tang, Zongpeng Li, Xiaolong Yang, Keping LongAbstract:We study a class of Linear network coding (LNC) schemes, called circular-shift LNC, whose encoding operations consist of only circular-shifts and bit-wise additions. Formulated as a special vector Linear Code over GF(2), an $L$ -dimensional circular-shift Linear Code of degree $\delta $ restricts its local encoding kernels to be the summation of at most $\delta $ cyclic permutation matrices of size $L$ . We show that on a general network, for a certain block length $L$ , every scalar Linear solution over GF( $2^{L-1}$ ) can induce an $L$ -dimensional circular-shift Linear solution with 1-bit redundancy per-edge transmission. Consequently, specific to a multicast network, such a circular-shift Linear solution of an arbitrary degree $\delta $ can be efficiently constructed, which has an interesting complexity tradeoff between encoding and decoding with different choices of $\delta $ . By further proving that circular-shift LNC is insufficient to achieve the exact capacity of certain multicast networks, we show the optimality of the efficiently constructed circular-shift Linear solution in the sense that its 1-bit redundancy is inevitable. Finally, both theoretical and numerical analysis imply that with increasing $L$ , a randomly constructed circular-shift Linear Code has Linear solvability behavior comparable to a randomly constructed permutation-based Linear Code, but has shorter overheads.
-
Circular-Shift Linear Network Coding
IEEE Transactions on Information Theory, 2019Co-Authors: Hanqi Tang, Zongpeng Li, Xiaolong Yang, Keping LongAbstract:We study a class of Linear network coding (LNC) schemes, called circular-shift LNC, whose encoding operations consist of only circular-shifts and bit-wise additions. Formulated as a special vector Linear Code over GF(2), an L-dimensional circular-shift Linear Code of degree δ restricts its local encoding kernels to be the summation of at most δ cyclic permutation matrices of size L. We show that on a general network, for a certain block length L, every scalar Linear solution over GF(2L-1) can induce an L-dimensional circular-shift Linear solution with 1-bit redundancy per-edge transmission. Consequently, specific to a multicast network, such a circular-shift Linear solution of an arbitrary degree δ can be efficiently constructed, which has an interesting complexity tradeoff between encoding and decoding with different choices of δ. By further proving that circular-shift LNC is insufficient to achieve the exact capacity of certain multicast networks, we show the optimality of the efficiently constructed circular-shift Linear solution in the sense that its 1-bit redundancy is inevitable. Finally, both theoretical and numerical analysis imply that with increasing L, a randomly constructed circular-shift Linear Code has Linear solvability behavior comparable to a randomly constructed permutation-based Linear Code, but has shorter overheads.
