![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Haining Fan
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j17]Jikuan Qian, Rui Li, Xin Yang, Yuhao Huang, Mingyuan Luo, Zehui Lin, Wenhui Hong, Ruobing Huang, Haining Fan, Dong Ni
, Jun Cheng
:
HASA: Hybrid architecture search with aggregation strategy for echinococcosis classification and ovary segmentation in ultrasound images. Expert Syst. Appl. 202: 117242 (2022) - [i19]Jikuan Qian, Rui Li, Xin Yang, Yuhao Huang, Mingyuan Luo, Zehui Lin, Wenhui Hong, Ruobing Huang, Haining Fan, Dong Ni, Jun Cheng:
HASA: Hybrid Architecture Search with Aggregation Strategy for Echinococcosis Classification and Ovary Segmentation in Ultrasound Images. CoRR abs/2204.06697 (2022) - [i18]Haining Fan:
Low-Delay 4, 5 and 6-Term Karatsuba Formulae in 픽2[x] Using Overlap-free Splitting. IACR Cryptol. ePrint Arch. 2022: 921 (2022) - 2020
- [c2]Haixia Wang, Rui Li, Xuan Chen, Bin Duan, Linfewi Xiong, Xin Yang, Haining Fan, Dong Ni:
Remote Intelligent Assisted Diagnosis System for Hepatic Echinococcosis. ASMUS/PIPPI@MICCAI 2020: 3-12 - [i17]Tianshuo Cong, Ximing Fu, Xuting Zhou, Yuli Zou, Haining Fan:
New Subquadratic Algorithms for Constructing Lightweight Hadamard MDS Matrices (Full Version). IACR Cryptol. ePrint Arch. 2020: 47 (2020) - [i16]Zhongxiang Zheng, Anyu Wang, Haining Fan, Chunhuan Zhao, Chao Liu, Xue Zhang:
SCloud: Public Key Encryption and Key Encapsulation Mechanism Based on Learning with Errors. IACR Cryptol. ePrint Arch. 2020: 95 (2020) - [i15]Haining Fan:
A Trace Based GF(2n) Inversion Algorithm. IACR Cryptol. ePrint Arch. 2020: 482 (2020)
2010 – 2019
- 2019
- [j16]Yanbing Wu, Haining Fan, Xiaoyun Wang, Guangnan Zou:
A regulated digital currency. Sci. China Inf. Sci. 62(3): 32109:1-32109:12 (2019) - [i14]Xinggu Chen, Haining Fan:
Low Complexity MDS Matrices Using GF(2n) SPB or GPB. IACR Cryptol. ePrint Arch. 2019: 1090 (2019) - 2017
- [j15]Jiajun Zhang, Haining Fan:
Low space complexity CRT-based bit-parallel GF(2n) polynomial basis multipliers for irreducible trinomials. Integr. 58: 55-63 (2017) - [i13]Zhongxiang Zheng, Chunhuan Zhao, Haining Fan, Xiaoyun Wang:
A Key Backup Scheme Based on Bitcoin. IACR Cryptol. ePrint Arch. 2017: 704 (2017) - 2016
- [j14]Yongjia Wang, Xi Xiong, Haining Fan:
GF(2n) Redundant Representation Using Matrix Embedding for Irreducible Trinomials. Int. J. Found. Comput. Sci. 27(4): 463-478 (2016) - [j13]Haining Fan:
A Chinese Remainder Theorem Approach to Bit-Parallel GF(2n) Polynomial Basis Multipliers for Irreducible Trinomials. IEEE Trans. Computers 65(2): 343-352 (2016) - 2015
- [j12]Haining Fan, M. Anwar Hasan:
A survey of some recent bit-parallel GF(2n) multipliers. Finite Fields Their Appl. 32: 5-43 (2015) - [j11]Jiangtao Han, Haining Fan:
GF(2n) Shifted Polynomial Basis Multipliers Based on Subquadratic Toeplitz Matrix-Vector Product Approach for All Irreducible Pentanomials. IEEE Trans. Computers 64(3): 862-867 (2015) - [i12]Jiajun Zhang, Haining Fan:
Low Space Complexity CRT-based Bit-Parallel GF(2n) Polynomial Basis Multipliers for Irreducible Trinomials. IACR Cryptol. ePrint Arch. 2015: 498 (2015) - 2014
- [i11]Xi Xiong, Haining Fan:
GF(2n) Bit-Parallel Squarer Using Generalized Polynomial Basis For a New Class of Irreducible Pentanomials. IACR Cryptol. ePrint Arch. 2014: 3 (2014) - [i10]Haining Fan:
A Chinese Remainder Theorem Approach to Bit-Parallel GF(2n) Polynomial Basis Multipliers for Irreducible Trinomials. IACR Cryptol. ePrint Arch. 2014: 972 (2014) - 2013
- [p1]M. Anwarul Hasan, Haining Fan:
Binary extension field arithmetic for hardware implementations. Handbook of Finite Fields 2013: 811-824 - [i9]Jiangtao Han, Haining Fan:
Toeplitz matrix-vector product based GF(2n) shifted polynomial basis multipliers for all irreducible pentanomials. IACR Cryptol. ePrint Arch. 2013: 427 (2013) - 2012
- [j10]Haining Fan, Ming Gu, Jiaguang Sun, Kwok-Yan Lam:
Obtaining more Karatsuba-like formulae over the binary field. IET Inf. Secur. 6(1): 14-19 (2012) - [j9]Chen Su, Haining Fan:
Impact of Intel's new instruction sets on software implementation of GF(2)[x] multiplication. Inf. Process. Lett. 112(12): 497-502 (2012) - [i8]Xi Xiong, Haining Fan:
Bit-Parallel GF(2n) Squarer Using Shifted Polynomial Basis. IACR Cryptol. ePrint Arch. 2012: 626 (2012) - 2011
- [c1]Yingxin Wang, Yan Cui, Pin Tao, Haining Fan, Yu Chen, Yuanchun Shi:
Reducing Shared Cache Contention by Scheduling Order Adjustment on Commodity Multi-cores. IPDPS Workshops 2011: 984-992 - [i7]Yongjia Wang, Haining Fan:
GF(2n) redundant representation using matrix embedding. IACR Cryptol. ePrint Arch. 2011: 556 (2011) - [i6]Chen Su, Haining Fan:
Impact of Intel's New Instruction Sets on Software Implementation of GF(2)[x] Multiplication. IACR Cryptol. ePrint Arch. 2011: 589 (2011) - 2010
- [j8]Haining Fan, Jia-Guang Sun, Ming Gu, Kwok-Yan Lam:
Overlap-free Karatsuba-Ofman polynomial multiplication algorithms. IET Inf. Secur. 4(1): 8-14 (2010)
2000 – 2009
- 2009
- [j7]Haining Fan, Masud Anwarul Hasan:
Alternative to the karatsuba algorithm for software implementations of GF(2n) multiplications. IET Inf. Secur. 3(2): 60-65 (2009) - [i5]Haining Fan, Ming Gu, Jiaguang Sun, Kwok-Yan Lam:
Obtaining More Karatsuba-Like Formulae over The Binary Field. IACR Cryptol. ePrint Arch. 2009: 636 (2009) - 2007
- [j6]Haining Fan, M. Anwar Hasan:
A New Approach to Subquadratic Space Complexity Parallel Multipliers for Extended Binary Fields. IEEE Trans. Computers 56(2): 224-233 (2007) - [j5]Haining Fan, M. Anwar Hasan:
Comments on "Five, Six, and Seven-Term Karatsuba-Like Formulae'. IEEE Trans. Computers 56(5): 716-717 (2007) - [j4]Haining Fan, M. Anwar Hasan:
Subquadratic Computational Complexity Schemes for Extended Binary Field Multiplication Using Optimal Normal Bases. IEEE Trans. Computers 56(10): 1435-1437 (2007) - [i4]Haining Fan, Jiaguang Sun, Ming Gu, Kwok-Yan Lam:
Overlap-free Karatsuba-Ofman Polynomial Multiplication Algorithms. IACR Cryptol. ePrint Arch. 2007: 393 (2007) - 2006
- [j3]Haining Fan, M. Anwar Hasan:
Relationship between GF(2m) Montgomery and Shifted Polynomial Basis Multiplication Algorithms. IEEE Trans. Computers 55(9): 1202-1206 (2006) - [j2]Haining Fan, Masud Anwarul Hasan:
Fast Bit Parallel-Shifted Polynomial Basis Multipliers in GF(2n). IEEE Trans. Circuits Syst. I Regul. Pap. 53-I(12): 2606-2615 (2006) - 2005
- [j1]Haining Fan, Yiqi Dai:
Fast Bit-Parallel GF(2^n) Multiplier for All Trinomials. IEEE Trans. Computers 54(4): 485-490 (2005) - [i3]Haining Fan, Duo Liu, Yiqi Dai:
Normal Basis Multiplication Algorithms for GF(2n) (Full Version). IACR Cryptol. ePrint Arch. 2005: 358 (2005) - 2004
- [i2]Haining Fan, Yiqi Dai:
Two Software Normal Basis Multiplication Algorithms for GF(2n). IACR Cryptol. ePrint Arch. 2004: 126 (2004) - [i1]Haining Fan, Yiqi Dai:
New GF(2n) Parallel Multiplier Using Redundant Representation. IACR Cryptol. ePrint Arch. 2004: 137 (2004)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-24 23:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint