Haining Fan

IACR Cryptol. ePrint Arch., 2022

HASA: Hybrid architecture search with aggregation strategy for echinococcosis classification and ovary segmentation in ultrasound images.

[BibT_eX]

[DOI]

Expert Syst. Appl., 2022

2020

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

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

A Trace Based GF(2n) Inversion Algorithm.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

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

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Remote Intelligent Assisted Diagnosis System for Hepatic Echinococcosis.

[BibT_eX]

[DOI]

Proceedings of the Medical Ultrasound, and Preterm, Perinatal and Paediatric Image Analysis, 2020

2019

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

[BibT_eX]

[DOI]

Xinggu Chen

IACR Cryptol. ePrint Arch., 2019

A regulated digital currency.

[BibT_eX]

[DOI]

Sci. China Inf. Sci., 2019

2017

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

[BibT_eX]

[DOI]

Jiajun Zhang

Integr., 2017

A Key Backup Scheme Based on Bitcoin.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

2016

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

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2016

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

[BibT_eX]

[DOI]

Yongjia Wang

Xi Xiong

Int. J. Found. Comput. Sci., 2016

2015

GF(2n) Shifted Polynomial Basis Multipliers Based on Subquadratic Toeplitz Matrix-Vector Product Approach for All Irreducible Pentanomials.

[BibT_eX]

[DOI]

Jiangtao Han

IEEE Trans. Computers, 2015

Low Space Complexity CRT-based Bit-Parallel GF(2n) Polynomial Basis Multipliers for Irreducible Trinomials.

[BibT_eX]

[DOI]

Jiajun Zhang

IACR Cryptol. ePrint Arch., 2015

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

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2015

2014

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

[BibT_eX]

[DOI]

Xi Xiong

IACR Cryptol. ePrint Arch., 2014

2013

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

[BibT_eX]

[DOI]

Jiangtao Han

IACR Cryptol. ePrint Arch., 2013

Binary extension field arithmetic for hardware implementations.

[BibT_eX]

M. Anwarul Hasan

Proceedings of the Handbook of Finite Fields., 2013

2012

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

[BibT_eX]

[DOI]

Chen Su

Inf. Process. Lett., 2012

Obtaining more Karatsuba-like formulae over the binary field.

[BibT_eX]

[DOI]

IET Inf. Secur., 2012

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

[BibT_eX]

[DOI]

Xi Xiong

IACR Cryptol. ePrint Arch., 2012

2011

GF(2n) redundant representation using matrix embedding.

[BibT_eX]

[DOI]

Yongjia Wang

IACR Cryptol. ePrint Arch., 2011

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

[BibT_eX]

[DOI]

Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

2010

Overlap-free Karatsuba-Ofman polynomial multiplication algorithms.

[BibT_eX]

[DOI]

IET Inf. Secur., 2010

2009

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

[BibT_eX]

[DOI]

Masud Anwarul Hasan

IET Inf. Secur., 2009

2007

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

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2007

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

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2007

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

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2007

2006

Fast Bit Parallel-Shifted Polynomial Basis Multipliers in GF(2n).

[BibT_eX]

[DOI]

Masud Anwarul Hasan

IEEE Trans. Circuits Syst. I Regul. Pap., 2006

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

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2006

2005

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

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2005

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

[BibT_eX]

[DOI]

Duo Liu

IACR Cryptol. ePrint Arch., 2005

2004

New GF(2n) Parallel Multiplier Using Redundant Representation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2004

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

[BibT_eX]

[DOI]