Zijian Zhou
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Zijian Zhou has a total of 36 co-authors. Here are the top co-authors by number of shared publications:
- Chang-An Zhao
School of Mathematics, Sun Yat-Sen University, Guangzhou, China
2 shared publications - Fangguo Zhang
Sun Yat-sen University
2 shared publications - Guanju Xiao
College of Science National University of Defense Technology 410073 Changsha China
2 shared publications - Longjiang Qu
National University of Defense Technology
2 shared publications - Xiaoheng Deng
School of Electronic Information, Central South University, Changsha 410083, China
2 shared publications - Xinjun Pei
Xinjiang University
2 shared publications
Latest Publications
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (22) , 54066-54083
Dual-VFL: An Efficient Dual-Server Verifiable Federated Learning Framework Resistant to Model Inconsistency Attacks
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (22) , 54066-54083
Dual-VFL: An Efficient Dual-Server Verifiable Federated Learning Framework Resistant to Model Inconsistency Attacks
- 7 February 2026
- Published by Elsevier in Journal of Systems Architecture
- Vol. 174
ZJC: Constructing fully local repair in erasure codes for distributed cloud storage
- 7 February 2026
- Published by Elsevier in Journal of Systems Architecture
- Vol. 174
ZJC: Constructing fully local repair in erasure codes for distributed cloud storage
- 22 August 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of Quantum Information
- Vol. 23 (06)
Quantum algorithm for solving discrete logarithm problem on Jacobians of genus 3 hyperelliptic curves
Due to its smaller key sizes, the hyperelliptic curve cryptosystem (HCC) has gained significant interest in contemporary cryptography, which typically relies on the discrete logarithm problem associated with hyperelliptic curves (HCDLP) of genus 2 or 3. Regrettably, Shor’s algorithm poses a potential risk to this widely applied cryptosystem. However, the precise quantum cost of HCDLP of genus 3 remains untapped due to the intricate nature of the divisor addition formulas. In this paper, we leverage Riemann–Roch theorem and the properties of symmetric polynomials to design reversible divisor addition in the Jacobian group of genus 3. Then, we analyze the quantum resources required to solve HCDLP over [ ]-bit prime fields, provide concrete estimates for classical 128-bit and 256-bit security levels, and compare them with those needed for ECDLP. The findings demonstrate that solving HCDLP demands more quantum resources than solving ECDLP at the same security level.
- 22 August 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of Quantum Information
- Vol. 23 (06)
Quantum algorithm for solving discrete logarithm problem on Jacobians of genus 3 hyperelliptic curves
Due to its smaller key sizes, the hyperelliptic curve cryptosystem (HCC) has gained significant interest in contemporary cryptography, which typically relies on the discrete logarithm problem associated with hyperelliptic curves (HCDLP) of genus 2 or 3. Regrettably, Shor’s algorithm poses a potential risk to this widely applied cryptosystem. However, the precise quantum cost of HCDLP of genus 3 remains untapped due to the intricate nature of the divisor addition formulas. In this paper, we leverage Riemann–Roch theorem and the properties of symmetric polynomials to design reversible divisor addition in the Jacobian group of genus 3. Then, we analyze the quantum resources required to solve HCDLP over [ ]-bit prime fields, provide concrete estimates for classical 128-bit and 256-bit security levels, and compare them with those needed for ECDLP. The findings demonstrate that solving HCDLP demands more quantum resources than solving ECDLP at the same security level.
- 25 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (9) , 6771-6784
Topological Invariants for Linear Codes and APN Functions
In this paper, we try to apply methods from topological data analysis (TDA) to study geometric properties invariant under code equivalence transformation, especially for the linear codes associated with almost perfect nonlinear (APN) functions which offer optimal resistance to differential attacks and are very important in the design of block ciphers in cryptography. By employing persistent homology from TDA and tools from graph theory, we present new CCZ-invariants for APN functions. Some of them are computationally efficient and sufficient to distinguish many known APN functions, including $x^{3}$ and $x^{9}$ (resp. $x^{33}$ ) over $\mathbb {F}_{2^{7}}$ (resp. $\mathbb {F}_{2^{9}}$ ) for which previously known invariants fail to do so.
- 25 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (9) , 6771-6784
Topological Invariants for Linear Codes and APN Functions
In this paper, we try to apply methods from topological data analysis (TDA) to study geometric properties invariant under code equivalence transformation, especially for the linear codes associated with almost perfect nonlinear (APN) functions which offer optimal resistance to differential attacks and are very important in the design of block ciphers in cryptography. By employing persistent homology from TDA and tools from graph theory, we present new CCZ-invariants for APN functions. Some of them are computationally efficient and sufficient to distinguish many known APN functions, including $x^{3}$ and $x^{9}$ (resp. $x^{33}$ ) over $\mathbb {F}_{2^{7}}$ (resp. $\mathbb {F}_{2^{9}}$ ) for which previously known invariants fail to do so.
- 21 January 2025
- Published by Elsevier in Finite Fields and Their Applications
- Vol. 103
Neighborhood of vertices in the isogeny graph of principally polarized superspecial abelian surfaces
- 21 January 2025
- Published by Elsevier in Finite Fields and Their Applications
- Vol. 103
Neighborhood of vertices in the isogeny graph of principally polarized superspecial abelian surfaces
- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 19 (2) , 698-715
Endomorphism rings of supersingular elliptic curves over $ \mathbb{F}_p $ and binary quadratic formsIt is well known that there is a one-to-one correspondence between supersingular $ j $-invariants up to the action of $ \text{Gal}(\mathbb{F}_{p^2}/\mathbb{F}_p) $ and type classes of maximal orders in $ B_{p, \infty} $ by Deuring's theorem. Interestingly, we establish a one-to-one correspondence between $ \mathbb{F}_p $-isomorphism classes of supersingular elliptic curves and primitive reduced binary quadratic forms with discriminant $ -p $ or $ -16p $. Due to this correspondence and the fact that $ \mathbb{F}_p $-isogenies between elliptic curves could be represented by quadratic forms, we show that actions of these isogenies on supersingular elliptic curves over $ \mathbb{F}_p $ are compatible with the composition of quadratic forms. Based on these results, we reduce the security of CSIDH cryptosystem to computing this correspondence explicitly.- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 19 (2) , 698-715
Endomorphism rings of supersingular elliptic curves over $ \mathbb{F}_p $ and binary quadratic formsIt is well known that there is a one-to-one correspondence between supersingular $ j $-invariants up to the action of $ \text{Gal}(\mathbb{F}_{p^2}/\mathbb{F}_p) $ and type classes of maximal orders in $ B_{p, \infty} $ by Deuring's theorem. Interestingly, we establish a one-to-one correspondence between $ \mathbb{F}_p $-isomorphism classes of supersingular elliptic curves and primitive reduced binary quadratic forms with discriminant $ -p $ or $ -16p $. Due to this correspondence and the fact that $ \mathbb{F}_p $-isogenies between elliptic curves could be represented by quadratic forms, we show that actions of these isogenies on supersingular elliptic curves over $ \mathbb{F}_p $ are compatible with the composition of quadratic forms. Based on these results, we reduce the security of CSIDH cryptosystem to computing this correspondence explicitly.- 17 September 2024
- Published by Elsevier in Finite Fields and Their Applications
- Vol. 100
Oriented supersingular elliptic curves and Eichler orders of prime level
- 17 September 2024
- Published by Elsevier in Finite Fields and Their Applications
- Vol. 100
Oriented supersingular elliptic curves and Eichler orders of prime level
- Open AccessThe Endomorphism Rings of Supersingular Elliptic Curves over $\mathbb{F}_p$ and the Binary Quadratic FormsIt is well known that there is a one-to-one correspondence between supersingular $j$-invariants up to the action of $\text{Gal}(\mathbb{F}_{p^2}/\mathbb{F}_p)$ and type classes of maximal orders in $B_{p,\infty}$ by Deuring's theorem. Interestingly, we establish a one-to-one correspondence between $\mathbb{F}_p$-isomorphism classes of supersingular elliptic curves and primitive reduced binary quadratic forms with discriminant $-p$ or $-16p$. Due to this correspondence and the fact that $\mathbb{F}_p$-isogenies between elliptic curves could be represented by quadratic forms, we show that operations of these isogenies on supersingular elliptic curves over $\mathbb{F}_p$ are compatible with the composition of quadratic forms. Based on these results, we could reduce the security of CSIDH cryptosystem to computing this correspondence explicitly.Open AccessThe Endomorphism Rings of Supersingular Elliptic Curves over $\mathbb{F}_p$ and the Binary Quadratic FormsIt is well known that there is a one-to-one correspondence between supersingular $j$-invariants up to the action of $\text{Gal}(\mathbb{F}_{p^2}/\mathbb{F}_p)$ and type classes of maximal orders in $B_{p,\infty}$ by Deuring's theorem. Interestingly, we establish a one-to-one correspondence between $\mathbb{F}_p$-isomorphism classes of supersingular elliptic curves and primitive reduced binary quadratic forms with discriminant $-p$ or $-16p$. Due to this correspondence and the fact that $\mathbb{F}_p$-isogenies between elliptic curves could be represented by quadratic forms, we show that operations of these isogenies on supersingular elliptic curves over $\mathbb{F}_p$ are compatible with the composition of quadratic forms. Based on these results, we could reduce the security of CSIDH cryptosystem to computing this correspondence explicitly.
- Open Access
Neighborhood of vertices in the isogeny graph of principally polarized superspecial abelian surfaces
For two supersingular elliptic curves $E$ and $E'$ defined over $\mathbb{F}_{p^2}$, let $[E \times E']$ be the superspecial abelian surface with the principal polarization $\{0\} \times E' + E \times \{0\}$. We determine local structure of the vertices $[E \times E']$ in the $(\ell, \ell)$-isogeny graph of principally polarized superspecial abelian surfaces where either $E$ or $E'$ is defined over $\mathbb{F}_p$. We also present a simple new proof of the main theorem in \cite{LOX20}.Open AccessNeighborhood of vertices in the isogeny graph of principally polarized superspecial abelian surfaces
For two supersingular elliptic curves $E$ and $E'$ defined over $\mathbb{F}_{p^2}$, let $[E \times E']$ be the superspecial abelian surface with the principal polarization $\{0\} \times E' + E \times \{0\}$. We determine local structure of the vertices $[E \times E']$ in the $(\ell, \ell)$-isogeny graph of principally polarized superspecial abelian surfaces where either $E$ or $E'$ is defined over $\mathbb{F}_p$. We also present a simple new proof of the main theorem in \cite{LOX20}. - 12 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 70 (6) , 3965-3980
Almost Perfect Linear Lee Codes of Packing Radius 2 Only Exist for Small Dimensions
It is conjectured by Golomb and Welch around half a century ago that there is no perfect Lee codes $C$ of packing radius $r$ in $\mathbb {Z}^{n}$ for $r\geq 2$ and $n\geq 3$ . In 2020, Leung and Zhou proved this conjecture for linear Lee codes with $r=2$ . A natural question is whether it is possible to classify the second best, i.e., almost perfect linear Lee codes of packing radius 2. Partial results was obtained recently by Xu and Zhou. In this paper, we show that if such codes exist in $\mathbb {Z}^{n}$ , then $n$ must belong to $\{1,2, 11, 29, 47, 56, 67, 79, 104, 121, 134, 191\}$ .
- 12 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 70 (6) , 3965-3980
Almost Perfect Linear Lee Codes of Packing Radius 2 Only Exist for Small Dimensions
It is conjectured by Golomb and Welch around half a century ago that there is no perfect Lee codes $C$ of packing radius $r$ in $\mathbb {Z}^{n}$ for $r\geq 2$ and $n\geq 3$ . In 2020, Leung and Zhou proved this conjecture for linear Lee codes with $r=2$ . A natural question is whether it is possible to classify the second best, i.e., almost perfect linear Lee codes of packing radius 2. Partial results was obtained recently by Xu and Zhou. In this paper, we show that if such codes exist in $\mathbb {Z}^{n}$ , then $n$ must belong to $\{1,2, 11, 29, 47, 56, 67, 79, 104, 121, 134, 191\}$ .