Bit-Serial Systolic Divider and Multiplier for Finite Fields GF(2^m). - M. Anwarul Hasan; Vijay K. Bhargava (IEEE Trans. Computers, 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 (IEEE Trans. Computers, 1992)

A Modified Massey-Omura Parallel Multiplier for a Class of Finite Fields. - M. Anwarul Hasan; Muzhong Wang; Vijay K. Bhargava (IEEE Trans. Computers, 1993)

A narrowband interference canceller with an adjustable center weight. - M. Anwar Hasan; J. C. Lee; Vijay K. Bhargava (IEEE Trans. Commun., 1994)

Architecture for a Low Complexity Rate-Adaptive Reed-Solomon Encoder. - M. Anwarul Hasan; Vijay K. Bhargava (IEEE Trans. Computers, 1995)

Division-and-Accumulation over GF(2'''). - M. Anwarul Hasan (IEEE Trans. Computers, 1997)

Efficient Exponentiation of a Primitive Root in GF(2^m). - Huapeng Wu; M. Anwarul Hasan (IEEE Trans. Computers, 1997)

Low-Power Design of Finite Field Multipliers for Wireless Applications. - Amr G. Wassal; M. Anwarul Hasan; Mohamed I. Elmasry (Great Lakes Symposium on VLSI, 1998)

Double-Basis Multiplicative Inversion Over GF(2m). - M. Anwarul Hasan (IEEE Trans. Computers, 1998)

Low Complexity Bit-Parallel Multipliers for a Class of Finite Fields. - Huapeng Wu; M. Anwarul Hasan (IEEE Trans. Computers, 1998)

New Low-Complexity Bit-Parallel Finite Field Multipliers Using Weakly Dual Bases. - Huapeng Wu; M. Anwarul Hasan; Ian F. Blake (IEEE Trans. Computers, 1998)

Highly Regular Architectures for Finite Field Computation Using Redundant Basis. - Huapeng Wu; M. Anwarul Hasan; Ian F. Blake (CHES, 1999)

A VLSI Architecture for ATM Algorithm-Agile Encryption. - Amr G. Wassal; M. Anwarul Hasan (Great Lakes Symposium on VLSI, 1999)

Closed-Form Expression for the Average Weight of Signed-Digit Representations. - Huapeng Wu; M. Anwarul Hasan (IEEE Trans. Computers, 1999)

On Efficient Normal Basis Multiplication. - Arash Reyhani-Masoleh; M. Anwarul Hasan (INDOCRYPT, 2000)

Look-Up Table-Based Large Finite Field Multiplication in Memory Constrained Cryptosystems. - M. Anwarul Hasan (IEEE Trans. Computers, 2000)

VLSI Algorithms, Architectures, and Implementation of a Versatile GF(2m) Processor. - M. Anwarul Hasan; Amr G. Wassal (IEEE Trans. Computers, 2000)

Efficient Computation of Multiplicative Inverses for Cryptographic Applications. - M. Anwarul Hasan (IEEE Symposium on Computer Arithmetic, 2001)

Power Analysis Attacks and Algorithmic Approaches to Their Countermeasures for Koblitz Curve Cryptosystems. - M. Anwarul Hasan (IEEE Trans. Computers, 2001)

Low-power system-level design of VLSI packet switching fabrics. - Amr G. Wassal; M. Anwar Hasan (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2001)

Efficient exponentiation using weakly dual basis. - Huapeng Wu; M. Anwar Hasan (IEEE Trans. Very Large Scale Integr. Syst., 2001)

Error Detection in Polynomial Basis Multipliers over Binary Extension Fields. - Arash Reyhani-Masoleh; M. Anwarul Hasan (CHES, 2002)

Efficient digit-serial normal basis multipliers over GF(2m). - Arash Reyhani-Masoleh; M. Anwar Hasan (ISCAS (5), 2002)

A New Construction of Massey-Omura Parallel Multiplier over GF(2m). - Arash Reyhani-Masoleh; M. Anwarul Hasan (IEEE Trans. Computers, 2002)

Finite Field Multiplier Using Redundant Representation. - Huapeng Wu; M. Anwarul Hasan; Ian F. Blake; Shuhong Gao (IEEE Trans. Computers, 2002)

A Unidirectional Bit Serial Systolic Architecture for Double-Basis Division over GF(2m). - Amir K. Daneshbeh; M. Anwarul Hasan (IEEE Symposium on Computer Arithmetic, 2003)

Low Complexity Sequential Normal Basis Multipliers over GF(2m). - Arash Reyhani-Masoleh; M. Anwarul Hasan (IEEE Symposium on Computer Arithmetic, 2003)

On Low Complexity Bit Parallel Polynomial Basis Multipliers. - Arash Reyhani-Masoleh; M. Anwarul Hasan (CHES, 2003)

More Generalized Mersenne Numbers: (Extended Abstract). - Jaewook Chung; M. Anwar Hasan (Selected Areas in Cryptography, 2003)

On Randomizing Private Keys to Counteract DPA Attacks. - Nevine Maurice Ebeid; M. Anwar Hasan (Selected Areas in Cryptography, 2003)

Efficient Multiplication Beyond Optimal Normal Bases. - Arash Reyhani-Masoleh; M. Anwarul Hasan (IEEE Trans. Computers, 2003)

Fast Normal Basis Multiplication Using General Purpose Processors. - Arash Reyhani-Masoleh; M. Anwarul Hasan (IEEE Trans. Computers, 2003)

Area Efficient High Speed Elliptic Curve Cryptoprocessor for Random Curves. - Amir K. Daneshbeh; M. Anwarul Hasan (ITCC (2), 2004)

High Performance FPGA based Elliptic Curve Cryptographic Co-Processor. - Jonathan Lutz; M. Anwarul Hasan (ITCC (2), 2004)

Low Complexity Bit Parallel Architectures for Polynomial Basis Multiplication over GF(2^{m}). - Arash Reyhani-Masoleh; M. Anwar Hasan (IEEE Trans. Computers, 2004)

Efficient digit-serial normal basis multipliers over binary extension fields. - Arash Reyhani-Masoleh; M. Anwar Hasan (ACM Trans. Embed. Comput. Syst., 2004)

Towards fault-tolerant cryptographic computations over finite fields. - Arash Reyhani-Masoleh; M. Anwar Hasan (ACM Trans. Embed. Comput. Syst., 2004)

Concurrent Error Detection of Polynomial Basis Multiplication over Extension Fields using a Multiple-bit Parity Scheme. - Siavash Bayat Sarmadi; M. Anwar Hasan (DFT, 2005)

A Class of Unidirectional Bit Serial Systolic Architectures for Multiplicative Inversion and Division over GF(2m). - Amir K. Daneshbeh; M. Anwarul Hasan (IEEE Trans. Computers, 2005)

Low Complexity Word-Level Sequential Normal Basis Multipliers. - Arash Reyhani-Masoleh; M. Anwar Hasan (IEEE Trans. Computers, 2005)

Relationship between GF(2m) Montgomery and Shifted Polynomial Basis Multiplication Algorithms. - Haining Fan; M. Anwar Hasan (IEEE Trans. Computers, 2006)

Fault Detection Architectures for Field Multiplication Using Polynomial Bases. - Arash Reyhani-Masoleh; M. Anwar Hasan (IEEE Trans. Computers, 2006)

Fast Bit Parallel-Shifted Polynomial Basis Multipliers in GF(2n). - Haining Fan; Masud Anwarul Hasan (IEEE Trans. Circuits Syst. I Regul. Pap., 2006)

Asymmetric Squaring Formulae. - Jaewook Chung; M. Anwar Hasan (IEEE Symposium on Computer Arithmetic, 2007)

Montgomery Reduction Algorithm for Modular Multiplication Using Low-Weight Polynomial Form Integers. - Jaewook Chung; M. Anwar Hasan (IEEE Symposium on Computer Arithmetic, 2007)

Run-Time Error Detection in Polynomial Basis Multiplication Using Linear Codes. - Siavash Bayat Sarmadi; M. Anwar Hasan (ASAP, 2007)

Detecting errors in a polynomial basis multiplier using multiple parity bits for both inputs. - Siavash Bayat Sarmadi; M. Anwar Hasan (ICCD, 2007)

On binary signed digit representations of integers. - Nevine Maurice Ebeid; M. Anwar Hasan (Des. Codes Cryptogr., 2007)

On tau-adic representations of integers. - Nevine Maurice Ebeid; M. Anwar Hasan (Des. Codes Cryptogr., 2007)

Low-Weight Polynomial Form Integers for Efficient Modular Multiplication. - Jaewook Chung; M. Anwar Hasan (IEEE Trans. Computers, 2007)

A New Approach to Subquadratic Space Complexity Parallel Multipliers for Extended Binary Fields. - Haining Fan; M. Anwar Hasan (IEEE Trans. Computers, 2007)

Comments on "Five, Six, and Seven-Term Karatsuba-Like Formulae'. - Haining Fan; M. Anwar Hasan (IEEE Trans. Computers, 2007)

Subquadratic Computational Complexity Schemes for Extended Binary Field Multiplication Using Optimal Normal Bases. - Haining Fan; M. Anwar Hasan (IEEE Trans. Computers, 2007)

On Concurrent Detection of Errors in Polynomial Basis Multiplication. - Siavash Bayat Sarmadi; M. Anwar Hasan (IEEE Trans. Very Large Scale Integr. Syst., 2007)

Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation. - M. Anwar Hasan; Christophe Nègre (WAIFI, 2008)

High-Performance Architecture of Elliptic Curve Scalar Multiplication. - Bijan Ansari; M. Anwar Hasan (IEEE Trans. Computers, 2008)

Subquadratic Space Complexity Multiplier for a Class of Binary Fields Using Toeplitz Matrix Approach. - M. Anwar Hasan; Christophe Nègre (IEEE Symposium on Computer Arithmetic, 2009)

Elliptic Curve Scalar Multiplication Combining Yao's Algorithm and Double Bases. - Nicolas Méloni; M. Anwar Hasan (CHES, 2009)

Alternative to the karatsuba algorithm for software implementations of GF(2n) multiplications. - Haining Fan; Masud Anwarul Hasan (IET Inf. Secur., 2009)

Concurrent Error Detection in Finite-Field Arithmetic Operations Using Pipelined and Systolic Architectures. - Siavash Bayat Sarmadi; M. Anwar Hasan (IEEE Trans. Computers, 2009)

Error Detection and Fault Tolerance in ECSM Using Input Randomization. - Agustin Dominguez-Oviedo; M. Anwar Hasan (IEEE Trans. Dependable Secur. Comput., 2009)

High Performance GHASH Function for Long Messages. - Nicolas Méloni; Christophe Nègre; M. Anwar Hasan (ACNS, 2010)

Implementation of the compression function for selected SHA-3 candidates on FPGA. - Ashkan Hosseinzadeh Namin; M. Anwar Hasan (IPDPS Workshops, 2010)

Improved Three-Way Split Formulas for Binary Polynomial Multiplication. - Murat Cenk; Christophe Nègre; M. Anwar Hasan (Selected Areas in Cryptography, 2011)

On Verifying Dynamic Multiple Data Copies over Cloud Servers. - Ayad F. Barsoum; M. Anwar Hasan (IACR Cryptol. ePrint Arch., 2011)

Re-Encryption-Based Key Management Towards Secure and Scalable Mobile Applications in Clouds. - Piotr K. Tysowski; M. Anwarul Hasan (IACR Cryptol. ePrint Arch., 2011)

Algorithm-level error detection for Montgomery ladder-based ECSM. - Agustin Dominguez-Oviedo; M. Anwar Hasan (J. Cryptogr. Eng., 2011)

High performance GHASH and impacts of a class of unconventional bases. - Nicolas Méloni; Christophe Nègre; M. Anwar Hasan (J. Cryptogr. Eng., 2011)

SPA-resistant binary exponentiation with optimal execution time. - Carlos Moreno 002; M. Anwar Hasan (J. Cryptogr. Eng., 2011)

Fault-Based Attack on Montgomery's Ladder Algorithm. - Agustin Dominguez-Oviedo; M. Anwar Hasan; Bijan Ansari (J. Cryptol., 2011)

Low Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation. - M. Anwar Hasan; Christophe Nègre (IEEE Trans. Computers, 2011)

Integrity Verification of Multiple Data Copies over Untrusted Cloud Servers. - Ayad F. Barsoum; M. Anwar Hasan (CCGRID, 2012)

Towards Faster and Greener Cryptoprocessor for Eta Pairing on Supersingular Elliptic Curve over $ mathbb{F}_{2^{1223}}$. - Jithra Adikari; M. Anwar Hasan; Christophe Nègre (Selected Areas in Cryptography, 2012)

Sequential multiplier with sub-linear gate complexity. - M. Anwar Hasan; Christophe Nègre (J. Cryptogr. Eng., 2012)

Block Recombination Approach for Subquadratic Space Complexity Binary Field Multiplication Based on Toeplitz Matrix-Vector Product. - M. Anwar Hasan; Nicolas Méloni; Ashkan Hosseinzadeh Namin; Christophe Nègre (IEEE Trans. Computers, 2012)

Toeplitz Matrix Approach for Binary Field Multiplication Using Quadrinomials. - M. Anwar Hasan; Ashkan Hosseinzadeh Namin; Christophe Nègre (IEEE Trans. Very Large Scale Integr. Syst., 2012)

Fault Attacks on Elliptic Curve Cryptosystems. - Abdulaziz Alkhoraidly; Agustin Dominguez-Oviedo; M. Anwar Hasan (Fault Analysis in Cryptography, 2012)

Binary extension field arithmetic for hardware implementations. - M. Anwarul Hasan; Haining Fan (Handbook of Finite Fields, 2013)

Cloud-hosted key sharing towards secure and scalable mobile applications in clouds. - Piotr K. Tysowski; M. Anwarul Hasan (ICNC, 2013)

Non-intrusive program tracing and debugging of deployed embedded systems through side-channel analysis. - Carlos Moreno 002; Sebastian Fischmeister; M. Anwar Hasan (LCTES, 2013)

On the Arithmetic Complexity of Strassen-Like Matrix Multiplications. - Murat Cenk; M. Anwar Hasan (IACR Cryptol. ePrint Arch., 2013)

Improved Area-Time Tradeoffs for Field Multiplication Using Optimal Normal Bases. - Jithra Adikari; Ayad F. Barsoum; M. Anwar Hasan; Ashkan Hosseinzadeh Namin; Christophe Nègre (IEEE Trans. Computers, 2013)

Improved Three-Way Split Formulas for Binary Polynomial and Toeplitz Matrix Vector Products. - Murat Cenk; Christophe Nègre; M. Anwar Hasan (IEEE Trans. Computers, 2013)

Multiway Splitting Method for Toeplitz Matrix Vector Product. - M. Anwar Hasan; Christophe Nègre (IEEE Trans. Computers, 2013)

Hybrid Attribute- and Re-Encryption-Based Key Management for Secure and Scalable Mobile Applications in Clouds. - Piotr K. Tysowski; M. Anwarul Hasan (IEEE Trans. Cloud Comput., 2013)

Enabling Dynamic Data and Indirect Mutual Trust for Cloud Computing Storage Systems. - Ayad F. Barsoum; M. Anwar Hasan (IEEE Trans. Parallel Distributed Syst., 2013)

Efficient Subquadratic Space Complexity Binary Polynomial Multipliers Based on Block Recombination. - Murat Cenk; M. Anwar Hasan; Christophe Nègre (IEEE Trans. Computers, 2014)

Exp-HE: a family of fast exponentiation algorithms resistant to SPA, fault, and combined attacks. - Carlos Moreno 002; M. Anwar Hasan; Sebastian Fischmeister (EMSOFT, 2015)

A survey of some recent bit-parallel GF(2n) multipliers. - Haining Fan; M. Anwar Hasan (Finite Fields Their Appl., 2015)

Random Digit Representation of Integers. - Nicolas Méloni; M. Anwar Hasan (IACR Cryptol. ePrint Arch., 2015)

Some new results on binary polynomial multiplication. - Murat Cenk; M. Anwar Hasan (J. Cryptogr. Eng., 2015)

Efficient Double Bases for Scalar Multiplication. - Nicolas Méloni; M. Anwar Hasan (IEEE Trans. Computers, 2015)

Provable Multicopy Dynamic Data Possession in Cloud Computing Systems. - Ayad F. Barsoum; M. Anwar Hasan (IEEE Trans. Inf. Forensics Secur., 2015)

A Full RNS Variant of FV like Somewhat Homomorphic Encryption Schemes. - Jean-Claude Bajard; Julien Eynard; M. Anwar Hasan; Vincent Zucca (IACR Cryptol. ePrint Arch., 2016)

Efficient Reductions in Cyclotomic Rings - Application to Ring-LWE Based FHE Schemes. - Jean-Claude Bajard; Julien Eynard; M. Anwar Hasan; Paulo Martins 002; Leonel Sousa; Vincent Zucca (SAC, 2017)

Efficient reductions in cyclotomic rings - Application to R-LWE based FHE schemes. - Jean-Claude Bajard; Julien Eynard; M. Anwar Hasan; Paulo Martins 002; Leonel Sousa; Vincent Zucca (IACR Cryptol. ePrint Arch., 2017)

Privacy-preserving attribute-keyword based data publish-subscribe service on cloud platforms. - Kan Yang 001; Kuan Zhang 001; Xiaohua Jia; M. Anwar Hasan; Xuemin (Sherman) Shen (Inf. Sci., 2017)

Energy Efficiency Analysis of Elliptic Curve Based Cryptosystems. - Tanushree Banerjee; M. Anwar Hasan (TrustCom/BigDataSE, 2018)

Energy Exhaustion Attack on Barrett's Reduction. - Mohannad Mostafa; Tanushree Banerjee; M. Anwar Hasan (TrustCom/BigDataSE, 2018)

New Efficient Algorithms for Multiplication Over Fields of Characteristic Three. - Murat Cenk; Farhad Haghighi Zadeh; M. Anwar Hasan (J. Signal Process. Syst., 2018)

Energy Consumption Analysis of XRP Validator. - Crystal Andrea Roma; M. Anwar Hasan (IEEE ICBC, 2020)

Security Analysis of a Cryptosystem Based on Subspace Subcodes. - Thierry P. Berger; Anta Niane Gueye; Cheikh Thiecoumba Gueye; M. Anwarul Hasan; Jean Belo Klamti; Edoardo Persichetti; Tovohery Hajatiana Randrianarisoa; Olivier Ruatta (CBCrypto, 2021)

Single-round Lattice-based Multisignatures. - Kittiphon Phalakarn; Vorapong Suppakitpaisarn; M. Anwar Hasan (CANDAR (Workshops), 2021)

Energy Efficiency Analysis of Post-Quantum Cryptographic Algorithms. - Crystal Andrea Roma; Chi-En Amy Tai; M. Anwar Hasan (IEEE Access, 2021)

Correction to: A digital rights management system based on a scalable blockchain. - Abba Garba; Ashutosh Dhar Dwivedi; Mohsin Kamal; Gautam Srivastava 001; Muhammad Tariq; M. Anwar Hasan; Zhong Chen 001 (Peer-to-Peer Netw. Appl., 2021)

A digital rights management system based on a scalable blockchain. - Abba Garba; Ashutosh Dhar Dwivedi; Mohsin Kamal; Gautam Srivastava 001; Muhammad Tariq; M. Anwar Hasan; Zhong Chen 001 (Peer-to-Peer Netw. Appl., 2021)

A New Class of Trapdoor Verifiable Delay Functions. - Ahmed Zawia; M. Anwar Hasan (FPS, 2022)

Post-Quantum Two-Party Adaptor Signature Based on Coding Theory. - Jean Belo Klamti; M. Anwar Hasan (Cryptogr., 2022)

Speeding-Up Parallel Computation of Large Smooth-Degree Isogeny using Precedence-Constrained Scheduling. - Kittiphon Phalakarn; Vorapong Suppakitpaisarn; M. Anwar Hasan (IACR Cryptol. ePrint Arch., 2022)

A code-based hybrid signcryption scheme. - Jean Belo Klamti; M. Anwarul Hasan (J. Math. Cryptol., 2023)

Vectorized and Parallel Computation of Large Smooth-Degree Isogenies using Precedence-Constrained Scheduling. - Kittiphon Phalakarn; Vorapong Suppakitpaisarn; Francisco Rodríguez-Henríquez; M. Anwar Hasan (IACR Trans. Cryptogr. Hardw. Embed. Syst., 2023)

CountChain: A Decentralized Oracle Network for Counting Systems. - Behkish Nassirzadeh; Albert Heinle; Stefanos Leonardos; M. Anwar Hasan; Vijay Ganesh 001 (Blockchain, 2024)

TrustBandit: Optimizing Client Selection for Robust Federated Learning Against Poisoning Attacks. - Biniyam Deressa; M. Anwar Hasan (INFOCOM (Workshops), 2024)

ChronoCloak: An Integrated Solution for Mitigating Premature Disclosure in Oblivious Digital Dissemination. - Ahmed Zawia; M. Anwar Hasan (ISC (1), 2024)

Streamlining CSIDH: Cost-Effective Strategies for Group Actions Evaluation. - Ahmed Zawia; M. Anwar Hasan (ISC (2), 2024)

AdChain: Decentralized Header Bidding. - Behkish Nassirzadeh; Albert Heinle; Stefanos Leonardos; M. Anwar Hasan; Vijay Ganesh 001 (MARBLE, 2024)

On efficient normal bases over binary fields. - Mohamadou Sall; M. Anwar Hasan (CoRR, 2024)

Sharing the Path: A Threshold Scheme from Isogenies and Error Correcting Codes. - Mohamadou Sall; M. Anwar Hasan (CoRR, 2024)

Covert Adaptive Adversary Model: A New Adversary Model for Multiparty Computation. - Isheeta Nargis; M. Anwar Hasan (IACR Cryptol. ePrint Arch., 2024)

Secure Multiparty Computation in the Presence of Covert Adaptive Adversaries. - Isheeta Nargis; M. Anwar Hasan (IACR Cryptol. ePrint Arch., 2024)

Area Optimized Architectures for Galois Counter Mode. - Jithra Adikari; M. Anwar Hasan; Christophe Nègre; Pujan Patel (FICC (2), 2025)

Efficient Methods for Simultaneous Homomorphic Inversion. - Jean Belo Klamti; M. Anwarul Hasan; Koray Karabina (IACR Commun. Cryptol., 2025)

Accelerating EdDSA Signature Verification with Faster Scalar Size Halving. - Muhammad ElSheikh; Irem Keskinkurt Paksoy; Murat Cenk; M. Anwar Hasan (IACR Trans. Cryptogr. Hardw. Embed. Syst., 2025)

Self-Tallying E-Voting Using Homomorphic Time-Lock Puzzles and ZK-SNARKs. - Muhammad ElSheikh; Amr M. Youssef; M. Anwar Hasan (IEEE Trans. Netw. Sci. Eng., 2025)