M. Anwarul Hasan - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 37 from 37

2021

Security Analysis of a Cryptosystem Based on Subspace SubcodesThierry P. Berger, Anta Niane Gueye, Cheikh Thiecoumba Gueye, M. Anwarul Hasan, Jean Belo Klamti, Edoardo Persichetti, Tovohery Hajatiana Randrianarisoa, Olivier Ruatta. cbc 2022: 42-59 [doi]

2013

Binary extension field arithmetic for hardware implementationsM. Anwarul Hasan, Haining Fan. In Gary L. Mullen, Daniel Panario, editors, Handbook of Finite Fields. Discrete mathematics and its applications, pages 811-824, CRC Press, 2013.

Hybrid Attribute- and Re-Encryption-Based Key Management for Secure and Scalable Mobile Applications in CloudsPiotr K. Tysowski, M. Anwarul Hasan. tcc, 1(2):172-186, 2013. [doi]

Cloud-hosted key sharing towards secure and scalable mobile applications in cloudsPiotr K. Tysowski, M. Anwarul Hasan. iccnc 2013: 449-455 [doi]

2011

Re-Encryption-Based Key Management Towards Secure and Scalable Mobile Applications in CloudsPiotr K. Tysowski, M. Anwarul Hasan. iacr, 2011:668, 2011. [doi]

2005

A Class of Unidirectional Bit Serial Systolic Architectures for Multiplicative Inversion and Division over GF(2:::m:::)Amir K. Daneshbeh, M. Anwarul Hasan. TC, 54(3):370-380, 2005. [doi]

2004

Area Efficient High Speed Elliptic Curve Cryptoprocessor for Random CurvesAmir K. Daneshbeh, M. Anwarul Hasan. itcc 2004: 588 [doi]

High Performance FPGA based Elliptic Curve Cryptographic Co-ProcessorJonathan Lutz, M. Anwarul Hasan. itcc 2004: 486-492 [doi]

2003

2002

Error Detection in Polynomial Basis Multipliers over Binary Extension FieldsArash Reyhani-Masoleh, M. Anwarul Hasan. ches 2003: 515-528 [doi]

A New Construction of Massey-Omura Parallel Multiplier over ::::GF::::(2:::::::m:::::::)Arash Reyhani-Masoleh, M. Anwarul Hasan. TC, 51(5):511-520, 2002. [doi]

Finite Field Multiplier Using Redundant RepresentationHuapeng Wu, M. Anwarul Hasan, Ian F. Blake, Shuhong Gao. TC, 51(11):1306-1316, 2002. [doi]

2001

Power Analysis Attacks and Algorithmic Approaches to Their Countermeasures for Koblitz Curve CryptosystemsM. Anwarul Hasan. TC, 50(10):1071-1083, 2001. [doi]

Efficient Computation of Multiplicative Inverses for Cryptographic ApplicationsM. Anwarul Hasan. arith 2001: 66-72 [doi]

Fast Normal Basis Multiplication Using General Purpose ProcessorsArash Reyhani-Masoleh, M. Anwarul Hasan. sacrypt 2001: 230-244 [doi]

2000

Power Analysis Attacks and Algorithmic Approaches to their Countermeasures for Koblitz Curve CryptosystemsM. Anwarul Hasan. ches 2000: 93-108 [doi]

Look-Up Table-Based Large Finite Field Multiplication in Memory Constrained CryptosystemsM. Anwarul Hasan. TC, 49(7):749-758, 2000. [doi]

VLSI Algorithms, Architectures, and Implementation of a Versatile GF(2:::m:::) ProcessorM. Anwarul Hasan, Amr G. Wassal. TC, 49(10):1064-1073, 2000. [doi]

On Efficient Normal Basis MultiplicationArash Reyhani-Masoleh, M. Anwarul Hasan. indocrypt 2000: 213-224 [doi]

1999

Look-Up Table Based Large Finite Field Multiplication in Memory Constrained CryptosystemsM. Anwarul Hasan. ima 1999: 213-221 [doi]

A VLSI Architecture for ATM Algorithm-Agile EncryptionAmr G. Wassal, M. Anwarul Hasan. glvlsi 1999: 325 [doi]

Closed-Form Expression for the Average Weight of Signed-Digit RepresentationsHuapeng Wu, M. Anwarul Hasan. TC, 48(8):848-851, 1999.

Highly Regular Architectures for Finite Field Computation Using Redundant BasisHuapeng Wu, M. Anwarul Hasan, Ian F. Blake. ches 1999: 269-279 [doi]

1998

Double-Basis Multiplicative Inversion Over GF(2:::m:::)M. Anwarul Hasan. TC, 47(9):960-970, 1998.

Low-Power Design of Finite Field Multipliers for Wireless ApplicationsAmr G. Wassal, M. Anwarul Hasan, Mohamed I. Elmasry. glvlsi 1998: 19-25 [doi]

Low Complexity Bit-Parallel Multipliers for a Class of Finite FieldsHuapeng Wu, M. Anwarul Hasan. TC, 47(8):883-887, 1998.

New Low-Complexity Bit-Parallel Finite Field Multipliers Using Weakly Dual BasesHuapeng Wu, M. Anwarul Hasan, Ian F. Blake. TC, 47(11):1223-1234, 1998.

1997

Division-and-Accumulation over GF(2 )M. Anwarul Hasan. TC, 46(6):705-708, 1997.

Efficient Exponentiation of a Primitive Root in GF(2^m)Huapeng Wu, M. Anwarul Hasan. TC, 46(2):162-172, 1997.

1995

Architecture for a Low Complexity Rate-Adaptive Reed-Solomon EncoderM. Anwarul Hasan, Vijay K. Bhargava. TC, 44(7):938-942, 1995.

1993

A Modified Massey-Omura Parallel Multiplier for a Class of Finite FieldsM. Anwarul Hasan, Muzhong Wang, Vijay K. Bhargava. TC, 42(10):1278-1280, 1993.

1992

Modular Construction of Low Complexity Parallel Multipliers for a Class of Finite Fields GF(2^m)M. Anwarul Hasan, Muzhong Wang, Vijay K. Bhargava. TC, 41(8):962-971, 1992.

Bit-Serial Systolic Divider and Multiplier for Finite Fields GF(2^m)M. Anwarul Hasan, Vijay K. Bhargava. TC, 41(8):972-980, 1992.

Sign in or sign up to see more results.

runs on WebDSL