Changan Zhao

According to our database, Changan Zhao authored at least 59 papers between 2004 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

A Faster Software Implementation of SQIsign.

Kaizhan Lin, Weize Wang, Zheng Xu, Chang-An Zhao

IEEE Trans. Inf. Theory, September, 2024

Compressed M-SIDH: an instance of compressed SIDH-like schemes with isogenies of highly composite degrees.

Kaizhan Lin, Jianming Lin, Shiping Cai, Weize Wang, Chang-An Zhao

Des. Codes Cryptogr., June, 2024

The elliptic net algorithm revisited.

Shiping Cai, Zhi Hu, Zheng-an Yao, Chang-An Zhao

J. Cryptogr. Eng., April, 2024

Pairing Optimizations for Isogeny-Based Cryptosystems.

Shiping Cai, Kaizhan Lin, Chang-An Zhao

IET Inf. Secur., 2024

Efficient Implementation of Super-optimal Pairings on Curves with Small Prime Fields at the 192-bit Security Level.

Jianming Lin, Chang-An Zhao, Yuhao Zheng

IACR Cryptol. ePrint Arch., 2024

Π-signHD: A New Structure for the SQIsign Family with Flexible Applicability.

Kaizhan Lin, Weize Wang, Chang-An Zhao, Yunlei Zhao

IACR Cryptol. ePrint Arch., 2024

Efficient Implementations of Square-root Vélu's Formulas.

Jianming Lin, Weize Wang, Chang-An Zhao, Yuhao Zheng

IACR Cryptol. ePrint Arch., 2024

A Note on (2, 2)-isogenies via Theta Coordinates.

Jianming Lin, Saiyu Wang, Chang-An Zhao

IACR Cryptol. ePrint Arch., 2024

A note on (2,2)-isogenies via theta coordinates.

Jianming Lin, Saiyu Wang, Chang-An Zhao

Finite Fields Their Appl., 2024

2023

Fast hashing to G2 on pairing-friendly curves with the lack of twists.

Yu Dai, Fangguo Zhang, Chang-An Zhao

Finite Fields Their Appl., October, 2023

Fast subgroup membership testings for $\mathbb {G}_1$, $\mathbb {G}_2$ and $\mathbb {G}_T$ on pairing-friendly curves.

Yu Dai, Kaizhan Lin, Chang-An Zhao, Zijian Zhou

Des. Codes Cryptogr., October, 2023

Faster Public-Key Compression of SIDH With Less Memory.

Kaizhan Lin, Jianming Lin, Weize Wang, Chang-An Zhao

IEEE Trans. Computers, September, 2023

Isogeny computation on Kummer lines and applications.

Chao Chen, Fangguo Zhang, Changan Zhao

J. Inf. Secur. Appl., August, 2023

Don't Forget Pairing-Friendly Curves with Odd Prime Embedding Degrees.

Yu Dai, Fangguo Zhang, Chang-An Zhao

IACR Trans. Cryptogr. Hardw. Embed. Syst., 2023

Public-key Compression in M-SIDH.

Kaizhan Lin, Jianming Lin, Shiping Cai, Weize Wang, Chang-An Zhao

IACR Cryptol. ePrint Arch., 2023

2022

Faster Key Generation of Supersingular Isogeny Diffie-Hellman.

Kaizhan Lin, Fangguo Zhang, Chang-An Zhao

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., December, 2022

Faster Final Exponentiation on the KSS18 Curve.

Shiping Cai, Zhi Hu, Changan Zhao

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., August, 2022

Software Implementation of Optimal Pairings on Elliptic Curves with Odd Prime Embedding Degrees.

Yu Dai, Zijian Zhou, Fangguo Zhang, Chang-An Zhao

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2022

Fast Hashing to G₂ in Direct Anonymous Attestation.

Yu Dai, Fangguo Zhang, Chang-An Zhao

IACR Cryptol. ePrint Arch., 2022

Fast Subgroup Membership Testings for $\G_1$, $\G_2$ and $\G_T$ on Pairing-friendly Curves.

Yu Dai, Kaizhan Lin, Zijian Zhou, Chang-An Zhao

IACR Cryptol. ePrint Arch., 2022

2021

An Alternative Approach for Computing Discrete Logarithms in Compressed SIDH.

Kaizhan Lin, Weize Wang, Lin Wang, Chang-An Zhao

IACR Cryptol. ePrint Arch., 2021

Correction to: Good polynomials for optimal LRC of low locality.

Ruikai Chen, Sihem Mesnager, Chang-An Zhao

Des. Codes Cryptogr., 2021

Good polynomials for optimal LRC of low locality.

Ruikai Chen, Sihem Mesnager, Chang-An Zhao

Des. Codes Cryptogr., 2021

Trace representation of the binary pq²-periodic sequences derived from Euler quotients.

Jingwei Zhang, Chuangqiang Hu, Xiang Fan, Chang-An Zhao

Cryptogr. Commun., 2021

Fast scalar multiplication of degenerate divisors for hyperelliptic curve cryptosystems.

Zhi Hu, Dongdai Lin, Chang-An Zhao

Appl. Math. Comput., 2021

2020

Linear Complexity of a Family of Binary pq²-Periodic Sequences From Euler Quotients.

Jingwei Zhang, Shuhong Gao, Chang-An Zhao

IEEE Trans. Inf. Theory, 2020

Algebraic Geometric Secret Sharing Schemes over Large Fields Are Asymptotically Threshold.

Fan Peng, Hao Chen, Chang-An Zhao

IACR Cryptol. ePrint Arch., 2020

2019

Division polynomial-based elliptic curve scalar multiplication revisited.

SrinivasaRao SubramanyaRao, Zhi Hu, Chang-An Zhao

IET Inf. Secur., 2019

