Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChangan Zhao
Person information
- affiliation: Sun Yat-sen University, School of Mathematics / Guangdong Key Laboratory of Information Security, Guangzhou, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j32]Yu Dai, Kaizhan Lin, Chang-An Zhao
, Zijian Zhou:
Fast subgroup membership testings for $\mathbb {G}_1$, $\mathbb {G}_2$ and $\mathbb {G}_T$ on pairing-friendly curves. Des. Codes Cryptogr. 91(10): 3141-3166 (2023)- [j31]Yu Dai, Fangguo Zhang, Chang-An Zhao:
Fast hashing to G2 on pairing-friendly curves with the lack of twists. Finite Fields Their Appl. 91: 102263 (2023) - [j30]Chao Chen, Fangguo Zhang, Changan Zhao:
Isogeny computation on Kummer lines and applications. J. Inf. Secur. Appl. 76: 103546 (2023) - [j29]Kaizhan Lin, Jianming Lin, Weize Wang, Chang-An Zhao:
Faster Public-Key Compression of SIDH With Less Memory. IEEE Trans. Computers 72(9): 2668-2676 (2023) - [j28]Yu Dai, Fangguo Zhang, Chang-An Zhao:
Don't Forget Pairing-Friendly Curves with Odd Prime Embedding Degrees. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2023(4): 393-419 (2023) - [i34]Kaizhan Lin, Jianming Lin, Shiping Cai, Weize Wang, Chang-An Zhao:
Public-key Compression in M-SIDH. IACR Cryptol. ePrint Arch. 2023: 136 (2023) - [i33]Kaizhan Lin, Weize Wang, Zheng Xu, Chang-An Zhao:
A Faster Software Implementation of SQISign. IACR Cryptol. ePrint Arch. 2023: 753 (2023) - [i32]Yu Dai, Fangguo Zhang, Chang-An Zhao:
Don't Forget Pairing-Friendly Curves with Odd Prime Embedding Degrees. IACR Cryptol. ePrint Arch. 2023: 1542 (2023) - 2022
- [j27]Yu Dai, Zijian Zhou, Fangguo Zhang, Chang-An Zhao:
Software Implementation of Optimal Pairings on Elliptic Curves with Odd Prime Embedding Degrees. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(5): 858-870 (2022) - [j26]Shiping Cai, Zhi Hu, Changan Zhao:
Faster Final Exponentiation on the KSS18 Curve. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(8): 1162-1164 (2022) - [j25]Kaizhan Lin, Fangguo Zhang, Chang-An Zhao:
Faster Key Generation of Supersingular Isogeny Diffie-Hellman. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(12): 1551-1558 (2022) - [i31]Yu Dai, Kaizhan Lin, Zijian Zhou, Chang-An Zhao:
Fast Subgroup Membership Testings for $\G_1$, $\G_2$ and $\G_T$ on Pairing-friendly Curves. IACR Cryptol. ePrint Arch. 2022: 348 (2022) - [i30]Yu Dai, Fangguo Zhang, Chang-An Zhao:
Fast Hashing to G2 in Direct Anonymous Attestation. IACR Cryptol. ePrint Arch. 2022: 996 (2022) - 2021
- [j24]Zhi Hu, Dongdai Lin, Chang-An Zhao:
Fast scalar multiplication of degenerate divisors for hyperelliptic curve cryptosystems. Appl. Math. Comput. 404: 126239 (2021) - [j23]Jingwei Zhang, Chuangqiang Hu, Xiang Fan, Chang-An Zhao:
Trace representation of the binary pq2-periodic sequences derived from Euler quotients. Cryptogr. Commun. 13(2): 343-359 (2021) - [j22]Ruikai Chen, Sihem Mesnager, Chang-An Zhao:
Good polynomials for optimal LRC of low locality. Des. Codes Cryptogr. 89(7): 1639-1660 (2021) - [j21]Ruikai Chen, Sihem Mesnager, Chang-An Zhao:
Correction to: Good polynomials for optimal LRC of low locality. Des. Codes Cryptogr. 89(8): 2031 (2021) - [i29]Fan Peng, Hao Chen, Chang-An Zhao:
Algebraic Geometric Secret Sharing Schemes over Large Fields Are Asymptotically Threshold. CoRR abs/2101.01304 (2021) - [i28]Shiping Cai, Zhi Hu, Zheng-an Yao, Chang-An Zhao:
The Elliptic Net Algorithm Revisited. CoRR abs/2109.07050 (2021) - [i27]Kaizhan Lin, Weize Wang, Lin Wang, Chang-An Zhao:
An Alternative Approach for Computing Discrete Logarithms in Compressed SIDH. CoRR abs/2111.10226 (2021) - [i26]Kaizhan Lin, Jianming Lin, Weize Wang, Chang-An Zhao:
Faster Public-key Compression of SIDH with Less Memory. IACR Cryptol. ePrint Arch. 2021: 992 (2021) - [i25]Yu Dai, Zijian Zhou, Fangguo Zhang, Chang-An Zhao:
Software Implementation of Optimal Pairings on Elliptic Curves with Odd Prime Embedding Degrees. IACR Cryptol. ePrint Arch. 2021: 1162 (2021) - [i24]Shiping Cai, Zhi Hu, Chang-An Zhao:
Faster Final Exponentiation on the KSS18 Curve. IACR Cryptol. ePrint Arch. 2021: 1309 (2021) - [i23]Kaizhan Lin, Fangguo Zhang, Chang-An Zhao:
Faster Key Generation of Supersingular Isogeny Diffie-Hellman. IACR Cryptol. ePrint Arch. 2021: 1320 (2021) - [i22]Kaizhan Lin, Weize Wang, Lin Wang, Chang-An Zhao:
An Alternative Approach for Computing Discrete Logarithms in Compressed SIDH. IACR Cryptol. ePrint Arch. 2021: 1528 (2021) - 2020
- [j20]Jingwei Zhang, Shuhong Gao, Chang-An Zhao:
Linear Complexity of a Family of Binary pq2-Periodic Sequences From Euler Quotients. IEEE Trans. Inf. Theory 66(9): 5774-5780 (2020) - [i21]Fan Peng, Hao Chen, Chang-An Zhao:
Algebraic Geometric Secret Sharing Schemes over Large Fields Are Asymptotically Threshold. IACR Cryptol. ePrint Arch. 2020: 1616 (2020)
2010 – 2019
- 2019
- [j19]SrinivasaRao SubramanyaRao, Zhi Hu, Chang-An Zhao:
Division polynomial-based elliptic curve scalar multiplication revisited. IET Inf. Secur. 13(6): 614-617 (2019) - [i20]Jingwei Zhang, Shuhong Gao, Changan Zhao:
Linear Complexity of A Family of Binary pq2-periodic Sequences From Euler Quotients. CoRR abs/1906.08083 (2019) - [i19]Jingwei Zhang, Shuhong Gao, Chang-An Zhao:
Linear Complexity of A Family of Binary pq2 -periodic Sequences From Euler Quotients. IACR Cryptol. ePrint Arch. 2019: 729 (2019) - 2018
- [c4]Jingwei Zhang, Changan Zhao:
Linear Complexity and Trace Presentation of Sequences with Period 2P2. ISIT 2018: 2206-2210 - 2017
- [j18]Shudi Yang, Zheng-an Yao, Chang-An Zhao:
A class of three-weight linear codes and their complete weight enumerators. Cryptogr. Commun. 9(1): 133-149 (2017) - [j17]Shudi Yang, Zheng-an Yao, Chang-An Zhao:
The weight distributions of two classes of p-ary cyclic codes with few weights. Finite Fields Their Appl. 44: 76-91 (2017) - [j16]Binglong Chen, Chuangqiang Hu, Chang-An Zhao:
Note on scalar multiplication using division polynomials. IET Inf. Secur. 11(4): 195-198 (2017) - 2016
- [j15]Binglong Chen, Chang-An Zhao:
An Improvement of the Elliptic Net Algorithm. IEEE Trans. Computers 65(9): 2903-2909 (2016) - [j14]Chuangqiang Hu, Chang-An Zhao:
Multi-Point Codes From Generalized Hermitian Curves. IEEE Trans. Inf. Theory 62(5): 2726-2736 (2016) - [i18]Shudi Yang, Zheng-an Yao, Chang-An Zhao:
A Class of Three-Weight Linear Codes and Their Complete Weight Enumerators. CoRR abs/1601.02320 (2016) - 2015
- [j13]Shudi Yang, Zheng-an Yao, Chang-An Zhao:
The weight enumerator of the duals of a class of cyclic codes with three zeros. Appl. Algebra Eng. Commun. Comput. 26(4): 347-367 (2015) - [j12]Jingwei Zhang, Changan Zhao:
The linear complexity of a class of binary sequences with period $$2p$$ 2 p. Appl. Algebra Eng. Commun. Comput. 26(5): 475-491 (2015) - [i17]Shudi Yang, Zheng-an Yao, Chang-An Zhao:
The weight distributions of two classes of p ary cyclic codes with few weights. CoRR abs/1504.03048 (2015) - [i16]Chuangqiang Hu, Chang-An Zhao:
Multi-point Codes from Generalized Hermitian Curves. CoRR abs/1504.04171 (2015) - [i15]Shudi Yang, Zheng-an Yao, Chang-An Zhao:
Complete Weight Enumerator of a Family of Linear Codes from Cyclotomy. CoRR abs/1507.05732 (2015) - [i14]Binglong Chen, Chang-An Zhao:
An Improvment of the Elliptic Net Algorithm. IACR Cryptol. ePrint Arch. 2015: 276 (2015) - [i13]Binglong Chen, Chuangqiang Hu, Chang-An Zhao:
A Note on Scalar Multiplication Using Division Polynomials. IACR Cryptol. ePrint Arch. 2015: 284 (2015) - 2014
- [j11]Binglong Chen, Chang-An Zhao:
Self-pairings on supersingular elliptic curves with embedding degree three. Finite Fields Their Appl. 28: 79-93 (2014) - [j10]Steven D. Galbraith, Chang-An Zhao:
Erratum Self-pairings on hyperelliptic curves [J. Math. Cryptol. 7(2013), 31-42]. J. Math. Cryptol. 8(1): 93 (2014) - 2013
- [j9]Steven D. Galbraith, Chang-An Zhao:
Self-pairings on hyperelliptic curves. J. Math. Cryptol. 7(1): 31-42 (2013) - [i12]Binglong Chen, Chang-An Zhao:
Self-pairings on supersingular elliptic curves with embedding degree three. IACR Cryptol. ePrint Arch. 2013: 562 (2013) - 2012
- [j8]Changan Zhao, Fangguo Zhang, Dongqing Xie:
Faster Computation of Self-Pairings. IEEE Trans. Inf. Theory 58(5): 3266-3272 (2012) - [c3]Reza Rezaeian Farashahi, Hongfeng Wu, Changan Zhao:
Efficient Arithmetic on Elliptic Curves over Fields of Characteristic Three. Selected Areas in Cryptography 2012: 135-148 - [i11]Reza Rezaeian Farashahi, Hongfeng Wu, Changan Zhao:
Efficient Arithmetic on Hessian Curves over Fields of Characteristic Three. IACR Cryptol. ePrint Arch. 2012: 122 (2012) - [i10]Steven D. Galbraith, Chang-An Zhao:
Self-pairings on Hyperelliptic Curves. IACR Cryptol. ePrint Arch. 2012: 267 (2012) - 2011
- [j7]Changan Zhao, Dongqing Xie, Fangguo Zhang, Jingwei Zhang, Binglong Chen:
Computing bilinear pairings on elliptic curves with automorphisms. Des. Codes Cryptogr. 58(1): 35-44 (2011) - [i9]Hongfeng Wu, Changan Zhao:
Faster Scalar Multiplication on Ordinary Weierstrass Elliptic Curves over Fields of Characteristic Three. IACR Cryptol. ePrint Arch. 2011: 468 (2011) - 2010
- [j6]Jingwei Zhang, Changan Zhao, Xiao Ma:
Linear complexity of generalized cyclotomic binary sequences of length 2pm. Appl. Algebra Eng. Commun. Comput. 21(2): 93-108 (2010) - [j5]Jingwei Zhang, Changan Zhao, Xiao Ma:
On the Linear Complexity of Generalized Cyclotomic Binary Sequences with Length 2p2. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(1): 302-308 (2010) - [i8]Changan Zhao, Fangguo Zhang, Dongqing Xie:
Faster Computation of Self-pairings. IACR Cryptol. ePrint Arch. 2010: 399 (2010)
2000 – 2009
- 2009
- [c2]Changan Zhao, Dongqing Xie, Fangguo Zhang, Chong-zhi Gao, Jingwei Zhang:
Improved Implementations of Cryptosystems Based on Tate Pairing. ISA 2009: 145-151 - 2008
- [j4]Changan Zhao, Fangguo Zhang, Jiwu Huang:
Efficient Tate pairing computation using double-base chains. Sci. China Ser. F Inf. Sci. 51(8): 1096-1105 (2008) - [j3]Xibin Lin, Changan Zhao, Fangguo Zhang, Yanming Wang:
Computing the Ate Pairing on Elliptic Curves with Embedding Degree k = 9. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(9): 2387-2393 (2008) - [j2]Changan Zhao, Fangguo Zhang, Jiwu Huang:
All Pairings Are in a Group. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(10): 3084-3087 (2008) - [j1]Changan Zhao, Fangguo Zhang, Jiwu Huang:
A note on the Ate pairing. Int. J. Inf. Sec. 7(6): 379-382 (2008) - [i7]Changan Zhao, Fangguo Zhang, Jiwu Huang:
All Pairings Are in a Group. IACR Cryptol. ePrint Arch. 2008: 85 (2008) - [i6]Changan Zhao, Dongqing Xie, Fangguo Zhang, Jingwei Zhang, Binglong Chen:
Computing Bilinear Pairings on Elliptic Curves with Automorphisms. IACR Cryptol. ePrint Arch. 2008: 209 (2008) - [i5]Changan Zhao, Fangguo Zhang, Dongqing Xie:
Reducing the Complexity of the Weil Pairing Computation. IACR Cryptol. ePrint Arch. 2008: 212 (2008) - 2007
- [i4]Changan Zhao, Fangguo Zhang, Jiwu Huang:
A Note on the Ate Pairing. IACR Cryptol. ePrint Arch. 2007: 247 (2007) - [i3]Xibin Lin, Changan Zhao, Fangguo Zhang, Yanming Wang:
Computing the Ate Pairing on Elliptic Curves with Embedding Degree k=9. IACR Cryptol. ePrint Arch. 2007: 434 (2007) - 2006
- [i2]Changan Zhao, Fangguo Zhang, Jiwu Huang:
Efficient Tate Pairing Computation Using Double-Base Chains. IACR Cryptol. ePrint Arch. 2006: 201 (2006) - [i1]Changan Zhao, Fangguo Zhang, Jiwu Huang:
Speeding up the Bilinear Pairings Computation on Curves with Automorphisms. IACR Cryptol. ePrint Arch. 2006: 474 (2006) - 2004
- [c1]Xiaowei Shao, Changsheng Shao, Changan Zhao:
An Ant Colony Genetic Algorithm. ECAI 2004: 1113-1114
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-03 22:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
