2025
Distribution of linear and second-highest degree parts of maximum-length feedback functions.
Cryptogr. Commun., January, 2025
2024
Des. Codes Cryptogr., October, 2024
A Novel Approach for Bent Functions with Dillon-like Exponents and Characterizing Three Classes of Bent Functions via Kloosterman Sums.
CoRR, 2024
A Dynamic Adaptive SCL Decoding for Polar Codes Based on Frozen Bits.
Proceedings of the 100th IEEE Vehicular Technology Conference, 2024
2023
Proofs of Conjectures on Extremal Weight De Bruijn Sequences.
IEEE Trans. Inf. Theory, August, 2023
On the Differential Spectrum and the APcN Property of a Class of Power Functions Over Finite Fields.
IEEE Trans. Inf. Theory, 2023
Properties of the cycles that contain all vectors of weight $\le k$.
Des. Codes Cryptogr., 2023
A relation between sequences generated by Golomb's preference algorithm.
Des. Codes Cryptogr., 2023
A Fano Decoding for Polar Codes Based on Node Acceleration.
Proceedings of the 98th IEEE Vehicular Technology Conference, 2023
2022
Algorithms for the Minimal Rational Fraction Representation of Sequences Revisited.
IEEE Trans. Inf. Theory, 2022
2021
Binomial permutations over finite fields with even characteristic.
Des. Codes Cryptogr., 2021
A class of APcN power functions over finite fields of even characteristic.
CoRR, 2021
A barrier method for frictional contact on embedded interfaces.
CoRR, 2021
Sybil Attacks and Defense on Differential Privacy based Federated Learning.
Proceedings of the 20th IEEE International Conference on Trust, 2021
Construction of De Bruijn Sequences from l-sequences.
Proceedings of the IEEE International Symposium on Information Theory, 2021
Binary Sequences Derived from Monomial Permutation Polynomials over GF(2<sup>p</sup>).
Proceedings of the Information Security and Cryptology - 17th International Conference, 2021
2020
Weak Grain-Like Structures.
IEEE Trans. Inf. Theory, 2020
Longest subsequences shared by two de Bruijn sequences.
Des. Codes Cryptogr., 2020
Mitigating Sybil Attacks on Differential Privacy based Federated Learning.
CoRR, 2020
The Numbers of De Bruijn Sequences in Extremal Weight Classes.
Proceedings of the IEEE International Symposium on Information Theory, 2020
On the k-Error Linear Complexities of De Bruijn Sequences.
Proceedings of the Information Security and Cryptology - 16th International Conference, 2020
2019
A new construction of zero-difference balanced functions and two applications.
Des. Codes Cryptogr., 2019
A hybrid material-point spheropolygon-element method for solid and granular material interaction.
CoRR, 2019
Binary sequences with period N and nonlinear complexity N - 2.
Cryptogr. Commun., 2019
2018
Lower and Upper Bounds on the Density of Irreducible NFSRs.
IEEE Trans. Inf. Theory, 2018
Investigating Key User Experiencing Engineering Aspects in Software-as-a-Service Service Delivery Model.
CoRR, 2018
2017
Transition Mappings between De Bruijn Sequences.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017
The adjacency graphs of some feedback shift registers.
Des. Codes Cryptogr., 2017
On the number of irreducible linear transformation shift registers.
Des. Codes Cryptogr., 2017
On affine sub-families of Grain-like structures.
Des. Codes Cryptogr., 2017
On s-uniform property of compressing sequences derived from primitive sequences modulo odd prime powers.
Sci. China Inf. Sci., 2017
AAD and least-square Monte Carlo: Fast Bermudan-style options and XVA Greeks.
Algorithmic Finance, 2017
2016
Template-Based Model for Mongolian-Chinese Machine Translation.
J. Adv. Comput. Intell. Intell. Informatics, 2016
Linear complexity of Ding-Helleseth sequences of order 2 over GF(l).
Cryptogr. Commun., 2016
Further results on the nonlinearity of maximum-length NFSR feedbacks.
Cryptogr. Commun., 2016
2015
Linear complexity of binary generalized cyclotomic sequences over GF(q).
J. Complex., 2015
A Group-theory Method to The Cycle Structures of Feedback Shift Registers.
IACR Cryptol. ePrint Arch., 2015
Two classes of permutation polynomials having the form (x<sup>2<sup>m</sup></sup>+x+δ)<sup>s</sup>+x.
Finite Fields Their Appl., 2015
New results on nonexistence of generalized bent functions.
Des. Codes Cryptogr., 2015
Mongolian Inflection Suffix Processing in NLP: A Case Study.
Proceedings of the Natural Language Processing and Chinese Computing - 4th CCF Conference, 2015
LSA-Based Chinese-Slavic Mongolian NER Disambiguation.
Proceedings of the 15th IEEE International Conference on Computer and Information Technology, 2015
2014
Distribution Properties of Compressing Sequences Derived From Primitive Sequences Modulo Odd Prime Powers.
IEEE Trans. Inf. Theory, 2014
Strong pseudoprimes to the first eight prime bases.
Math. Comput., 2014
On the Linear Complexity of New Modified Jacobi Sequences.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014
On the distinctness of binary sequences derived from $2$-adic expansion of m-sequences over finite prime fields.
CoRR, 2014
2013
Constructing odd Variable Boolean Functions with Optimal Algebraic Immunity.
Int. J. Found. Comput. Sci., 2013
2011
A New Lattice-Based Public-Key Cryptosystem Mixed with a Knapsack.
Proceedings of the Cryptology and Network Security - 10th International Conference, 2011
2009
A New Lattice-Based Cryptosystem Mixed with a Knapsack.
IACR Cryptol. ePrint Arch., 2009
Covering Radius of Two-dimensional Lattices.
IACR Cryptol. ePrint Arch., 2009