Tian Tian

Cryptogr. Commun., March, 2024

2023

Structural evaluation of AES-like ciphers against mixture differential cryptanalysis.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., December, 2023

A New Method for Searching Cubes and Its Application to 815-Round Trivium.

[BibT_eX]

[DOI]

Chen Liu

J. Syst. Sci. Complex., October, 2023

A Low-Complexity Key-Recovery Attack on 6-Round Midori64.

[BibT_eX]

[DOI]

J. Syst. Sci. Complex., August, 2023

LOL: A Highly Flexible Framework for Designing Stream Ciphers.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

The Triangle Differential Cryptanalysis.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Privacy - 28th Australasian Conference, 2023

A New Correlation Cube Attack Based on Division Property.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Privacy - 28th Australasian Conference, 2023

2022

Structure Evaluation of AES-like Ciphers against Mixture Differential Cryptanalysis.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

An Experimentally Verified Attack on 820-Round Trivium (Full Version).

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

A necessary and sufficient condition for a class of nonsingular Galois NFSRs.

[BibT_eX]

[DOI]

Xiao-Juan Wang

Finite Fields Their Appl., 2022

A generic method for investigating nonsingular Galois NFSRs.

[BibT_eX]

[DOI]

Xiao-Juan Wang

Des. Codes Cryptogr., 2022

An Experimentally Verified Attack on 820-Round Trivium.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Cryptology - 18th International Conference, 2022

2021

The MILP-aided conditional differential attack and its application to Trivium.

[BibT_eX]

[DOI]

Fan-Yang Zeng

Des. Codes Cryptogr., 2021

An improved degree evaluation method of NFSR-based cryptosystems.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2021

2020

Constructing de Bruijn Sequences Based on a New Necessary Condition.

[BibT_eX]

[DOI]

Zhongxiao Wang

Xiangyu Wang

Int. J. Found. Comput. Sci., 2020

Algebraic method to recover superpolies in cube attacks.

[BibT_eX]

[DOI]

IET Inf. Secur., 2020

A Practical Key-Recovery Attack on 805-Round Trivium.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Improved distinguisher search techniques based on parity sets.

[BibT_eX]

[DOI]

Sci. China Inf. Sci., 2020

2019

Revisit Division Property Based Cube Attacks: Key-Recovery or Distinguishing Attacks?

[BibT_eX]

[DOI]

IACR Trans. Symmetric Cryptol., 2019

A New Method for Finding Affine Sub-Families of NFSR Sequences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

A New Distinguishing Attack on Grain-V1 with 111 Initialization Rounds.

[BibT_eX]

[DOI]

J. Syst. Sci. Complex., 2019

Constructions of de Bruijn sequences from a full-length shift register and an irreducible LFSR.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2019

New results on the minimal polynomials of modified de Bruijn sequences.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2019

On the uniqueness of a type of cascade connection representations for NFSRs.

[BibT_eX]

[DOI]

Jia-Min Zhang

Des. Codes Cryptogr., 2019

An interleaved method for constructing de Bruijn sequences.

[BibT_eX]

[DOI]

Xiao-Xin Zhao

Discret. Appl. Math., 2019

2018

On the Affine Sub-Families of Quadratic NFSRs.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Deterministic Cube Attacks: A New Method to Recover Superpolies in Practice.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

A New Framework for Finding Nonlinear Superpolies in Cube Attacks against Trivium-Like Ciphers.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

New Insights into Divide-and-Conquer Attacks on the Round-Reduced Keccak-MAC.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

The adjacency graphs of FSRs with a class of affine characteristic functions.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2018

A ring-like cascade connection and a class of NFSRs with the same cycle structures.

[BibT_eX]

[DOI]

Xiao-Xin Zhao

Des. Codes Cryptogr., 2018

2017

All-subkeys-recovery attacks on a variation of Feistel-2 block ciphers.

[BibT_eX]

[DOI]

Dong Yang

IET Inf. Secur., 2017

Internal state recovery of Grain v1 employing guess-and-determine attack.

[BibT_eX]

[DOI]

IET Inf. Secur., 2017

Conditional differential attacks on Grain-128a stream cipher.

[BibT_eX]

[DOI]

IET Inf. Secur., 2017

Improved conditional differential attacks on Grain v1.

[BibT_eX]

[DOI]

IET Inf. Secur., 2017

2015

Further Results on the Decomposition of an NFSR Into the Cascade Connection of an NFSR Into an LFSR.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

A note on determine the greatest common subfamily of two NFSRs by Gröbner basis.

[BibT_eX]

[DOI]

Zhongxiao Wang

J. Syst. Sci. Complex., 2015

On affine sub-families of the NFSR in Grain.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2015

2014

On Decomposition of an NFSR into a Cascade Connection of Two Smaller.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

On the distinctness of modular reductions of primitive sequences over Z/(232-1).

[BibT_eX]

[DOI]

Qun-Xiong Zheng

Des. Codes Cryptogr., 2014

On the largest affine sub-families of a family of NFSR sequences.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2014

2013

Further Result on Distribution Properties of Compressing Sequences Derived From Primitive Sequences Over Z/(p<sup>e</sup>).

[BibT_eX]

[DOI]

Qun-Xiong Zheng

IEEE Trans. Inf. Theory, 2013

On the Distinctness of Binary Sequences Derived From Primitive Sequences Modulo Square-Free Odd Integers.

[BibT_eX]

[DOI]

Qun-Xiong Zheng

IEEE Trans. Inf. Theory, 2013

On the Density of Irreducible NFSRs.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

On the decomposition of an NFSR into the cascade connection of an NFSR into an LFSR.

[BibT_eX]

[DOI]

J. Complex., 2013

On the affine equivalence relation between two classes of Boolean functions with optimal algebraic immunity.

[BibT_eX]

[DOI]

Huajin Chen

Des. Codes Cryptogr., 2013

2012

On the distinctness of modular reductions of primitive sequences modulo square-free odd integers.

[BibT_eX]

[DOI]

Qunxiong Zheng

Inf. Process. Lett., 2012

2010

2-adic complexity of binary m-sequences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Expected values for the rational complexity of finite binary sequences.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2010

2009

Autocorrelation and Distinctness of Decimations of l-Sequences.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2009

Typical primitive polynomials over integer residue rings.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2009

Periods of termwise exclusive ors of maximal length FCSR sequences.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2009

Linearity properties of binary FCSR sequences.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2009

A note on the crosscorrelation of maximal length FCSR sequences.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2009

2007

Period and Complementarity Properties of FCSR Memory Sequences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

Injectivity of Compressing Maps on Primitive Sequences Over BBZ/(p<sup>e</sup>).

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

2006

On FCSR Memory Sequences.

[BibT_eX]

[DOI]