Wen-Feng Qi

Orcid: 0000-0002-3031-4719

Affiliations:
  • PLA Strategic Support Force Information Engineering University, Zhengzhou, China
  • State Key Laboratory of Mathematical Engineering and Advanced Computing, Zhengzhou, China


According to our database1, Wen-Feng Qi authored at least 80 papers between 2003 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Improved mixture differential attacks on 6-round AES-like ciphers towards time and data complexities.
J. Inf. Secur. Appl., February, 2024

2023
Non-Existence of One-Byte Active Impossible Differentials for 5-Round AES in the Master-Key Setting.
J. Syst. Sci. Complex., June, 2023

Construction of equivalent linear trails and multiple linear attack on reduced-round GIFT-64.
J. Cryptogr. Eng., June, 2023

Linear Cryptanalysis of Lightweight Block Cipher WARP.
Proceedings of the Provable and Practical Security, 2023

SAT-Aided Differential Cryptanalysis of Lightweight Block Ciphers Midori, MANTIS and QARMA.
Proceedings of the Information and Communications Security - 25th International Conference, 2023

Differential-Linear Cryptanalysis of Round-Reduced SPARX-64/128.
Proceedings of the Information Security and Cryptology - 19th International Conference, 2023

2021
A new result on irreducible NFSRs with respect to cascade connection.
Finite Fields Their Appl., 2021

Binary Sequences Derived from Monomial Permutation Polynomials over GF(2<sup>p</sup>).
Proceedings of the Information Security and Cryptology - 17th International Conference, 2021

On the Provable Security Against Truncated Impossible Differential Cryptanalysis for AES in the Master-Key Setting.
Proceedings of the Information Security and Cryptology - 17th International Conference, 2021

2020
Improved integral attacks on 24-round LBlock and LBlock-s.
IET Inf. Secur., 2020

The minimal polynomials of modified de Bruijn sequences revisited.
Finite Fields Their Appl., 2020

On a class of isomorphic NFSRs.
Des. Codes Cryptogr., 2020

Further results on the equivalence between Galois NFSRs and Fibonacci NFSRs.
Des. Codes Cryptogr., 2020

The cycle structure of NFSR(f<sup>d</sup>) and its applications.
Cryptogr. Commun., 2020

Remarks on Mixture and Yoyo Distinguishers for Reduced-Round AES.
Proceedings of the 5th International Conference on Computer and Communication Systems, 2020

2019
A New Method for Finding Affine Sub-Families of NFSR Sequences.
IEEE Trans. Inf. Theory, 2019

A New Distinguishing Attack on Grain-V1 with 111 Initialization Rounds.
J. Syst. Sci. Complex., 2019

Constructions of de Bruijn sequences from a full-length shift register and an irreducible LFSR.
Finite Fields Their Appl., 2019

New results on the minimal polynomials of modified de Bruijn sequences.
Finite Fields Their Appl., 2019

Provable security against impossible differential and zero correlation linear cryptanalysis of some feistel structures.
Des. Codes Cryptogr., 2019

On the uniqueness of a type of cascade connection representations for NFSRs.
Des. Codes Cryptogr., 2019

An interleaved method for constructing de Bruijn sequences.
Discret. Appl. Math., 2019

2018
On the Affine Sub-Families of Quadratic NFSRs.
IEEE Trans. Inf. Theory, 2018

Observations on the truncated differential of SP block ciphers and their applications to mCrypton and CRYPTON V1.0.
IET Inf. Secur., 2018

Impossible Differential Attack on QARMA Family of Block Ciphers.
IACR Cryptol. ePrint Arch., 2018

Preliminary results on the minimal polynomial of modified de Bruijn sequences.
Finite Fields Their Appl., 2018

The adjacency graphs of FSRs with a class of affine characteristic functions.
Finite Fields Their Appl., 2018

A ring-like cascade connection and a class of NFSRs with the same cycle structures.
Des. Codes Cryptogr., 2018

Distribution Properties of Binary Sequences Derived from Primitive Sequences Modulo Square-free Odd Integers.
Proceedings of the Information Security and Cryptology - 14th International Conference, 2018

2017
All-subkeys-recovery attacks on a variation of Feistel-2 block ciphers.
IET Inf. Secur., 2017

Impossible differential attacks on the SKINNY family of block ciphers.
IET Inf. Secur., 2017

Internal state recovery of Grain v1 employing guess-and-determine attack.
IET Inf. Secur., 2017

Conditional differential attacks on Grain-128a stream cipher.
IET Inf. Secur., 2017

Improved conditional differential attacks on Grain v1.
IET Inf. Secur., 2017

2016
On the spectral immunity of periodic sequences restricted to binary annihilators.
Des. Codes Cryptogr., 2016

On the distinctness of primitive sequences over Z/(p e q) modulo 2.
Cryptogr. Commun., 2016

2015
Further Results on the Decomposition of an NFSR Into the Cascade Connection of an NFSR Into an LFSR.
IEEE Trans. Inf. Theory, 2015

A note on determine the greatest common subfamily of two NFSRs by Gröbner basis.
J. Syst. Sci. Complex., 2015

