Yongzhuang Wei

Orcid: 0000-0002-3371-4865

According to our database1, Yongzhuang Wei authored at least 80 papers between 2004 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Novel Optimized Implementations of Lightweight Cryptographic S-Boxes via SAT Solvers.
IEEE Trans. Circuits Syst. I Regul. Pap., January, 2024

HDLBC: A lightweight block cipher with high diffusion.
Integr., January, 2024

2023
New Second-order Threshold Implementation of Sm4 Block Cipher.
J. Electron. Test., August, 2023

New Meet-in-the-Middle Attacks on FOX Block Cipher.
Comput. J., May, 2023

A theoretical analysis of generalized invariants of bijective S-boxes.
Cryptogr. Commun., May, 2023

Improved Certificateless Aggregate Signature Scheme Against Collusion Attacks for VANETs.
IEEE Syst. J., March, 2023

A new algebraic attack on DASTA.
J. High Speed Networks, 2023

Optimizing AES Threshold Implementation under the Glitch-Extended Probing Model.
IACR Cryptol. ePrint Arch., 2023

Minimal p-ary codes from non-covering permutations.
IACR Cryptol. ePrint Arch., 2023

Explicit infinite families of bent functions outside the completed Maiorana-McFarland class.
Des. Codes Cryptogr., 2023

2022
Impossible Differential Cryptanalysis of BORON.
J. Inf. Sci. Eng., 2022

A New BISON-like Construction Block Cipher: DBISON.
KSII Trans. Internet Inf. Syst., 2022

Differential cryptanalysis of full-round ANU-II ultra-lightweight block cipher.
Int. J. Distributed Sens. Networks, 2022

New attacks against reduced Rijndael-160.
IET Inf. Secur., 2022

Explicit infinite families of bent functions outside <i>MM</i><sup>#</sup>.
IACR Cryptol. ePrint Arch., 2022

New construction of highly nonlinear resilient S-boxes via linear codes.
Frontiers Comput. Sci., 2022

Two secondary constructions of bent functions without initial conditions.
Des. Codes Cryptogr., 2022

Minimal binary linear codes: a general framework based on bent concatenation.
Des. Codes Cryptogr., 2022

A note on the Signal-to-noise ratio of (n, m)-functions.
Adv. Math. Commun., 2022

The Power Analysis Based on Mean-Ridge Regression.
Proceedings of the 7th IEEE International Conference on Data Science in Cyberspace, 2022

2021
Energy Balanced Source Location Privacy Scheme Using Multibranch Path in WSNs for IoT.
Wirel. Commun. Mob. Comput., 2021

Efficient Estimate of Sentence's Representation Based on the Difference Semantics Model.
IEEE ACM Trans. Audio Speech Lang. Process., 2021

On the Modified Transparency Order of n , m -Functions.
Secur. Commun. Networks, 2021

Integral Distinguishers of the Full-Round Lightweight Block Cipher SAT_Jo.
Secur. Commun. Networks, 2021

On the transparency order relationships between one Boolean function and its decomposition functions.
J. Inf. Secur. Appl., 2021

Constructions of balanced Boolean functions on even number of variables with maximum absolute value in autocorrelation spectra 2n2<sup>☆</sup>.
Inf. Sci., 2021

Wide minimal binary linear codes from the general Maiorana-McFarland class.
Des. Codes Cryptogr., 2021

Vectorial bent functions weakly/strongly outside the completed Maiorana-McFarland class.
Discret. Appl. Math., 2021

Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound.
Cryptogr. Commun., 2021

Transparency Order of (n, m)-Functions - Its Further Characterization and Applications.
Proceedings of the Information Security - 24th International Conference, 2021

Impossible Differential Cryptanalysis and Integral Cryptanalysis of the ACE-Class Permutation.
Proceedings of the Information Security Practice and Experience: 16th International Conference, 2021

On Characterization of Transparency Order for (n, m)-functions.
Proceedings of the Information Security and Cryptology - 17th International Conference, 2021

2020
Quantum period finding based on the Bernstein-Vazirani algorithm.
Quantum Inf. Comput., 2020

A huge class of infinite sequences of minimal binary linear codes with or without crossing the Ashikhmin-Barg's bound.
IACR Cryptol. ePrint Arch., 2020

Bent functions stemming from Maiorana-McFarland class being provably outside its completed version.
IACR Cryptol. ePrint Arch., 2020

Cycle structure of generalized and closed loop invariants.
IACR Cryptol. ePrint Arch., 2020

Several classes of minimal binary linear codes violating the Aschikhmin-Barg's bound.
IACR Cryptol. ePrint Arch., 2020

Specifying cycles of minimal length for commonly used linear layers in block ciphers.
IACR Cryptol. ePrint Arch., 2020

A general framework for secondary constructions of bent and plateaued functions.
Des. Codes Cryptogr., 2020

Further analysis of bent functions from C and D which are provably outside or inside M#.
Discret. Appl. Math., 2020

2019
Designing Plateaued Boolean Functions in Spectral Domain and Their Classification.
IEEE Trans. Inf. Theory, 2019

