| Provable multicopy dynamic data possession in cloud computing systems AF Barsoum, MA Hasan IEEE Transactions on Information Forensics and Security 10 (3), 485-497, 2014 | 383* | 2014 |
| Low complexity bit parallel architectures for polynomial basis multiplication over GF (2m) A Reyhani-Masoleh, MA Hasan IEEE Transactions on Computers 53 (8), 945-959, 2004 | 344 | 2004 |
| A full RNS variant of FV like somewhat homomorphic encryption schemes JC Bajard, J Eynard, MA Hasan, V Zucca International Conference on Selected Areas in Cryptography, 423-442, 2016 | 306 | 2016 |
| A new construction of Massey-Omura parallel multiplier over GF (2/sup m/) A Reyhani-Masoleh, MA Hasan IEEE Transactions on Computers 51 (5), 511-520, 2002 | 219 | 2002 |
| A modified Massey-Omura parallel multiplier for a class of finite fields MA Hasan, MZ Wang, VK Bhargava IEEE Transactions on Computers 42 (10), 1278-1280, 1993 | 218 | 1993 |
| Hybrid attribute-and re-encryption-based key management for secure and scalable mobile applications in clouds PK Tysowski, MA Hasan IEEE Transactions on Cloud Computing 1 (2), 172-186, 2013 | 216 | 2013 |
| High-performance architecture of elliptic curve scalar multiplication B Ansari, MA Hasan IEEE Transactions on Computers 57 (11), 1443-1453, 2008 | 211 | 2008 |
| A new approach to subquadratic space complexity parallel multipliers for extended binary fields H Fan, MA Hasan IEEE Transactions on Computers 56 (2), 224-233, 2007 | 190 | 2007 |
| Finite field multiplier using redundant representation H Wu, MA Hasan, IF Blake, S Gao IEEE Transactions on Computers 51 (11), 1306-1316, 2002 | 177* | 2002 |
| Modular construction of low complexity parallel multipliers for a class of finite fields GF (2m) MA Hasan, M Wang, VK Bhargava Computers, IEEE Transactions on 41 (8), 962-971, 1992 | 177 | 1992 |
| Enabling dynamic data and indirect mutual trust for cloud computing storage systems A Barsoum, A Hasan IEEE transactions on parallel and distributed systems 24 (12), 2375-2385, 2012 | 150 | 2012 |
| Power analysis attacks and algorithmic approaches to their countermeasures for Koblitz curve cryptosystems MA Hasan IEEE Transactions on Computers 50 (10), 1071-1083, 2001 | 147* | 2001 |
| New low-complexity bit-parallel finite field multipliers using weakly dual bases H Wu, MA Hasan, IF Blake IEEE Transactions on Computers 47 (11), 1223-1234, 1998 | 138 | 1998 |
| Low complexity bit-parallel multipliers for a class of finite fields H Wu, MA Hasan IEEE Transactions on Computers 47 (8), 883-887, 1998 | 120 | 1998 |
| Architecture for a low complexity rate-adaptive Reed-Solomon encoder MA Hasan, VK Bhargava IEEE Transactions on Computers 44 (7), 938-942, 1995 | 119 | 1995 |
| High performance FPGA based elliptic curve cryptographic co-processor J Lutz, A Hasan International Conference on Information Technology: Coding and Computing …, 2004 | 116 | 2004 |
| Bit-serial systolic divider and multiplier for finite fields GF (2/sup m/) MA Hasan, VK Bhargava IEEE Transactions on Computers 41 (08), 972-980, 1992 | 113 | 1992 |
| Low complexity word-level sequential normal basis multipliers A Reyhani-Masoleh, MA Hasan IEEE Transactions on Computers 54 (2), 98-110, 2005 | 110 | 2005 |
| Provable possession and replication of data over cloud servers AF Barsoum, MA Hasan Centre For Applied Cryptographic Research (CACR), University of Waterloo …, 2010 | 104 | 2010 |
| Efficient digit-serial normal basis multipliers over binary extension fields A Reyhani-Masoleh, MA Hasan ACM Transactions on Embedded Computing Systems (TECS) 3 (3), 575-592, 2004 | 101* | 2004 |
Arash Reyhani-MasolehProfessor of Electrical and Computer Engineering, University of Western Ontarioכתובת אימייל מאומתת בדומיין uwo.ca
