Guanju Xiao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Guanju Xiao has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Yingpu Deng
Key Laboratory of Mathematics Mechanization, NCMIS, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China
7 shared publications - Lixia Luo
Academy of Mathematics and Systems Science Key Laboratory of Mathematics Mechanization NCMIS Chinese Academy of Sciences 100190 Beijing People's Republic of China
5 shared publications - Longjiang Qu
National University of Defense Technology
2 shared publications - Yanbin Pan
State Key Laboratory of Mathematical Sciences, Academy of Mathematics and Systems Science, Chinese Academy of Sciences
2 shared publications - Zijian Zhou
Department of Mathematics, National University of Defense Technology, Changsha, China
2 shared publications - Jianhua Wang
University of Chinese Academy of Sciences
1 shared publication
Latest Publications
- 13 November 2025
- Published by Springer Nature
- p. 27-45
Generalizing Key Recovery Attacks Against NTRU with Multiple Keys and Its Application in NTRUReEncrypt
- 13 November 2025
- Published by Springer Nature
- p. 27-45
Generalizing Key Recovery Attacks Against NTRU with Multiple Keys and Its Application in NTRUReEncrypt
- 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.- 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.
- 12 February 2024
- Published by Pleiades Publishing Ltd in p-Adic Numbers, Ultrametric Analysis and Applications
- Vol. 16 (1) , 23-42
Public-Key Cryptosystems and Signature Schemes from $p$-Adic LatticesIn 2018, the longest vector problem and closest vector problem in local fields were introduced, as the \(p\)-adic analogues of the shortest vector problem and closest vector problem in lattices of Euclidean spaces. They are considered to be hard and useful in constructing cryptographic primitives, but no applications in cryptography were given. In this paper, we construct the first signature scheme and public-key encryption cryptosystem based on \(p\)-adic lattice by proposing a trapdoor function with the norm-orthogonal basis of \(p\)-adic lattice. These cryptographic schemes have reasonable key size and the signature scheme is efficient, while the encryption scheme works only for short messages, which shows that \(p\)-adic lattice can be a new alternative to construct cryptographic primitives and well worth studying.- 12 February 2024
- Published by Pleiades Publishing Ltd in p-Adic Numbers, Ultrametric Analysis and Applications
- Vol. 16 (1) , 23-42
Public-Key Cryptosystems and Signature Schemes from $p$-Adic LatticesIn 2018, the longest vector problem and closest vector problem in local fields were introduced, as the \(p\)-adic analogues of the shortest vector problem and closest vector problem in lattices of Euclidean spaces. They are considered to be hard and useful in constructing cryptographic primitives, but no applications in cryptography were given. In this paper, we construct the first signature scheme and public-key encryption cryptosystem based on \(p\)-adic lattice by proposing a trapdoor function with the norm-orthogonal basis of \(p\)-adic lattice. These cryptographic schemes have reasonable key size and the signature scheme is efficient, while the encryption scheme works only for short messages, which shows that \(p\)-adic lattice can be a new alternative to construct cryptographic primitives and well worth studying.- 28 June 2021
- Published by Springer Nature in Journal of Systems Science and Complexity
- Vol. 35 (3) , 1191-1200
On Some Computational Problems in Local Fields
- 28 June 2021
- Published by Springer Nature in Journal of Systems Science and Complexity
- Vol. 35 (3) , 1191-1200
On Some Computational Problems in Local Fields
- Open AccessSupersingular $j$-invariants and the Class Number of $\mathbb{Q}(\sqrt{-p})$For a prime $p>3$, let $D$ be the discriminant of an imaginary quadratic order with $|D|< \frac{4}{\sqrt{3}}\sqrt{p}$. We research the solutions of the class polynomial $H_D(X)$ mod $p$ in $\mathbb{F}_p$ if $D$ is not a quadratic residue in $\mathbb{F}_p$. We also discuss the common roots of different class polynomials in $\mathbb{F}_p$. As a result, we get a deterministic algorithm (Algorithm 3) for computing the class number of $\mathbb{Q}(\sqrt{-p})$. The time complexity of Algorithm 3 is $O(p^{3/4+\epsilon})$.Open AccessSupersingular $j$-invariants and the Class Number of $\mathbb{Q}(\sqrt{-p})$For a prime $p>3$, let $D$ be the discriminant of an imaginary quadratic order with $|D|< \frac{4}{\sqrt{3}}\sqrt{p}$. We research the solutions of the class polynomial $H_D(X)$ mod $p$ in $\mathbb{F}_p$ if $D$ is not a quadratic residue in $\mathbb{F}_p$. We also discuss the common roots of different class polynomials in $\mathbb{F}_p$. As a result, we get a deterministic algorithm (Algorithm 3) for computing the class number of $\mathbb{Q}(\sqrt{-p})$. The time complexity of Algorithm 3 is $O(p^{3/4+\epsilon})$.
- Open Access
Constructing Cycles in Isogeny Graphs of Supersingular Elliptic Curves
Loops and cycles play an important role in computing endomorphism rings of supersingular elliptic curves and related cryptosystems. For a supersingular elliptic curve $E$ defined over $\mathbb{F}_{p^2}$, if an imaginary quadratic order $O$ can be embedded in $\text{End}(E)$ and a prime $L$ splits into two principal ideals in $O$, we construct loops or cycles in the supersingular $L$-isogeny graph at the vertices which are next to $j(E)$ in the supersingular $\ell$-isogeny graph where $\ell$ is a prime different from $L$. Next, we discuss the lengths of these cycles especially for $j(E)=1728$ and $0$. Finally, we also determine an upper bound on primes $p$ for which there are unexpected $2$-cycles if $\ell$ doesn't split in $O$.Open AccessConstructing Cycles in Isogeny Graphs of Supersingular Elliptic Curves
Loops and cycles play an important role in computing endomorphism rings of supersingular elliptic curves and related cryptosystems. For a supersingular elliptic curve $E$ defined over $\mathbb{F}_{p^2}$, if an imaginary quadratic order $O$ can be embedded in $\text{End}(E)$ and a prime $L$ splits into two principal ideals in $O$, we construct loops or cycles in the supersingular $L$-isogeny graph at the vertices which are next to $j(E)$ in the supersingular $\ell$-isogeny graph where $\ell$ is a prime different from $L$. Next, we discuss the lengths of these cycles especially for $j(E)=1728$ and $0$. Finally, we also determine an upper bound on primes $p$ for which there are unexpected $2$-cycles if $\ell$ doesn't split in $O$. - Open Access
- 17 November 2020
- Published by Walter de Gruyter GmbH in Journal of Mathematical Cryptology
- Vol. 15 (1) , 454-464
Constructing Cycles in Isogeny Graphs of Supersingular Elliptic Curves
Loops and cycles play an important role in computing endomorphism rings of supersingular elliptic curves and related cryptosystems. For a supersingular elliptic curve E defined over 𝔽 p 2 , if an imaginary quadratic order O can be embedded in End( E ) and a prime L splits into two principal ideals in O , we construct loops or cycles in the supersingular L -isogeny graph at the vertices which are next to j ( E ) in the supersingular ℓ-isogeny graph where ℓ is a prime different from L . Next, we discuss the lengths of these cycles especially for j ( E ) = 1728 and 0. Finally, we also determine an upper bound on primes p for which there are unexpected 2-cycles if ℓ doesn’t split in O .
- 17 November 2020
- Published by Walter de Gruyter GmbH in Journal of Mathematical Cryptology
- Vol. 15 (1) , 454-464
Open AccessConstructing Cycles in Isogeny Graphs of Supersingular Elliptic Curves
Loops and cycles play an important role in computing endomorphism rings of supersingular elliptic curves and related cryptosystems. For a supersingular elliptic curve E defined over 𝔽 p 2 , if an imaginary quadratic order O can be embedded in End( E ) and a prime L splits into two principal ideals in O , we construct loops or cycles in the supersingular L -isogeny graph at the vertices which are next to j ( E ) in the supersingular ℓ-isogeny graph where ℓ is a prime different from L . Next, we discuss the lengths of these cycles especially for j ( E ) = 1728 and 0. Finally, we also determine an upper bound on primes p for which there are unexpected 2-cycles if ℓ doesn’t split in O .
- Open Access
On two problems about isogenies of elliptic curves over finite fields
Isogenies occur throughout the theory of elliptic curves. Recently, the cryptographic protocols based on isogenies are considered as candidates of quantum-resistant cryptographic protocols. Given two elliptic curves $E_1, E_2$ defined over a finite field $k$ with the same trace, there is a nonconstant isogeny $\beta$ from $E_2$ to $E_1$ defined over $k$. This study gives out the index of $\rm{Hom}_{\it k}(\it E_{\rm 1},E_{\rm 2})\beta$ as a left ideal in $\rm{End}_{\it k}(\it E_{\rm 2})$ and figures out the correspondence between isogenies and kernel ideals. In addition, some results about the non-trivial minimal degree of isogenies between the two elliptic curves are also provided.Open AccessOn two problems about isogenies of elliptic curves over finite fields
Isogenies occur throughout the theory of elliptic curves. Recently, the cryptographic protocols based on isogenies are considered as candidates of quantum-resistant cryptographic protocols. Given two elliptic curves $E_1, E_2$ defined over a finite field $k$ with the same trace, there is a nonconstant isogeny $\beta$ from $E_2$ to $E_1$ defined over $k$. This study gives out the index of $\rm{Hom}_{\it k}(\it E_{\rm 1},E_{\rm 2})\beta$ as a left ideal in $\rm{End}_{\it k}(\it E_{\rm 2})$ and figures out the correspondence between isogenies and kernel ideals. In addition, some results about the non-trivial minimal degree of isogenies between the two elliptic curves are also provided.