Yupeng Jiang

Orcid: 0000-0003-1347-2560

Affiliations:
  • Beihang University, School of Cyber Science and Technology, Beijing, China
  • CAS, Institute of Information Engineering, China (2013-2021)
  • Chinese Academy of Sciences (CAS), Academy of Mathematics and Systems Science, China (PhD 2013)


According to our database1, Yupeng Jiang authored at least 28 papers between 2014 and 2026.

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

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Possible values for the nonlinearity of de bruijn feedback functions.
Des. Codes Cryptogr., March, 2026

ESCM: A Toolkit for Efficient and Secure Outsourced Computation With Multiple Keys.
IEEE Trans. Inf. Forensics Secur., 2026

2024
On prefer-one sequences.
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

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

2022
Algorithms for the Minimal Rational Fraction Representation of Sequences Revisited.
IEEE Trans. Inf. Theory, 2022

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

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

2018
Lower and Upper Bounds on the Density of Irreducible NFSRs.
IEEE Trans. Inf. Theory, 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 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

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

2014
Distribution Properties of Compressing Sequences Derived From Primitive Sequences Modulo Odd Prime Powers.
IEEE Trans. Inf. Theory, 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


  Loading...