Meicheng Liu

Orcid: 0000-0002-5259-1848

According to our database1, Meicheng Liu authored at least 41 papers between 2009 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
On Grain-Like Small State Stream Ciphers Against Fast Correlation Attacks: Cryptanalysis of Plantlet, Fruit-v2 and Fruit-80.
Comput. J., June, 2023

Moving a Step of ChaCha in Syncopated Rhythm.
IACR Cryptol. ePrint Arch., 2023

Collision Attacks on Round-Reduced SHA-3 Using Conditional Internal Differentials.
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

2022
Improved conditional differential attacks on lightweight hash family QUARK.
Cybersecur., 2022

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

Enhancing Differential-Neural Cryptanalysis.
Proceedings of the Advances in Cryptology - ASIACRYPT 2022, 2022

2021
Conditional Differential-Neural Cryptanalysis.
IACR Cryptol. ePrint Arch., 2021

Differential-Linear Cryptanalysis from an Algebraic Perspective.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Differential-Linear Cryptanalysis of the Lightweight Crytographic Algorithm KNOT.
Proceedings of the Information Security and Cryptology - 17th International Conference, 2021

2020
FPGA implementations of Grain v1, Mickey 2.0, Trivium, Lizard and Plantlet.
Microprocess. Microsystems, 2020

Practical Collision Attacks against Round-Reduced SHA-3.
J. Cryptol., 2020

2019
Fast Correlation Attacks on Grain-like Small State Stream Ciphers and Cryptanalysis of Plantlet, Fruit-v2 and Fruit-80.
IACR Cryptol. ePrint Arch., 2019

Cube Cryptanalysis of Round-Reduced ACORN.
Proceedings of the Information Security - 22nd International Conference, 2019

2018
Correlation Cube Attacks: From Weak-Key Distinguisher to Key Recovery.
IACR Cryptol. ePrint Arch., 2018

Symbolic-Like Computation and Conditional Differential Cryptanalysis of QUARK.
Proceedings of the Advances in Information and Computer Security, 2018

Conditional Cube Searching and Applications on Trivium-Variant Ciphers.
Proceedings of the Information Security - 21st International Conference, 2018

2017
Results on highly nonlinear Boolean functions with provably good immunity to fast algebraic attacks.
Inf. Sci., 2017

New Collision Attacks on Round-Reduced Keccak.
IACR Cryptol. ePrint Arch., 2017

A distinguisher on PRESENT-like permutations with application to SPONGENT.
Sci. China Inf. Sci., 2017

Degree Evaluation of NFSR-Based Cryptosystems.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

2016
Provable Security Evaluation of Structures against Impossible Differential and Zero Correlation Linear Cryptanalysis.
IACR Cryptol. ePrint Arch., 2016

New Insights on AES-like SPN Ciphers.
IACR Cryptol. ePrint Arch., 2016

Lightweight MDS Generalized Circulant Matrices.
IACR Cryptol. ePrint Arch., 2016

Cascade Ciphers Revisited: Indifferentiability Analysis.
IACR Cryptol. ePrint Arch., 2016

Linear Structures: Applications to Cryptanalysis of Round-Reduced Keccak.
IACR Cryptol. ePrint Arch., 2016

2015
A New Classification of 4-bit Optimal S-boxes and its Application to PRESENT, RECTANGLE and SPONGENT.
IACR Cryptol. ePrint Arch., 2015

Construction of cubic rotation symmetric bent functions in power-of-two variables.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Searching cubes for testing Boolean functions and its application to Trivium.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
On the Nonlinearity and Correlation Immunity of Two Classes of Boolean Functions.
Int. J. Softw. Informatics, 2014

On the immunity of rotation symmetric Boolean functions against fast algebraic attacks.
Discret. Appl. Math., 2014

Almost perfect algebraic immune functions with good nonlinearity.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Comments on "A design of Boolean functions resistant to (fast) algebraic cryptanalysis with efficient implementation".
Cryptogr. Commun., 2013

2012
On the immunity of Boolean functions against fast algebraic attacks using bivariate polynomial representation.
IACR Cryptol. ePrint Arch., 2012

Perfect Algebraic Immune Functions.
IACR Cryptol. ePrint Arch., 2012

Construction of Resilient and Nonlinear Boolean Functions with Almost Perfect Immunity to Algebraic and Fast Algebraic Attacks.
Proceedings of the Information Security and Cryptology - 8th International Conference, 2012

2011
Fast Algebraic Attacks and Decomposition of Symmetric Boolean Functions.
IEEE Trans. Inf. Theory, 2011

On the nonexistence of Bent Functions.
Int. J. Found. Comput. Sci., 2011

On the Resistance of Boolean Functions against Fast Algebraic Attacks.
Proceedings of the Information Security and Cryptology - ICISC 2011 - 14th International Conference, Seoul, Korea, November 30, 2011

Results on the Immunity of Boolean Functions against Probabilistic Algebraic Attacks.
Proceedings of the Information Security and Privacy - 16th Australasian Conference, 2011

2010
Identification and construction of Boolean functions with maximum algebraic immunity.
Sci. China Inf. Sci., 2010

2009
Fast Algebraic Attacks and Decomposition of Symmetric Boolean Functions
CoRR, 2009


  Loading...