Privacy-Preserving Cloud-Based Road Condition Monitoring With Source Authentication in VANETs.
IEEE Trans. Inf. Forensics Secur., 2019

A New Cube Attack on MORUS by Using Division Property.
IEEE Trans. Computers, 2019

Measuring the Sum-of-Squares Indicator of Boolean Functions in Encryption Algorithm for Internet of Things.
Secur. Commun. Networks, 2019

New second-order threshold implementation of AES.
IET Inf. Secur., 2019

Guess and determine cryptanalysis with variable sampling and its applications.
IET Inf. Secur., 2019

Bent functions from nonlinear permutations and conversely.
Cryptogr. Commun., 2019

2018
Generalized Nonlinear Invariant Attack and a New Design Criterion for Round Constants.
IACR Trans. Symmetric Cryptol., 2018

Large Sets of Disjoint Spectra Plateaued Functions Inequivalent to Partially Linear Functions.
IEEE Trans. Inf. Theory, 2018

Weak keys of the full MISTY1 block cipher for related-key amplified boomerang cryptanalysis.
IET Inf. Secur., 2018

Lightweight attribute based encryption scheme for mobile cloud assisted cyber-physical systems.
Comput. Networks, 2018

2017
Constructing Bent Functions Outside the Maiorana-McFarland Class Using a General Form of Rothaus.
IEEE Trans. Inf. Theory, 2017

iPMAC及VPMAC的伪造攻击 (Forgery Attack on Authenticated Cipher Mode iPMAC and VPMAC).
计算机科学, 2017

New constructions of resilient functions with strictly almost optimal nonlinearity via non-overlap spectra functions.
Inf. Sci., 2017

Efficient probabilistic algorithm for estimating the algebraic properties of Boolean functions for large n.
Inf. Sci., 2017

Bent Functions in C and D Outside the Completed Maiorana-McFarland Class.
Proceedings of the Codes, Cryptology and Information Security, 2017

2016
On algebraic properties of S-boxes designed by means of disjoint linear codes.
Int. J. Comput. Math., 2016

Infinite classes of vectorial plateaued functions, permutations and complete permutations.
Discret. Appl. Math., 2016

Optimizing the placement of tap positions and guess and determine cryptanalysis with variable sampling.
CoRR, 2016

2015
Constructions of Bent - Negabent Functions and Their Relation to the Completed Maiorana - McFarland Class.
IEEE Trans. Inf. Theory, 2015

2014
The higher-order meet-in-the-middle attack and its application to the Camellia block cipher.
Theor. Comput. Sci., 2014

Call for papers: systematic network optimizations for security parameters (security and communication networks).
Secur. Commun. Networks, 2014

Key recovery attacks on Grain family using BSW sampling and certain weaknesses of the filtering function.
IACR Cryptol. ePrint Arch., 2014

Optimizing the Placement of Tap Positions.
Proceedings of the Cryptography and Information Security in the Balkans, 2014

2013
On the approximation of S-boxes via Maiorana-McFarland functions.
IET Inf. Secur., 2013

Generic related-key and induced chosen IV attacks using the method of key differentiation.
IACR Cryptol. ePrint Arch., 2013

Weak Keys of the Full MISTY1 Block Cipher for Related-Key Differential Cryptanalysis.
Proceedings of the Topics in Cryptology - CT-RSA 2013, 2013

2012
Guess and Determine Attacks on Filter Generators - Revisited.
IEEE Trans. Inf. Theory, 2012

On the Construction of Cryptographically Significant Boolean Functions Using Objects in Projective Geometry Spaces.
IEEE Trans. Inf. Theory, 2012

Constructions of 1-resilient Boolean functions on odd number of variables with a high nonlinearity.
Secur. Commun. Networks, 2012

Cryptanalysis of reduced versions of the Camellia block cipher.
IET Inf. Secur., 2012

Weak Keys of the Full MISTY1 Block Cipher for Related-Key Cryptanalysis.
IACR Cryptol. ePrint Arch., 2012

Parallelized Near-Duplicate Document Detection Algorithm for Large Scale Chinese Web Pages.
Proceedings of the 13th International Conference on Parallel and Distributed Computing, 2012

Meet-in-the-Middle Attack on Reduced Versions of the Camellia Block Cipher.
Proceedings of the Advances in Information and Computer Security, 2012

2011
A New Correlation Attack on Nonlinear Combining Generators.
IEEE Trans. Inf. Theory, 2011

2010
Meet-in-the-Middle Attack on 8 Rounds of the AES Block Cipher under 192 Key Bits.
IACR Cryptol. ePrint Arch., 2010

2009
New related-key rectangle attacks on reduced AES-192 and AES-256.
Sci. China Ser. F Inf. Sci., 2009

2007
Maximum Autocorrelation Analysis of Nonlinear Combining Functions in Stream Ciphers.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2005
A construction of resilient functions with satisfying synthetical cryptographic criteria.
Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, 2005

2004
New construction of resilient functions with satisfying multiple cryptographic criteria.
Proceedings of the 3rd International Conference on Information Security, 2004


  Loading...