Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ziran Tu

dblp:71/9583 · DBLP profile ↗
← Back
8ranked-venue papers
7as first author
3since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 4 · 3 first-author · 2 since 2021Theory of computation · 3 · 3 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
3 papers
Cryptographic primitives and cryptanalysis · 100%
Theoretical computer science
2 papers
Coding theory · 100%

Topics — the 9 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis
boolean functions
0.912025
New Characterizations of Dillon-like Hyperbent Functions via Dickson Polynomials · J. Cryptol. 2025
Cryptographic primitives and cryptanalysis › finite field
permutation polynomials
0.822020
A Class of Quadrinomial Permutations With Boomerang Uniformity Four · IEEE Trans. Inf. Theory 2020
More permutation polynomials with differential uniformity six · Sci. China Inf. Sci. 2018
Coding theory
cryptographic function
0.712023
On the Differential Spectrum and the APcN Property of a Class of Power Functions Over Finite Fields · IEEE Trans. Inf. Theory 2023
Coding theory › boolean functions
power functions
0.712023
On the Differential Spectrum and the APcN Property of a Class of Power Functions Over Finite Fields · IEEE Trans. Inf. Theory 2023
Cryptographic primitives and cryptanalysis
block cipher
0.412020
A Class of Quadrinomial Permutations With Boomerang Uniformity Four · IEEE Trans. Inf. Theory 2020
Cryptographic primitives and cryptanalysis › block cipher cryptanalysis
boomerang uniformity
0.412020
A Class of Quadrinomial Permutations With Boomerang Uniformity Four · IEEE Trans. Inf. Theory 2020
Cryptographic primitives and cryptanalysis › block cipher
s-box
0.412020
A Class of Quadrinomial Permutations With Boomerang Uniformity Four · IEEE Trans. Inf. Theory 2020
Coding theory
finite fields
0.212023
On the Differential Spectrum and the APcN Property of a Class of Power Functions Over Finite Fields · IEEE Trans. Inf. Theory 2023
Coding theory › boolean functions
differential uniformity
0.112018
More permutation polynomials with differential uniformity six · Sci. China Inf. Sci. 2018

Methods — techniques the papers use, named apart from their topics

finite field theory · 1.3dickson polynomials · 0.9permutation polynomial construction · 0.7boomerang connectivity table · 0.4
YearPublicationVenuePosition
2025 New Characterizations of Dillon-like Hyperbent Functions via Dickson Polynomials
Ziran Tu, Chunlei Li 0001, Xiangyong Zeng, Tor Helleseth, Nian Li 0005
J. Cryptol.1
2023 On the Differential Spectrum and the APcN Property of a Class of Power Functions Over Finite Fields
abstract
In this paper, we investigate the power function$F(x)=x^{d}$over the finite field$\mathbb {F}_{2^{4n}}$, where$n$is a positive integer and$d=2^{3n}+2^{2n}+2^{n}-1$. We prove that this power function is AP$c\text{N}$with respect to all$c\in \mathbb {F}_{2^{4n}}\setminus \{1\}$satisfying$c^{2^{2n}+1}=1$, and we determine its$c$-differential spectrum. To the best of our knowledge, this is the second class of AP$c\text{N}$power functions over finite fields of even characteristic. By the same proof ideas, we completely determine the differential spectrum of this function, and give an affirmative answer to a recent conjecture proposed by Budaghyan, Calderini, Carlet, Davidova and Kaleyski.
Ziran Tu, Nian Li 0005, Yanan Wu 0001, Xiangyong Zeng, Xiaohu Tang 0004, Yupeng Jiang 0001
IEEE Trans. Inf. Theory1
2021 Binomial permutations over finite fields with even characteristic
Ziran Tu, Xiangyong Zeng
Des. Codes Cryptogr.1
2020 A Class of Quadrinomial Permutations With Boomerang Uniformity Four
abstract
In Eurocrypt'18, Cid et al. proposed a new cryptanalysis tool called Boomerang Connectivity Table (BCT), to evaluate S-boxes of block ciphers. Later, Boura and Canteaut further investigated the new parameter Boomerang uniformity for cryptographic S-boxes. It is of great interest to find new S-boxes with low Boomerang uniformity for even dimensions. In this paper, we prove that a class of permutation quadrinomials over F2(2m)with m odd has Boomerang uniformity four, which gives the fifth class of such kind of permutation polynomials. Further, the occurrences of 0 and 4 in the BCTs of the investigated permutation polynomials are also completely determined.
Ziran Tu, Nian Li 0005, Xiangyong Zeng, Junchao Zhou
IEEE Trans. Inf. Theory1
2018 More permutation polynomials with differential uniformity six
Ziran Tu, Xiangyong Zeng, Zhiyong Zhang 0002
Sci. China Inf. Sci.1
2012 Boolean functions optimizing most of the cryptographic criteria
Ziran Tu, Yingpu Deng
Discret. Appl. Math.1
2011 A New Lattice-Based Public-Key Cryptosystem Mixed with a Knapsack
Yanbin Pan 0001, Yingpu Deng, Ziran Tu
CANS4
2011 A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity
Ziran Tu, Yingpu Deng
Des. Codes Cryptogr.1