Further results on the distinctness of modulo 2 reductions of primitive sequences over Z/(2<sup>32</sup>-1).
Des. Codes Cryptogr., 2015

On affine sub-families of the NFSR in Grain.
Des. Codes Cryptogr., 2015

2014
A New Necessary Condition for Feedback Functions of de Bruijn Sequences.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014

On Decomposition of an NFSR into a Cascade Connection of Two Smaller.
IACR Cryptol. ePrint Arch., 2014

On the distinctness of modular reductions of primitive sequences over Z/(232-1).
Des. Codes Cryptogr., 2014

On the largest affine sub-families of a family of NFSR sequences.
Des. Codes Cryptogr., 2014

2013
Further Result on Distribution Properties of Compressing Sequences Derived From Primitive Sequences Over Z/(p<sup>e</sup>).
IEEE Trans. Inf. Theory, 2013

On the Distinctness of Binary Sequences Derived From Primitive Sequences Modulo Square-Free Odd Integers.
IEEE Trans. Inf. Theory, 2013

Further Results on the Distinctness of Binary Sequences Derived From Primitive Sequences Modulo Square-Free Odd Integers.
IEEE Trans. Inf. Theory, 2013

On the Density of Irreducible NFSRs.
IEEE Trans. Inf. Theory, 2013

On the decomposition of an NFSR into the cascade connection of an NFSR into an LFSR.
J. Complex., 2013

On the Construction of Boolean Functions with Optimal Algebraic Immunity Based on Factorization of Numbers of Variables.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013

On the affine equivalence relation between two classes of Boolean functions with optimal algebraic immunity.
Des. Codes Cryptogr., 2013

Finding slid pairs in trivium with MiniSat.
Sci. China Inf. Sci., 2013

2012
Distribution of one-error linear complexity of binary sequences for arbitrary prime period.
J. Syst. Sci. Complex., 2012

On the distinctness of modular reductions of primitive sequences modulo square-free odd integers.
Inf. Process. Lett., 2012

Two classes of sequences derived from single cycle T-functions.
Finite Fields Their Appl., 2012

Asymptotic analysis on the normalized k-error linear complexity of binary sequences.
Des. Codes Cryptogr., 2012

Remarks on the generalized cyclotomic sequences of length $$2p^{m}$$.
Appl. Algebra Eng. Commun. Comput., 2012

2011
A new result on the distinctness of primitive sequences over Z/(pq) modulo 2.
Finite Fields Their Appl., 2011

2010
Distribution properties of compressing sequences derived from primitive sequences over Z/(p<sup>e</sup>).
IEEE Trans. Inf. Theory, 2010

2-adic complexity of binary m-sequences.
IEEE Trans. Inf. Theory, 2010

On the k-error linear complexity of l-sequences.
Finite Fields Their Appl., 2010

Expected values for the rational complexity of finite binary sequences.
Des. Codes Cryptogr., 2010

2009
Autocorrelation and Distinctness of Decimations of l-Sequences.
SIAM J. Discret. Math., 2009

Typical primitive polynomials over integer residue rings.
Finite Fields Their Appl., 2009

Periods of termwise exclusive ors of maximal length FCSR sequences.
Finite Fields Their Appl., 2009

Linearity properties of binary FCSR sequences.
Des. Codes Cryptogr., 2009

A note on the crosscorrelation of maximal length FCSR sequences.
Des. Codes Cryptogr., 2009

Autocorrelations of <i>l</i>-sequences with prime connection integer.
Cryptogr. Commun., 2009

2007
Period and Complementarity Properties of FCSR Memory Sequences.
IEEE Trans. Inf. Theory, 2007

Injectivity of Compressing Maps on Primitive Sequences Over BBZ/(p<sup>e</sup>).
IEEE Trans. Inf. Theory, 2007

Small Private-Exponent Attack on RSA with Primes Sharing Bits.
Proceedings of the Information Security, 10th International Conference, 2007

Linear Equation on Polynomial Single Cycle T-Functions.
Proceedings of the Information Security and Cryptology, Third SKLOIS Conference, 2007

Four Families of Binary Sequences with Low Correlation and Large Linear Complexity.
Proceedings of the Information Security and Cryptology, Third SKLOIS Conference, 2007

2006
Further Results on the Distinctness of Decimations of l-Sequences.
IEEE Trans. Inf. Theory, 2006

Autocorrelations of Maximum Period FCSR Sequences.
SIAM J. Discret. Math., 2006

On the Distinctness of Decimations of Generalized <i>l</i>-Sequences.
Proceedings of the Sequences and Their Applications, 2006

Analysis of Designing Interleaved ZCZ Sequence Families.
Proceedings of the Sequences and Their Applications, 2006

On FCSR Memory Sequences.
Proceedings of the Sequences and Their Applications, 2006

Construction and Analysis of Boolean Functions of 2<i>t</i>+1 Variables with Maximum Algebraic Immunity.
Proceedings of the Advances in Cryptology, 2006

2003
Partial period distribution of FCSR sequences.
IEEE Trans. Inf. Theory, 2003


  Loading...