The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

M. Anwarul Hasan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Amir K. Daneshbeh, M. Anwarul Hasan
    A Unidirectional Bit Serial Systolic Architecture for Double-Basis Division over GF(2m). [Citation Graph (0, 0)][DBLP]
    IEEE Symposium on Computer Arithmetic, 2003, pp:174-180 [Conf]
  2. M. Anwarul Hasan
    Efficient Computation of Multiplicative Inverses for Cryptographic Applications. [Citation Graph (0, 0)][DBLP]
    IEEE Symposium on Computer Arithmetic, 2001, pp:66-72 [Conf]
  3. Arash Reyhani-Masoleh, M. Anwarul Hasan
    Low Complexity Sequential Normal Basis Multipliers over GF(2m). [Citation Graph (0, 0)][DBLP]
    IEEE Symposium on Computer Arithmetic, 2003, pp:188-195 [Conf]
  4. M. Anwarul Hasan
    Power Analysis Attacks and Algorithmic Approaches to their Countermeasures for Koblitz Curve Cryptosystems. [Citation Graph (0, 0)][DBLP]
    CHES, 2000, pp:93-108 [Conf]
  5. Huapeng Wu, M. Anwarul Hasan, Ian F. Blake
    Highly Regular Architectures for Finite Field Computation Using Redundant Basis. [Citation Graph (0, 0)][DBLP]
    CHES, 1999, pp:269-279 [Conf]
  6. Arash Reyhani-Masoleh, M. Anwarul Hasan
    Error Detection in Polynomial Basis Multipliers over Binary Extension Fields. [Citation Graph (0, 0)][DBLP]
    CHES, 2002, pp:515-528 [Conf]
  7. Arash Reyhani-Masoleh, M. Anwarul Hasan
    On Low Complexity Bit Parallel Polynomial Basis Multipliers. [Citation Graph (0, 0)][DBLP]
    CHES, 2003, pp:189-202 [Conf]
  8. Amr G. Wassal, M. Anwarul Hasan
    A VLSI Architecture for ATM Algorithm-Agile Encryption. [Citation Graph (0, 0)][DBLP]
    Great Lakes Symposium on VLSI, 1999, pp:325-0 [Conf]
  9. Amr G. Wassal, M. Anwarul Hasan, Mohamed I. Elmasry
    Low-Power Design of Finite Field Multipliers for Wireless Applications. [Citation Graph (0, 0)][DBLP]
    Great Lakes Symposium on VLSI, 1998, pp:19-25 [Conf]
  10. M. Anwarul Hasan
    Look-Up Table Based Large Finite Field Multiplication in Memory Constrained Cryptosystems. [Citation Graph (0, 0)][DBLP]
    IMA Int. Conf., 1999, pp:213-221 [Conf]
  11. Arash Reyhani-Masoleh, M. Anwarul Hasan
    On Efficient Normal Basis Multiplication. [Citation Graph (0, 0)][DBLP]
    INDOCRYPT, 2000, pp:213-224 [Conf]
  12. Amir K. Daneshbeh, M. Anwarul Hasan
    Area Efficient High Speed Elliptic Curve Cryptoprocessor for Random Curves. [Citation Graph (0, 0)][DBLP]
    ITCC (2), 2004, pp:588-0 [Conf]
  13. Jonathan Lutz, M. Anwarul Hasan
    High Performance FPGA based Elliptic Curve Cryptographic Co-Processor. [Citation Graph (0, 0)][DBLP]
    ITCC (2), 2004, pp:486-492 [Conf]
  14. Arash Reyhani-Masoleh, M. Anwarul Hasan
    Fast Normal Basis Multiplication Using General Purpose Processors. [Citation Graph (0, 0)][DBLP]
    Selected Areas in Cryptography, 2001, pp:230-244 [Conf]
  15. Amir K. Daneshbeh, M. Anwarul Hasan
    A Class of Unidirectional Bit Serial Systolic Architectures for Multiplicative Inversion and Division over GF(2m). [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2005, v:54, n:3, pp:370-380 [Journal]
  16. M. Anwarul Hasan
    Look-Up Table-Based Large Finite Field Multiplication in Memory Constrained Cryptosystems. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2000, v:49, n:7, pp:749-758 [Journal]
  17. M. Anwarul Hasan
    Power Analysis Attacks and Algorithmic Approaches to Their Countermeasures for Koblitz Curve Cryptosystems. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2001, v:50, n:10, pp:1071-1083 [Journal]
  18. M. Anwarul Hasan
    Division-and-Accumulation over GF(2'''). [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1997, v:46, n:6, pp:705-708 [Journal]
  19. M. Anwarul Hasan
    Double-Basis Multiplicative Inversion Over GF(2m). [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1998, v:47, n:9, pp:960-970 [Journal]
  20. M. Anwarul Hasan, Vijay K. Bhargava
    Bit-Serial Systolic Divider and Multiplier for Finite Fields GF(2^m). [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1992, v:41, n:8, pp:972-980 [Journal]
  21. M. Anwarul Hasan, Vijay K. Bhargava
    Architecture for a Low Complexity Rate-Adaptive Reed-Solomon Encoder. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1995, v:44, n:7, pp:938-942 [Journal]
  22. M. Anwarul Hasan, Amr G. Wassal
    VLSI Algorithms, Architectures, and Implementation of a Versatile GF(2m) Processor. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2000, v:49, n:10, pp:1064-1073 [Journal]
  23. M. Anwarul Hasan, Muzhong Wang, Vijay K. Bhargava
    Modular Construction of Low Complexity Parallel Multipliers for a Class of Finite Fields GF(2^m). [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1992, v:41, n:8, pp:962-971 [Journal]
  24. M. Anwarul Hasan, Muzhong Wang, Vijay K. Bhargava
    A Modified Massey-Omura Parallel Multiplier for a Class of Finite Fields. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1993, v:42, n:10, pp:1278-1280 [Journal]
  25. Arash Reyhani-Masoleh, M. Anwarul Hasan
    A New Construction of Massey-Omura Parallel Multiplier over GF(2m). [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2002, v:51, n:5, pp:511-520 [Journal]
  26. Arash Reyhani-Masoleh, M. Anwarul Hasan
    Efficient Multiplication Beyond Optimal Normal Bases. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2003, v:52, n:4, pp:428-439 [Journal]
  27. Arash Reyhani-Masoleh, M. Anwarul Hasan
    Fast Normal Basis Multiplication Using General Purpose Processors. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2003, v:52, n:11, pp:1379-1390 [Journal]
  28. Huapeng Wu, M. Anwarul Hasan
    Efficient Exponentiation of a Primitive Root in GF(2^m). [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1997, v:46, n:2, pp:162-172 [Journal]
  29. Huapeng Wu, M. Anwarul Hasan
    Low Complexity Bit-Parallel Multipliers for a Class of Finite Fields. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1998, v:47, n:8, pp:883-887 [Journal]
  30. Huapeng Wu, M. Anwarul Hasan
    Closed-Form Expression for the Average Weight of Signed-Digit Representations. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1999, v:48, n:8, pp:848-851 [Journal]
  31. Huapeng Wu, M. Anwarul Hasan, Ian F. Blake
    New Low-Complexity Bit-Parallel Finite Field Multipliers Using Weakly Dual Bases. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1998, v:47, n:11, pp:1223-1234 [Journal]
  32. Huapeng Wu, M. Anwarul Hasan, Ian F. Blake, Shuhong Gao
    Finite Field Multiplier Using Redundant Representation. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2002, v:51, n:11, pp:1306-1316 [Journal]

Search in 0.003secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002