Concepedia

Haining Fan

HF

Statistics

Publications

21

Citations

682

H-Index

14

Active since

2002

Affiliations

Tsinghua University(Current)

University of Waterloo

China University of Mining and Technology

Wuhan University

Haining Fan is an author at Tsinghua University specializing in engineering, computer engineering, and parallel computing.

Top concepts

EngineeringComputer EngineeringParallel ComputingComputer ScienceComputational ComplexityParallel Complexity TheoryParallel ProgrammingSignal ProcessingCircuit ComplexityAlgebraic Complexity

Publications per year

2002–2020

21

Publications

21

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

Haining Fan, M.A. Hasan · IEEE Transactions on Computers · 2007 · 124 citations

New Scheme, Parallel Processing, Array Computing +14

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

Haining Fan, Yiqi Dai · IEEE Transactions on Computers · 2005 · 78 citations

Circuit Complexity, Engineering, Parallel Implementation +17

Overlap-free Karatsuba–Ofman polynomial multiplication algorithms

Haining Fan, Jiaguang Sun, Musong Gu et al. · IET Information Security · 2010 · 74 citations

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

Haining Fan, M.A. Hasan · IEEE Transactions on Computers · 2007 · 53 citations

Circuit Complexity, Normal Bases, Finite Fields +12

Fast Bit Parallel-Shifted Polynomial Basis Multipliers in &lt;formula formulatype="inline"&gt;&lt;tex&gt;$GF(2^{n})$&lt;/tex&gt;&lt;/formula&gt;

Haining Fan, M.A. Hasan · IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications · 2006 · 51 citations

Hardware Security, Formula Formulatype=, Cryptographic Primitive +15

1–5 of 21