Yindong Chen

Orcid: 0000-0001-8849-6087

According to our database1, Yindong Chen authored at least 35 papers between 2009 and 2025.

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

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2025
Parallel construction for constant dimension codes from mixed dimension construction.
Des. Codes Cryptogr., January, 2025

A novel hybrid neural network approach incorporating convolution and LSTM with a self-attention mechanism for web attack detection.
Appl. Intell., January, 2025

An N-State Opaque Predicate Obfuscation Algorithm Based on Henon Map.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2025

2024
A Clustering Election Game-Based and Two-Level Management Protocol for Wireless Sensor Networks.
IEEE Internet Things J., April, 2024

2023
Improving the Accuracy of Differential-Neural Distinguisher for DES, Chaskey, and PRESENT.
IEICE Trans. Inf. Syst., July, 2023

2022
Enhancing echelon-ferrers construction for constant dimension code.
J. Appl. Math. Comput., December, 2022

Constructing even-variable RSBFs with higher nonlinearity, optimal AI and almost optimal FAI.
J. Appl. Math. Comput., June, 2022

Parallel sub-code construction for constant-dimension codes.
Des. Codes Cryptogr., 2022

2021
New Construction for Constant Dimension Subspace Codes via a Composite Structure.
IEEE Commun. Lett., 2021

Low-Discrepancy Points via Energetic Variational Inference.
CoRR, 2021

A Construction for Constant Dimension Codes from the Known Codes.
Proceedings of the Wireless Algorithms, Systems, and Applications, 2021

2020
Improving the Linkage Construction With Echelon-Ferrers for Constant-Dimension Codes.
IEEE Commun. Lett., 2020

About the Tu-Deng Conjecture for $\w(t)$ Less Than or Equal to 10.
IACR Cryptol. ePrint Arch., 2020

A Note on Echelon-Ferrers Construction.
CoRR, 2020

2019
Exploring the Privacy Bound for Differential Privacy: From Theory to Practice.
EAI Endorsed Trans. Security Safety, 2019

Translation Equivalence of Boolean Functions Expressed by Primitive Element.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019

Balanced Odd-Variable RSBFs with Optimum AI, High Nonlinearity and Good Behavior against FAAs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019

Fast Algebraic Immunity of 2<sup>m+2</sup> & 2<sup>m+3</sup> variables Majority Function.
IACR Cryptol. ePrint Arch., 2019

Constructing odd-variable RSBFs with optimal algebraic immunity, good nonlinearity and good behavior against fast algebraic attacks.
Discret. Appl. Math., 2019

Construction of Const Dimension Codes from Serval Parallel Lift MRD Code.
CoRR, 2019

OPRC: An Online Personalized Reputation Calculation Model in Service-Oriented Computing Environments.
IEEE Access, 2019

A Lower Bound of Fast Algebraic Immunity of a Class of 1-Resilient Boolean Functions.
IEEE Access, 2019

Constructing Two Classes of Boolean Functions With Good Cryptographic Properties.
IEEE Access, 2019

Fast Algebraic Immunity of $2^m+2$ & $2^m+3$ Variables Majority Function.
IEEE Access, 2019

Constructing Higher Nonlinear Odd-Variable RSBFs With Optimal AI and Almost Optimal FAI.
IEEE Access, 2019

Constructing Odd-Variable Rotation Symmetric Boolean Functions With Optimal AI and Higher Nonlinearity.
IEEE Access, 2019

One Note About the Tu-Deng Conjecture in Case w nolimits(t)=5.
IEEE Access, 2019

An Online Personalized Reputation Estimation Model for Service-Oriented Systems.
Proceedings of the 2019 IEEE International Conference on Services Computing, 2019

2017
An Approach to Verifying Data Integrity for Cloud Storage.
Proceedings of the 13th International Conference on Computational Intelligence and Security, 2017

2012
Atom-Role-Based Access Control Model.
IEICE Trans. Inf. Syst., 2012

2011
Two Classes of Symmetric Boolean Functions With Optimum Algebraic Immunity: Construction and Analysis.
IEEE Trans. Inf. Theory, 2011

A Family Constructions of Odd-Variable Boolean Function with Optimum Algebraic Immunity.
Proceedings of the Security Technology, 2011

2009
A First Order Recursive Construction of Boolean Function with Optimum Algebraic Immunity.
IACR Cryptol. ePrint Arch., 2009

Constructions of Even-variable Boolean Function with Optimum Algebraic Immunity.
IACR Cryptol. ePrint Arch., 2009

Fast computation of Gröbner bases of ideals of F[x, y].
Proceedings of the IEEE International Symposium on Information Theory, 2009


  Loading...