default search action
Yindong Chen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j20]Lingru Cai
, Ruisong Huang
A Clustering Election Game-Based and Two-Level Management Protocol for Wireless Sensor Networks. IEEE Internet Things J. 11(7): 12058-12070 (2024) - 2023
- [j19]Liu Zhang
Improving the Accuracy of Differential-Neural Distinguisher for DES, Chaskey, and PRESENT. IEICE Trans. Inf. Syst. 106(7): 1240-1243 (2023) - 2022
- [j18]Xianmang He, Yindong Chen
Parallel sub-code construction for constant-dimension codes. Des. Codes Cryptogr. 90(12): 2991-3001 (2022) - [j17]Yindong Chen
Constructing even-variable RSBFs with higher nonlinearity, optimal AI and almost optimal FAI. J. Appl. Math. Comput. 68(3): 1669-1683 (2022) - [j16]Xianmang He, Yindong Chen
Enhancing echelon-ferrers construction for constant dimension code. J. Appl. Math. Comput. 68(6): 3767-3779 (2022) - 2021
- [j15]Xianmang He
New Construction for Constant Dimension Subspace Codes via a Composite Structure. IEEE Commun. Lett. 25(5): 1422-1426 (2021) - [c5]Kunxiao Zhou, Yindong Chen, Zusheng Zhang, Feng Shi, Xianmang He
A Construction for Constant Dimension Codes from the Known Codes. WASA (1) 2021: 253-262 - [i7]Yindong Chen, Yiwei Wang, Lulu Kang, Chun Liu:
Low-Discrepancy Points via Energetic Variational Inference. CoRR abs/2111.10722 (2021) - 2020
- [j14]Xianmang He
Improving the Linkage Construction With Echelon-Ferrers for Constant-Dimension Codes. IEEE Commun. Lett. 24(9): 1875-1879 (2020) - [i6]Xianmang He, Yindong Chen:
A Note on Echelon-Ferrers Construction. CoRR abs/2002.10035 (2020) - [i5]Yindong Chen, Limin Lin, Chuliang Wei:
About the Tu-Deng Conjecture for $\w(t)$ Less Than or Equal to 10. IACR Cryptol. ePrint Arch. 2020: 227 (2020)
2010 – 2019
- 2019
- [j13]Yindong Chen
One Note About the Tu-Deng Conjecture in Case w nolimits(t)=5. IEEE Access 7: 13799-13802 (2019) - [j12]Yindong Chen
Fast Algebraic Immunity of $2^m+2$ & $2^m+3$ Variables Majority Function. IEEE Access 7: 80733-80736 (2019) - [j11]Xin Du, Jianlong Xu
OPRC: An Online Personalized Reputation Calculation Model in Service-Oriented Computing Environments. IEEE Access 7: 87760-87768 (2019) - [j10]Yindong Chen
A Lower Bound of Fast Algebraic Immunity of a Class of 1-Resilient Boolean Functions. IEEE Access 7: 90145-90151 (2019) - [j9]Yindong Chen
Constructing Higher Nonlinear Odd-Variable RSBFs With Optimal AI and Almost Optimal FAI. IEEE Access 7: 133335-133341 (2019) - [j8]Yindong Chen
Constructing Odd-Variable Rotation Symmetric Boolean Functions With Optimal AI and Higher Nonlinearity. IEEE Access 7: 143866-143875 (2019) - [j7]Yindong Chen
Constructing Two Classes of Boolean Functions With Good Cryptographic Properties. IEEE Access 7: 149657-149665 (2019) - [j6]Yindong Chen, Fei Guo, Jie Ruan:
Constructing odd-variable RSBFs with optimal algebraic immunity, good nonlinearity and good behavior against fast algebraic attacks. Discret. Appl. Math. 262: 1-12 (2019) - [j5]Yindong Chen, Liu Zhang
Translation Equivalence of Boolean Functions Expressed by Primitive Element. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(4): 672-675 (2019) - [j4]Yindong Chen, Fei Guo, Hongyan Xiang, Weihong Cai, Xianmang He:
Balanced Odd-Variable RSBFs with Optimum AI, High Nonlinearity and Good Behavior against FAAs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(6): 818-824 (2019) - [j3]Xianmang He, Yuan Hong, Yindong Chen:
Exploring the Privacy Bound for Differential Privacy: From Theory to Practice. EAI Endorsed Trans. Security Safety 5(18): e2 (2019) - [c4]Jianlong Xu, Xin Du, Weihong Cai, Changsheng Zhu, Yindong Chen:
An Online Personalized Reputation Estimation Model for Service-Oriented Systems. SCC 2019: 116-120 - [i4]Xianmang He, Yindong Chen:
Construction of Const Dimension Codes from Serval Parallel Lift MRD Code. CoRR abs/1911.00154 (2019) - [i3]Yindong Chen, Fei Guo, Liu Zhang:
Fast Algebraic Immunity of 2m+2 & 2m+3 variables Majority Function. IACR Cryptol. ePrint Arch. 2019: 286 (2019) - 2017
- [c3]Yindong Chen, Liping Li, Ziran Chen:
An Approach to Verifying Data Integrity for Cloud Storage. CIS 2017: 582-585 - 2012
- [j2]Weihong Cai, Richeng Huang, Xiaoli Hou, Gang Wei, Shui Xiao, Yindong Chen:
Atom-Role-Based Access Control Model. IEICE Trans. Inf. Syst. 95-D(7): 1908-1917 (2012) - 2011
- [j1]Yindong Chen, Peizhong Lu:
Two Classes of Symmetric Boolean Functions With Optimum Algebraic Immunity: Construction and Analysis. IEEE Trans. Inf. Theory 57(4): 2522-2538 (2011) - [c2]Yindong Chen:
A Family Constructions of Odd-Variable Boolean Function with Optimum Algebraic Immunity. FGIT-SecTech 2011: 43-52
2000 – 2009
- 2009
- [c1]Yindong Chen, Yao Lu, Peizhong Lu:
Fast computation of Gröbner bases of ideals of F[x, y]. ISIT 2009: 2795-2798 - [i2]Yindong Chen, Peizhong Lu:
Constructions of Even-variable Boolean Function with Optimum Algebraic Immunity. IACR Cryptol. ePrint Arch. 2009: 130 (2009) - [i1]Yindong Chen, Peizhong Lu:
A First Order Recursive Construction of Boolean Function with Optimum Algebraic Immunity. IACR Cryptol. ePrint Arch. 2009: 134 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-18 00:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: