 | 2012 |
|---|
| 15 |       | 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) |
| 2011 |
|---|
| 14 | | 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 |
| 13 | | Yongjia Wang,
Haining Fan:
GF(2^n) redundant representation using matrix embedding.
IACR Cryptology ePrint Archive 2011: 556 (2011) |
| 12 | | Chen Su,
Haining Fan:
Impact of Intel's New Instruction Sets on Software Implementation of GF(2)[x] Multiplication.
IACR Cryptology ePrint Archive 2011: 589 (2011) |
| 11 | | Xi Xiong,
Haining Fan:
GF(2n) Subquadratic Polynomial Basis Multipliers for Some Irreducible Trinomials.
IACR Cryptology ePrint Archive 2011: 606 (2011) |
| 2009 |
|---|
| 10 | | Haining Fan,
Ming Gu,
Jiaguang Sun,
Kwok-Yan Lam:
Obtaining More Karatsuba-Like Formulae over The Binary Field.
IACR Cryptology ePrint Archive 2009: 636 (2009) |
| 2007 |
|---|
| 9 | | Haining Fan,
Jiaguang Sun,
Ming Gu,
Kwok-Yan Lam:
Overlap-free Karatsuba-Ofman Polynomial Multiplication Algorithms.
IACR Cryptology ePrint Archive 2007: 393 (2007) |
| 8 | | 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) |
| 7 | | 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) |
| 6 | | Haining Fan,
M. Anwar Hasan:
Comments on "Five, Six, and Seven-Term Karatsuba-Like Formulae'.
IEEE Trans. Computers 56(5): 716-717 (2007) |
| 2006 |
|---|
| 5 | | Haining Fan,
M. Anwar Hasan:
Relationship between GF(2m) Montgomery and Shifted Polynomial Basis Multiplication Algorithms.
IEEE Trans. Computers 55(9): 1202-1206 (2006) |
| 2005 |
|---|
| 4 | | Haining Fan,
Duo Liu,
Yiqi Dai:
Normal Basis Multiplication Algorithms for GF(2n) (Full Version).
IACR Cryptology ePrint Archive 2005: 358 (2005) |
| 3 | | Haining Fan,
Yiqi Dai:
Fast Bit-Parallel GF(2^n) Multiplier for All Trinomials.
IEEE Trans. Computers 54(4): 485-490 (2005) |
| 2004 |
|---|
| 2 | | Haining Fan,
Yiqi Dai:
Two Software Normal Basis Multiplication Algorithms for GF(2n).
IACR Cryptology ePrint Archive 2004: 126 (2004) |
| 1 | | Haining Fan,
Yiqi Dai:
New GF(2n) Parallel Multiplier Using Redundant Representation.
IACR Cryptology ePrint Archive 2004: 137 (2004) |
Data released under the ODC-BY 1.0 license — See also our legal information page