Linear Complexity of A Family of Binary pq2 -periodic Sequences From Euler Quotients.

Jingwei Zhang, Shuhong Gao, Chang-An Zhao

IACR Cryptol. ePrint Arch., 2019

2018

Linear Complexity and Trace Presentation of Sequences with Period 2P2.

Jingwei Zhang, Changan Zhao

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017

Note on scalar multiplication using division polynomials.

Binglong Chen, Chuangqiang Hu, Chang-An Zhao

IET Inf. Secur., 2017

The weight distributions of two classes of p-ary cyclic codes with few weights.

Shudi Yang, Zheng-an Yao, Chang-An Zhao

Finite Fields Their Appl., 2017

A class of three-weight linear codes and their complete weight enumerators.

Shudi Yang, Zheng-an Yao, Chang-An Zhao

Cryptogr. Commun., 2017

2016

Multi-Point Codes From Generalized Hermitian Curves.

Chuangqiang Hu, Chang-An Zhao

IEEE Trans. Inf. Theory, 2016

An Improvement of the Elliptic Net Algorithm.

Binglong Chen, Chang-An Zhao

IEEE Trans. Computers, 2016

2015

An Improvment of the Elliptic Net Algorithm.

Binglong Chen, Chang-An Zhao

IACR Cryptol. ePrint Arch., 2015

Complete Weight Enumerator of a Family of Linear Codes from Cyclotomy.

Shudi Yang, Zheng-an Yao, Chang-An Zhao

CoRR, 2015

The linear complexity of a class of binary sequences with period $$2p$$ 2 p.

Jingwei Zhang, Changan Zhao

Appl. Algebra Eng. Commun. Comput., 2015

The weight enumerator of the duals of a class of cyclic codes with three zeros.

Shudi Yang, Zheng-an Yao, Chang-An Zhao

Appl. Algebra Eng. Commun. Comput., 2015

2014

Erratum Self-pairings on hyperelliptic curves [J. Math. Cryptol. 7(2013), 31-42].

Steven D. Galbraith, Chang-An Zhao

J. Math. Cryptol., 2014

Self-pairings on supersingular elliptic curves with embedding degree three.

Binglong Chen, Chang-An Zhao

Finite Fields Their Appl., 2014

2013

Self-pairings on hyperelliptic curves.

Steven D. Galbraith, Chang-An Zhao

J. Math. Cryptol., 2013

Self-pairings on supersingular elliptic curves with embedding degree <i>three</i>.

Binglong Chen, Chang-An Zhao

IACR Cryptol. ePrint Arch., 2013

2012

Faster Computation of Self-Pairings.

Changan Zhao, Fangguo Zhang, Dongqing Xie

IEEE Trans. Inf. Theory, 2012

Efficient Arithmetic on Hessian Curves over Fields of Characteristic Three.

Reza Rezaeian Farashahi, Hongfeng Wu, Changan Zhao

IACR Cryptol. ePrint Arch., 2012

Efficient Arithmetic on Elliptic Curves over Fields of Characteristic Three.

Reza Rezaeian Farashahi, Hongfeng Wu, Changan Zhao

Proceedings of the Selected Areas in Cryptography, 19th International Conference, 2012

2011

Faster Scalar Multiplication on Ordinary Weierstrass Elliptic Curves over Fields of Characteristic Three.

Hongfeng Wu, Changan Zhao

IACR Cryptol. ePrint Arch., 2011

Computing bilinear pairings on elliptic curves with automorphisms.

Changan Zhao, Dongqing Xie, Fangguo Zhang, Jingwei Zhang, Binglong Chen

Des. Codes Cryptogr., 2011

2010

On the Linear Complexity of Generalized Cyclotomic Binary Sequences with Length 2<i>p</i>².

Jingwei Zhang, Changan Zhao, Xiao Ma

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010

Linear complexity of generalized cyclotomic binary sequences of length 2<i>p</i>^<i>m</i>.

Jingwei Zhang, Changan Zhao, Xiao Ma

Appl. Algebra Eng. Commun. Comput., 2010

2009

Improved Implementations of Cryptosystems Based on Tate Pairing.

Changan Zhao, Dongqing Xie, Fangguo Zhang, Chong-zhi Gao, Jingwei Zhang

Proceedings of the Advances in Information Security and Assurance, 2009

2008

All Pairings Are in a Group.

Changan Zhao, Fangguo Zhang, Jiwu Huang

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008

Computing the Ate Pairing on Elliptic Curves with Embedding Degree <i>k</i> = 9.

Xibin Lin, Changan Zhao, Fangguo Zhang, Yanming Wang

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008

Reducing the Complexity of the Weil Pairing Computation.

Changan Zhao, Fangguo Zhang, Dongqing Xie

IACR Cryptol. ePrint Arch., 2008

Efficient Tate pairing computation using double-base chains.

Changan Zhao, Fangguo Zhang, Jiwu Huang

Sci. China Ser. F Inf. Sci., 2008

2007

A Note on the Ate Pairing.

Changan Zhao, Fangguo Zhang, Jiwu Huang

IACR Cryptol. ePrint Arch., 2007

Computing the Ate Pairing on Elliptic Curves with Embedding Degree k=9.

Xibin Lin, Changan Zhao, Fangguo Zhang, Yanming Wang

IACR Cryptol. ePrint Arch., 2007

2006

Speeding up the Bilinear Pairings Computation on Curves with Automorphisms.

Changan Zhao, Fangguo Zhang, Jiwu Huang

IACR Cryptol. ePrint Arch., 2006

2004

An Ant Colony Genetic Algorithm.

Xiaowei Shao, Changsheng Shao, Changan Zhao

Proceedings of the 16th Eureopean Conference on Artificial Intelligence, 2004