![]() | ![]() |
M. Anwarul Hasan
List of publications from the DBLP Bibliography Server - FAQ
| 2012 | ||
|---|---|---|
| 75 | 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) | |
| 74 | 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) | |
| 2011 | ||
| 73 | Murat Cenk, Christophe Nègre, M. Anwar Hasan: Improved Three-Way Split Formulas for Binary Polynomial Multiplication. Selected Areas in Cryptography 2011: 384-398 | |
| 72 | Ayad F. Barsoum, M. Anwar Hasan: On Verifying Dynamic Multiple Data Copies over Cloud Servers. IACR Cryptology ePrint Archive 2011: 447 (2011) | |
| 71 | 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) | |
| 70 | 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) | |
| 69 | Agustin Dominguez-Oviedo, M. Anwar Hasan: Algorithm-level error detection for Montgomery ladder-based ECSM. J. Cryptographic Engineering 1(1): 57-69 (2011) | |
| 68 | Carlos Moreno, M. Anwar Hasan: SPA-resistant binary exponentiation with optimal execution time. J. Cryptographic Engineering 1(2): 87-99 (2011) | |
| 67 | 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) | |
| 66 | Agustin Dominguez-Oviedo, M. Anwar Hasan, Bijan Ansari: Fault-Based Attack on Montgomery's Ladder Algorithm. J. Cryptology 24(2): 346-374 (2011) | |
| 2010 | ||
| 65 | M. Anwar Hasan, Tor Helleseth: Arithmetic of Finite Fields, Third International Workshop, WAIFI 2010, Istanbul, Turkey, June 27-30, 2010. Proceedings Springer 2010 | |
| 64 | Nicolas Meloni, Christophe Nègre, M. Anwar Hasan: High Performance GHASH Function for Long Messages. ACNS 2010: 154-167 | |
| 63 | Ashkan Hosseinzadeh Namin, M. Anwar Hasan: Implementation of the compression function for selected SHA-3 candidates on FPGA. IPDPS Workshops 2010: 1-4 | |
| 2009 | ||
| 62 | Nicolas Meloni, M. Anwar Hasan: Elliptic Curve Scalar Multiplication Combining Yao's Algorithm and Double Bases. CHES 2009: 304-316 | |
| 61 | 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 | |
| 60 | 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) | |
| 59 | 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) | |
| 2008 | ||
| 58 | M. Anwar Hasan, Christophe Nègre: Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation. WAIFI 2008: 88-102 | |
| 57 | Bijan Ansari, M. Anwar Hasan: High-Performance Architecture of Elliptic Curve Scalar Multiplication. IEEE Trans. Computers 57(11): 1443-1453 (2008) | |
| 2007 | ||
| 56 | Siavash Bayat Sarmadi, M. Anwar Hasan: Run-Time Error Detection in Polynomial Basis Multiplication Using Linear Codes. ASAP 2007: 204-209 | |
| 55 | Siavash Bayat Sarmadi, M. Anwar Hasan: Detecting errors in a polynomial basis multiplier using multiple parity bits for both inputs. ICCD 2007: 368-375 | |
| 54 | Jaewook Chung, M. Anwar Hasan: Asymmetric Squaring Formulae. IEEE Symposium on Computer Arithmetic 2007: 113-122 | |
| 53 | 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 | |
| 52 | Nevine Maurice Ebeid, M. Anwar Hasan: On binary signed digit representations of integers. Des. Codes Cryptography 42(1): 43-65 (2007) | |
| 51 | Nevine Maurice Ebeid, M. Anwar Hasan: On tau-adic representations of integers. Des. Codes Cryptography 45(3): 271-296 (2007) | |
| 50 | Jaewook Chung, M. Anwar Hasan: Low-Weight Polynomial Form Integers for Efficient Modular Multiplication. IEEE Trans. Computers 56(1): 44-57 (2007) | |
| 49 | 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) | |
| 48 | 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) | |
| 47 | Haining Fan, M. Anwar Hasan: Comments on "Five, Six, and Seven-Term Karatsuba-Like Formulae'. IEEE Trans. Computers 56(5): 716-717 (2007) | |
| 46 | Siavash Bayat Sarmadi, M. Anwar Hasan: On Concurrent Detection of Errors in Polynomial Basis Multiplication. IEEE Trans. VLSI Syst. 15(4): 413-426 (2007) | |
| 2006 | ||
| 45 | Arash Reyhani-Masoleh, M. Anwar Hasan: Fault Detection Architectures for Field Multiplication Using Polynomial Bases. IEEE Trans. Computers 55(9): 1089-1103 (2006) | |
| 44 | Haining Fan, M. Anwar Hasan: Relationship between GF(2m) Montgomery and Shifted Polynomial Basis Multiplication Algorithms. IEEE Trans. Computers 55(9): 1202-1206 (2006) | |
| 2005 | ||
| 43 | 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 | |
| 42 | Arash Reyhani-Masoleh, M. Anwar Hasan: Low Complexity Word-Level Sequential Normal Basis Multipliers. IEEE Trans. Computers 54(2): 98-110 (2005) | |
| 41 | Amir K. Daneshbeh, M. Anwarul Hasan: A Class of Unidirectional Bit Serial Systolic Architectures for Multiplicative Inversion and Division over GF(2m). IEEE Trans. Computers 54(3): 370-380 (2005) | |
| 2004 | ||
| 40 | Helena Handschuh, M. Anwar Hasan: Selected Areas in Cryptography, 11th International Workshop, SAC 2004, Waterloo, Canada, August 9-10, 2004, Revised Selected Papers Springer 2004 | |
| 39 | Jonathan Lutz, M. Anwarul Hasan: High Performance FPGA based Elliptic Curve Cryptographic Co-Processor. ITCC (2) 2004: 486-492 | |
| 38 | Amir K. Daneshbeh, M. Anwarul Hasan: Area Efficient High Speed Elliptic Curve Cryptoprocessor for Random Curves. ITCC (2) 2004: 588- | |
| 37 | 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) | |
| 36 | Arash Reyhani-Masoleh, M. Anwar Hasan: Towards fault-tolerant cryptographic computations over finite fields. ACM Trans. Embedded Comput. Syst. 3(3): 593-613 (2004) | |
| 35 | 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) | |
| 2003 | ||
| 34 | Arash Reyhani-Masoleh, M. Anwarul Hasan: On Low Complexity Bit Parallel Polynomial Basis Multipliers. CHES 2003: 189-202 | |
| 33 | 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 | |
| 32 | Arash Reyhani-Masoleh, M. Anwarul Hasan: Low Complexity Sequential Normal Basis Multipliers over GF(2m). IEEE Symposium on Computer Arithmetic 2003: 188-195 | |
| 31 | Jaewook Chung, M. Anwar Hasan: More Generalized Mersenne Numbers: (Extended Abstract). Selected Areas in Cryptography 2003: 335-347 | |
| 30 | Nevine Maurice Ebeid, M. Anwar Hasan: On Randomizing Private Keys to Counteract DPA Attacks. Selected Areas in Cryptography 2003: 58-72 | |
| 29 | Arash Reyhani-Masoleh, M. Anwarul Hasan: Fast Normal Basis Multiplication Using General Purpose Processors. IEEE Trans. Computers 52(11): 1379-1390 (2003) | |
| 28 | Arash Reyhani-Masoleh, M. Anwarul Hasan: Efficient Multiplication Beyond Optimal Normal Bases. IEEE Trans. Computers 52(4): 428-439 (2003) | |
| 2002 | ||
| 27 | Arash Reyhani-Masoleh, M. Anwarul Hasan: Error Detection in Polynomial Basis Multipliers over Binary Extension Fields. CHES 2002: 515-528 | |
| 26 | Arash Reyhani-Masoleh, M. Anwar Hasan: Efficient digit-serial normal basis multipliers over GF(2/sup m/). ISCAS (5) 2002: 781-784 | |
| 25 | Huapeng Wu, M. Anwarul Hasan, Ian F. Blake, Shuhong Gao: Finite Field Multiplier Using Redundant Representation. IEEE Trans. Computers 51(11): 1306-1316 (2002) | |
| 24 | Arash Reyhani-Masoleh, M. Anwarul Hasan: A New Construction of Massey-Omura Parallel Multiplier over GF(2m). IEEE Trans. Computers 51(5): 511-520 (2002) | |
| 2001 | ||
| 23 | M. Anwarul Hasan: Efficient Computation of Multiplicative Inverses for Cryptographic Applications. IEEE Symposium on Computer Arithmetic 2001: 66-72 | |
| 22 | Arash Reyhani-Masoleh, M. Anwarul Hasan: Fast Normal Basis Multiplication Using General Purpose Processors. Selected Areas in Cryptography 2001: 230-244 | |
| 21 | M. Anwarul Hasan: Power Analysis Attacks and Algorithmic Approaches to Their Countermeasures for Koblitz Curve Cryptosystems. IEEE Trans. Computers 50(10): 1071-1083 (2001) | |
| 20 | Huapeng Wu, M. Anwar Hasan: Efficient exponentiation using weakly dual basis. IEEE Trans. VLSI Syst. 9(6): 874-879 (2001) | |
| 19 | 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) | |
| 2000 | ||
| 18 | M. Anwarul Hasan: Power Analysis Attacks and Algorithmic Approaches to their Countermeasures for Koblitz Curve Cryptosystems. CHES 2000: 93-108 | |
| 17 | Arash Reyhani-Masoleh, M. Anwarul Hasan: On Efficient Normal Basis Multiplication. INDOCRYPT 2000: 213-224 | |
| 16 | M. Anwarul Hasan, Amr G. Wassal: VLSI Algorithms, Architectures, and Implementation of a Versatile GF(2m) Processor. IEEE Trans. Computers 49(10): 1064-1073 (2000) | |
| 15 | M. Anwarul Hasan: Look-Up Table-Based Large Finite Field Multiplication in Memory Constrained Cryptosystems. IEEE Trans. Computers 49(7): 749-758 (2000) | |
| 1999 | ||
| 14 | Huapeng Wu, M. Anwarul Hasan, Ian F. Blake: Highly Regular Architectures for Finite Field Computation Using Redundant Basis. CHES 1999: 269-279 | |
| 13 | Amr G. Wassal, M. Anwarul Hasan: A VLSI Architecture for ATM Algorithm-Agile Encryption. Great Lakes Symposium on VLSI 1999: 325- | |
| 12 | M. Anwarul Hasan: Look-Up Table Based Large Finite Field Multiplication in Memory Constrained Cryptosystems. IMA Int. Conf. 1999: 213-221 | |
| 11 | Huapeng Wu, M. Anwarul Hasan: Closed-Form Expression for the Average Weight of Signed-Digit Representations. IEEE Trans. Computers 48(8): 848-851 (1999) | |
| 1998 | ||
| 10 | 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 | |
| 9 | 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) | |
| 8 | Huapeng Wu, M. Anwarul Hasan: Low Complexity Bit-Parallel Multipliers for a Class of Finite Fields. IEEE Trans. Computers 47(8): 883-887 (1998) | |
| 7 | M. Anwarul Hasan: Double-Basis Multiplicative Inversion Over GF(2m). IEEE Trans. Computers 47(9): 960-970 (1998) | |
| 1997 | ||
| 6 | Huapeng Wu, M. Anwarul Hasan: Efficient Exponentiation of a Primitive Root in GF(2^m). IEEE Trans. Computers 46(2): 162-172 (1997) | |
| 5 | M. Anwarul Hasan: Division-and-Accumulation over GF(2'''). IEEE Trans. Computers 46(6): 705-708 (1997) | |
| 1995 | ||
| 4 | M. Anwarul Hasan, Vijay K. Bhargava: Architecture for a Low Complexity Rate-Adaptive Reed-Solomon Encoder. IEEE Trans. Computers 44(7): 938-942 (1995) | |
| 1993 | ||
| 3 | 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) | |
| 1992 | ||
| 2 | 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) | |
| 1 | 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) | |
| 1 | Bijan Ansari | [57] [66] |
| 2 | Ayad F. Barsoum | [72] |
| 3 | Vijay K. Bhargava | [1] [2] [3] [4] |
| 4 | Ian F. Blake | [9] [14] [25] |
| 5 | Murat Cenk | [73] |
| 6 | Jaewook Chung | [31] [50] [53] [54] |
| 7 | Amir K. Daneshbeh | [33] [38] [41] |
| 8 | Agustin Dominguez-Oviedo | [59] [66] [69] |
| 9 | Nevine Maurice Ebeid | [30] [51] [52] |
| 10 | Mohamed I. Elmasry | [10] |
| 11 | Haining Fan | [44] [47] [48] [49] |
| 12 | Shuhong Gao | [25] |
| 13 | Helena Handschuh | [40] |
| 14 | Tor Helleseth | [65] |
| 15 | Jonathan Lutz | [39] |
| 16 | Nicolas Meloni | [62] [64] [67] [75] |
| 17 | Carlos Moreno | [68] |
| 18 | Ashkan Hosseinzadeh Namin | [63] [74] [75] |
| 19 | Christophe Nègre | [58] [61] [64] [67] [70] [73] [74] [75] |
| 20 | Arash Reyhani-Masoleh | [17] [22] [24] [26] [27] [28] [29] [32] [34] [35] [36] [37] [42] [45] |
| 21 | Siavash Bayat Sarmadi | [43] [46] [55] [56] [60] |
| 22 | Piotr K. Tysowski | [71] |
| 23 | Muzhong Wang | [2] [3] |
| 24 | Amr G. Wassal | [10] [13] [16] [19] |
| 25 | Huapeng Wu | [6] [8] [9] [11] [14] [20] [25] |
Colors in the list of coauthors
Last update Thu May 31 18:55:10 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page