2026 M.A. Hasan: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	32	13251	12858	511	489	82	3765

Overview

M.A. Hasan is affiliated with the University of Waterloo in Canada and has contributed extensively to the field of computer science, particularly focusing on cryptography and data security. Their research spans a variety of related topics including coding theory, blockchain technology, and digital rights management.

Their publication record includes significant work published from 2020 to 2023 in diverse venues specializing in cryptographic applications and networked systems. Some key papers authored or co-authored by Hasan include:

"A digital rights management system based on a scalable blockchain," 2020, Peer-to-Peer Networking and Applications
"Energy Efficiency Analysis of Post-Quantum Cryptographic Algorithms," 2021, IEEE Access
"Post-Quantum Two-Party Adaptor Signature Based on Coding Theory," 2022, Cryptography
"Vectorized and Parallel Computation of Large Smooth-Degree Isogenies using Precedence-Constrained Scheduling," 2023, IACR Transactions on Cryptographic Hardware and Embedded Systems
"Correction to: A digital rights management system based on a scalable blockchain," 2021, Peer-to-Peer Networking and Applications

Their research topics include:

Cryptography and Data Security
Coding theory and cryptography
Cryptography and Residue Arithmetic
Blockchain Technology Applications and Security
Advanced Steganography and Watermarking Techniques
Digital Rights Management and Security
Cryptographic Implementations and Security

Hasan has frequently collaborated with several researchers in the field, notably:

Ahmed Zawia
Abba Garba
Ashutosh Dhar Dwivedi
Mohsin Kamal
Gautam Srivastava

Throughout their career, Hasan has contributed multiple publications to prominent venues, including:

Peer-to-Peer Networking and Applications
IACR Communications in Cryptology
IEEE Access
Cryptography
IACR Transactions on Cryptographic Hardware and Embedded Systems

Hasan's research primarily falls within computer science with an emphasis on several specialized subfields such as artificial intelligence, information systems, computer vision and pattern recognition, computer networks and communications, and education.

They have produced a notable volume of work, with 35 publications classified under computer science, 17 of which relate to artificial intelligence and 8 to information systems. This breadth underscores a multi-disciplinary approach intertwined with cryptography and security challenges.

Best Publications

Low complexity bit parallel architectures for polynomial basis multiplication over GF(2m)

A. Reyhani-Masoleh;M.A. Hasan

336
Citations
A modified Massey-Omura parallel multiplier for a class of finite fields

M.A. Hasan;M.Z. Wang;V.K. Bhargava

217
Citations
A new construction of Massey-Omura parallel multiplier over GF(2/sup m/)

A. Reyhani-Masoleh;M.A. Hasan

214
Citations
High-Performance Architecture of Elliptic Curve Scalar Multiplication

B. Ansari;M.A. Hasan

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

Haining Fan;M.A. Hasan

188
Citations
Modular construction of low complexity parallel multipliers for a class of finite fields GF(2/sup m/)

M.A. Hasan;M. Wang;V.K. Bhargava

183
Citations
New low-complexity bit-parallel finite field multipliers using weakly dual bases

H. Wu;M.A. Hasan;I.F. Blake

138
Citations
Low complexity bit-parallel multipliers for a class of finite fields

Huapeng Wu;M.A. Hasan

119
Citations
Low complexity word-level sequential normal basis multipliers

A. Reyhani-Masoleh;M.A. Hasan

115
Citations
Architecture for a low complexity rate-adaptive Reed-Solomon encoder

M.A. Hasan;V.K. Bhargava

115
Citations
Bit-serial systolic divider and multiplier for finite fields GF(2/sup m/)

M.A. Hasan;V.K. Bhargava

114
Citations
Division and bit-serial multiplication over GF(qm)

M.A. Hasan;V.K. Bhargava

92
Citations
Fault Detection Architectures for Field Multiplication Using Polynomial Bases

A. Reyhani-Masoleh;M.A. Hasan

90
Citations
Look-up table-based large finite field multiplication in memory constrained cryptosystems

M.A. Hasan

85
Citations
On Concurrent Detection of Errors in Polynomial Basis Multiplication

S. Bayat-Sarmadi;M.A. Hasan

74
Citations
Efficient multiplication beyond optimal normal bases

A. Reyhani-Masoleh;M.A. Hasan

60
Citations
Asymmetric Squaring Formulae

Jaewook Chung;M.A. Hasan

60
Citations
Low-power system-level design of VLSI packet switching fabrics

A.G. Wassal;M.A. Hasan

59
Citations
Efficient computation of multiplicative inverses for cryptographic applications

M.A. Hasan

53
Citations
Fast normal basis multiplication using general purpose processors

A. Reyhani-Masoleh;M.A. Hasan

52
Citations

Frequent Co-Authors

Vijay K. Bhargava University of British Columbia

External Links

Personal website of M.A. Hasan

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Studying Computer Science in the USA opens up a world of flexible online learning options, allowing students to balance education with work or other responsibilities. Those looking to keep costs low should explore the cheapest online colleges, where you can earn a computer science degree without breaking the bank.

Concerned about your academic history? Don’t worry—many reputable institutions are among the college with low gpa admission policies, offering greater access to quality programs for a wider range of learners.

If you’re eager to fast-track your education, you can enroll in one of the online computer science degree options that offer accelerated paths to graduation, helping you launch your tech career sooner.

Beyond IT, related fields like environmental science are also popular choices. If you’re curious about career diversity, learn more about what jobs can you get with an environmental science degree and discover new pathways that might align with your interests and skills.