M. Anwar Hasan

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

Murat Cenk, M. Anwar Hasan: On the Arithmetic Complexity of Strassen-Like Matrix Multiplications. IACR Cryptology ePrint Archive 2013: 107 (2013)

M. Anwar Hasan, Christophe Nègre: Sequential multiplier with sub-linear gate complexity. J. Cryptographic Engineering 2(2): 91-97 (2012)

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

M. Anwar Hasan, Ashkan Hosseinzadeh Namin, Christophe Nègre: Toeplitz Matrix Approach for Binary Field Multiplication Using Quadrinomials. IEEE Trans. VLSI Syst. 20(3): 449-458 (2012)

Ayad F. Barsoum, M. Anwar Hasan: Integrity Verification of Multiple Data Copies over Untrusted Cloud Servers. CCGRID 2012: 829-834

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

Agustin Dominguez-Oviedo, M. Anwar Hasan: Algorithm-level error detection for Montgomery ladder-based ECSM. J. Cryptographic Engineering 1(1): 57-69 (2011)

Carlos Moreno, M. Anwar Hasan: SPA-resistant binary exponentiation with optimal execution time. J. Cryptographic Engineering 1(2): 87-99 (2011)

Nicolas Meloni, Christophe Nègre, M. Anwar Hasan: High performance GHASH and impacts of a class of unconventional bases. J. Cryptographic Engineering 1(3): 201-218 (2011)

Agustin Dominguez-Oviedo, M. Anwar Hasan, Bijan Ansari: Fault-Based Attack on Montgomery's Ladder Algorithm. J. Cryptology 24(2): 346-374 (2011)

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

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

Ayad F. Barsoum, M. Anwar Hasan: On Verifying Dynamic Multiple Data Copies over Cloud Servers. IACR Cryptology ePrint Archive 2011: 447 (2011)

Piotr K. Tysowski, M. Anwarul Hasan: Re-Encryption-Based Key Management Towards Secure and Scalable Mobile Applications in Clouds. IACR Cryptology ePrint Archive 2011: 668 (2011)

Nicolas Meloni, Christophe Nègre, M. Anwar Hasan: High Performance GHASH Function for Long Messages. ACNS 2010: 154-167

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

M. Anwar Hasan, Tor Helleseth (Eds.): Arithmetic of Finite Fields, Third International Workshop, WAIFI 2010, Istanbul, Turkey, June 27-30, 2010. Proceedings. Lecture Notes in Computer Science 6087, Springer 2010, isbn 978-3-642-13796-9

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

Agustin Dominguez-Oviedo, M. Anwar Hasan: Error Detection and Fault Tolerance in ECSM Using Input Randomization. IEEE Trans. Dependable Sec. Comput. 6(3): 175-187 (2009)

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

Nicolas Meloni, M. Anwar Hasan: Elliptic Curve Scalar Multiplication Combining Yao's Algorithm and Double Bases. CHES 2009: 304-316

Bijan Ansari, M. Anwar Hasan: High-Performance Architecture of Elliptic Curve Scalar Multiplication. IEEE Trans. Computers 57(11): 1443-1453 (2008)

M. Anwar Hasan, Christophe Nègre: Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation. WAIFI 2008: 88-102

Nevine Maurice Ebeid, M. Anwar Hasan: On binary signed digit representations of integers. Des. Codes Cryptography 42(1): 43-65 (2007)

Nevine Maurice Ebeid, M. Anwar Hasan: On tau-adic representations of integers. Des. Codes Cryptography 45(3): 271-296 (2007)

Jaewook Chung, M. Anwar Hasan: Low-Weight Polynomial Form Integers for Efficient Modular Multiplication. IEEE Trans. Computers 56(1): 44-57 (2007)

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

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

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

Siavash Bayat Sarmadi, M. Anwar Hasan: On Concurrent Detection of Errors in Polynomial Basis Multiplication. IEEE Trans. VLSI Syst. 15(4): 413-426 (2007)

Jaewook Chung, M. Anwar Hasan: Asymmetric Squaring Formulae. IEEE Symposium on Computer Arithmetic 2007: 113-122

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

Siavash Bayat Sarmadi, M. Anwar Hasan: Run-Time Error Detection in Polynomial Basis Multiplication Using Linear Codes. ASAP 2007: 204-209

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

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

Haining Fan, M. Anwar Hasan: Relationship between GF(2^m) Montgomery and Shifted Polynomial Basis Multiplication Algorithms. IEEE Trans. Computers 55(9): 1202-1206 (2006)

