Haining Fan

发表

Reducing Shared Cache Contention by Scheduling Order Adjustment on Commodity Multi-cores

Yan Cui, Yingxin Wang, Yu Chen, 2011, 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum.

A Key Backup Scheme Based on Bitcoin

Xiaoyun Wang, Haining Fan, Zhongxiang Zheng, 2017, IACR Cryptol. ePrint Arch..

Subquadratic Computational Complexity Schemes for Extended Binary Field Multiplication Using Optimal Normal Bases

M. Anwar Hasan, Haining Fan, 2007, IEEE Transactions on Computers.

A New Approach to Subquadratic Space Complexity Parallel Multipliers for Extended Binary Fields

M. Anwar Hasan, Haining Fan, M. A. Hasan, 2007, IEEE Transactions on Computers.

Fast Bit-Parallel GF(2^n) Multiplier for All Trinomials

Yiqi Dai, Haining Fan, 2005, IEEE Trans. Computers.

GF(2n) Bit-Parallel Squarer Using Generalized Polynomial Basis For a New Class of Irreducible Pentanomials

Xi Xiong, Haining Fan, 2014, IACR Cryptol. ePrint Arch..

A Trace Based GF(2n) Inversion Algorithm

Haining Fan, 2020, IACR Cryptol. ePrint Arch..

Blind Detection and Parameter Estimation Algorithm Based on Atomic Decomposition and Information Theoretic Criterion

Ying Guo, Haining Fan, Qingwei Meng, 2009, 2009 International Conference on Networks Security, Wireless Communications and Trusted Computing.

GF(2n) Subquadratic Polynomial Basis Multipliers for Some Irreducible Trinomials

Xi Xiong, Haining Fan, 2011, IACR Cryptol. ePrint Arch..

Relationship between GF(2^m) Montgomery and Shifted Polynomial Basis Multiplication Algorithms

M. Anwar Hasan, Haining Fan, M. A. Hasan, 2006, IEEE Transactions on Computers.

Blind Parameter Estimation of Frequency-Hopping Signals Based on Atomic Decomposition

Ying Guo, Haining Fan, Qingwei Meng, 2009, 2009 First International Workshop on Education Technology and Computer Science.

New Subquadratic Algorithms for Constructing Lightweight Hadamard MDS Matrices (Full Version)

Haining Fan, Ximing Fu, Xuting Zhou, 2020, IACR Cryptol. ePrint Arch..

A regulated digital currency

Xiaoyun Wang, Haining Fan, Guangnan Zou, 2018, Science China Information Sciences.

A survey of some recent bit-parallel GF(2n) multipliers

M. Anwar Hasan, Haining Fan, M. A. Hasan, 2015, Finite Fields Their Appl..

SCloud: Public Key Encryption and Key Encapsulation Mechanism Based on Learning with Errors

Chao Liu, Haining Fan, Zhongxiang Zheng, 2020, IACR Cryptol. ePrint Arch..

Obtaining more Karatsuba-like formulae over the binary field

Ming Gu, Jia-Guang Sun, Kwok-Yan Lam, 2012, IET Inf. Secur..

A Novel Algorithm of Blind Detection of Frequency Hopping Signal Based on Second-Order Cyclostationarity

Ying Guo, Haining Fan, Yaohua Xu, 2008, 2008 Congress on Image and Signal Processing.

GF(2n) Redundant Representation Using Matrix Embedding for Irreducible Trinomials

Xi Xiong, Yongjia Wang, Haining Fan, 2016, Int. J. Found. Comput. Sci..

New GF(2n) Parallel Multiplier Using Redundant Representation

Yiqi Dai, Haining Fan, 2004, IACR Cryptol. ePrint Arch..

Normal Basis Multiplication Algorithms for GF(2n) (Full Version)

Duo Liu, Yiqi Dai, Haining Fan, 2005, IACR Cryptol. ePrint Arch..

Comments on "Five, Six, and Seven-Term Karatsuba-Like Formulae'

M. Anwar Hasan, Haining Fan, M. A. Hasan, 2007, IEEE Trans. Computers.

Two Software Normal Basis Multiplication Algorithms for GF(2n)

Yiqi Dai, Haining Fan, 2004, IACR Cryptol. ePrint Arch..

Fast Bit Parallel-Shifted Polynomial Basis Multipliers in $GF(2^{n})$

Haining Fan, Masud Anwarul Hasan, 2006, IEEE Transactions on Circuits and Systems I: Regular Papers.

Bit-Parallel GF(2n) Squarer Using Shifted Polynomial Basis

Xi Xiong, Haining Fan, 2012, IACR Cryptol. ePrint Arch..

GF(2n) redundant representation using matrix embedding

Yongjia Wang, Haining Fan, Yongjia Wang, 2011, IACR Cryptol. ePrint Arch..

Low space complexity CRT-based bit-parallel GF(2n) polynomial basis multipliers for irreducible trinomials

Jiajun Zhang, Haining Fan, 2017, Integr..

A Chinese Remainder Theorem Approach to Bit-Parallel $GF(2^{n})$ Polynomial Basis Multipliers for Irreducible Trinomials

Haining Fan, 2016, IEEE Transactions on Computers.

Impact of Intel's new instruction sets on software implementation of GF(2)[x] multiplication

Chen Su, Haining Fan, 2012, Inf. Process. Lett..

$\schmi{GF(2^n)}$ Shifted Polynomial Basis Multipliers Based on Subquadratic Toeplitz Matrix-Vector Product Approach for All Irreducible Pentanomials

Haining Fan, Jiangtao Han, 2015, IEEE Transactions on Computers.

Overlap-free Karatsuba-Ofman polynomial multiplication algorithms

Ming Gu, Jia-Guang Sun, Kwok-Yan Lam, 2010 .

Low Complexity MDS Matrices Using GF(2n) SPB or GPB

Haining Fan, Xinggu Chen, 2019, IACR Cryptol. ePrint Arch..

Toeplitz matrix-vector product based GF(2n) shifted polynomial basis multipliers for all irreducible pentanomials

Haining Fan, Jiangtao Han, 2013, IACR Cryptol. ePrint Arch..

Alternative to the karatsuba algorithm for software implementations of GF(2n) multiplications

Haining Fan, Masud Anwarul Hasan, M. Hasan, 2009, IET Inf. Secur..

Multiple positive solutions for the fractional Schr\"{o}dinger-Poisson systems involving critical nonlinearities with potential

Zhaosheng Feng, Haining Fan, Xingjie Yan, 2021, 2103.01437.

Positive solutions for a critical elliptic problem involving singular nonlinearity

Haining Fan, Tiantian Zheng, Chunyu Lei, 2021 .

Overlap-free Karatsuba-Ofman Polynomial Multiplication Algorithms for Hardware Implementations

Ming Gu, Kwok-Yan Lam, Haining Fan, 2008 .

Two Normal Basis Multiplication Algorithms for GF(2n)

Yiqi Dai, Haining Fan, Duo Liu, 2006 .

Overlap-free Karatsuba-Ofman Polynomial Multiplication Algorithm

Ming Gu, Kwok-Yan Lam, Haining Fan, 2007 .

Normal basis multiplication algorithm for GF(2n)

Haining Fan, Y. Dai, 2004 .

Multiple positive solutions for semi-linear elliptic systems with sign-changing weight

Haining Fan, H. Fan, 2014 .

Key function of normal basis multipliers in GR(2/sup n/)

Yiqi Dai, Haining Fan, 2002 .