Arash Reyhani-Masoleh, M. Anwar Hasan: Low Complexity Word-Level Sequential Normal Basis Multipliers. IEEE Trans. Computers 54(2): 98-110 (2005)

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

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

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

Arash Reyhani-Masoleh, M. Anwar Hasan: Efficient digit-serial normal basis multipliers over binary extension fields. ACM Trans. Embedded Comput. Syst. 3(3): 575-592 (2004)

Arash Reyhani-Masoleh, M. Anwar Hasan: Towards fault-tolerant cryptographic computations over finite fields. ACM Trans. Embedded Comput. Syst. 3(3): 593-613 (2004)

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

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

Helena Handschuh, M. Anwar Hasan (Eds.): Selected Areas in Cryptography, 11th International Workshop, SAC 2004, Waterloo, Canada, August 9-10, 2004, Revised Selected Papers. Lecture Notes in Computer Science 3357, Springer 2004, isbn 3-540-24327-5

Arash Reyhani-Masoleh, M. Anwarul Hasan: Efficient Multiplication Beyond Optimal Normal Bases. IEEE Trans. Computers 52(4): 428-439 (2003)

Arash Reyhani-Masoleh, M. Anwarul Hasan: Fast Normal Basis Multiplication Using General Purpose Processors. IEEE Trans. Computers 52(11): 1379-1390 (2003)

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

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

Arash Reyhani-Masoleh, M. Anwarul Hasan: On Low Complexity Bit Parallel Polynomial Basis Multipliers. CHES 2003: 189-202

Nevine Maurice Ebeid, M. Anwar Hasan: On Randomizing Private Keys to Counteract DPA Attacks. Selected Areas in Cryptography 2003: 58-72

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

Arash Reyhani-Masoleh, M. Anwarul Hasan: A New Construction of Massey-Omura Parallel Multiplier over GF(2^m). IEEE Trans. Computers 51(5): 511-520 (2002)

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

Arash Reyhani-Masoleh, M. Anwarul Hasan: Error Detection in Polynomial Basis Multipliers over Binary Extension Fields. CHES 2002: 515-528

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

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

Amr G. Wassal, M. Anwar Hasan: Low-power system-level design of VLSI packet switching fabrics. IEEE Trans. on CAD of Integrated Circuits and Systems 20(6): 723-738 (2001)

Huapeng Wu, M. Anwar Hasan: Efficient exponentiation using weakly dual basis. IEEE Trans. VLSI Syst. 9(6): 874-879 (2001)

M. Anwarul Hasan: Efficient Computation of Multiplicative Inverses for Cryptographic Applications. IEEE Symposium on Computer Arithmetic 2001: 66-72

Arash Reyhani-Masoleh, M. Anwarul Hasan: Fast Normal Basis Multiplication Using General Purpose Processors. Selected Areas in Cryptography 2001: 230-244

M. Anwarul Hasan: Look-Up Table-Based Large Finite Field Multiplication in Memory Constrained Cryptosystems. IEEE Trans. Computers 49(7): 749-758 (2000)

M. Anwarul Hasan, Amr G. Wassal: VLSI Algorithms, Architectures, and Implementation of a Versatile GF(2^m) Processor. IEEE Trans. Computers 49(10): 1064-1073 (2000)

M. Anwarul Hasan: Power Analysis Attacks and Algorithmic Approaches to their Countermeasures for Koblitz Curve Cryptosystems. CHES 2000: 93-108

Arash Reyhani-Masoleh, M. Anwarul Hasan: On Efficient Normal Basis Multiplication. INDOCRYPT 2000: 213-224

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

Huapeng Wu, M. Anwarul Hasan, Ian F. Blake: Highly Regular Architectures for Finite Field Computation Using Redundant Basis. CHES 1999: 269-279

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

M. Anwarul Hasan: Look-Up Table Based Large Finite Field Multiplication in Memory Constrained Cryptosystems. IMA Int. Conf. 1999: 213-221

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

M. Anwarul Hasan: Double-Basis Multiplicative Inversion Over GF(2^m). IEEE Trans. Computers 47(9): 960-970 (1998)

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

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

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

M. Anwarul Hasan: Division-and-Accumulation over GF(2'''). IEEE Trans. Computers 46(6): 705-708 (1997)

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

M. Anwar Hasan, J. C. Lee, Vijay K. Bhargava: A narrowband interference canceller with an adjustable center weight. IEEE Transactions on Communications 42(234): 877-880 (1994)

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

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

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