Остановите войну!
for scientists:
default search action
M. Anwar Hasan
- > Home > Persons > M. Anwar Hasan
Publications
- 2018
- [j60]Murat Cenk, Farhad Haghighi Zadeh, M. Anwar Hasan:
New Efficient Algorithms for Multiplication Over Fields of Characteristic Three. J. Signal Process. Syst. 90(3): 285-294 (2018) - 2017
- [j58]Murat Cenk, M. Anwar Hasan:
On the arithmetic complexity of Strassen-like matrix multiplications. J. Symb. Comput. 80: 484-501 (2017) - [c36]Jean-Claude Bajard, Julien Eynard, M. Anwar Hasan, Paulo Martins, Leonel Sousa, Vincent Zucca:
Efficient Reductions in Cyclotomic Rings - Application to Ring-LWE Based FHE Schemes. SAC 2017: 151-171 - [i7]Jean-Claude Bajard, Julien Eynard, M. Anwar Hasan, Paulo Martins, Leonel Sousa, Vincent Zucca:
Efficient reductions in cyclotomic rings - Application to R-LWE based FHE schemes. IACR Cryptol. ePrint Arch. 2017: 748 (2017) - 2016
- [c35]Nicolas Méloni, M. Anwar Hasan:
Random Digit Representation of Integers. ARITH 2016: 118-125 - [c34]Jean-Claude Bajard, Julien Eynard, M. Anwar Hasan, Vincent Zucca:
A Full RNS Variant of FV Like Somewhat Homomorphic Encryption Schemes. SAC 2016: 423-442 - [i6]Jean-Claude Bajard, Julien Eynard, M. Anwar Hasan, Vincent Zucca:
A Full RNS Variant of FV like Somewhat Homomorphic Encryption Schemes. IACR Cryptol. ePrint Arch. 2016: 510 (2016) - 2015
- [j56]Murat Cenk, M. Anwar Hasan:
Some new results on binary polynomial multiplication. J. Cryptogr. Eng. 5(4): 289-303 (2015) - [j55]Nicolas Méloni, M. Anwar Hasan:
Efficient Double Bases for Scalar Multiplication. IEEE Trans. Computers 64(8): 2204-2212 (2015) - [j54]Ayad F. Barsoum, M. Anwar Hasan:
Provable Multicopy Dynamic Data Possession in Cloud Computing Systems. IEEE Trans. Inf. Forensics Secur. 10(3): 485-497 (2015) - [i5]Murat Cenk, M. Anwar Hasan:
Some New Results on Binary Polynomial Multiplication. IACR Cryptol. ePrint Arch. 2015: 94 (2015) - [i4]Nicolas Méloni, M. Anwar Hasan:
Random Digit Representation of Integers. IACR Cryptol. ePrint Arch. 2015: 622 (2015) - 2014
- [j53]Murat Cenk, M. Anwar Hasan, Christophe Nègre:
Efficient Subquadratic Space Complexity Binary Polynomial Multipliers Based on Block Recombination. IEEE Trans. Computers 63(9): 2273-2287 (2014) - 2013
- [j52]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) - [j51]Murat Cenk, Christophe Nègre, M. Anwar Hasan:
Improved Three-Way Split Formulas for Binary Polynomial and Toeplitz Matrix Vector Products. IEEE Trans. Computers 62(7): 1345-1361 (2013) - [j50]M. Anwar Hasan, Christophe Nègre:
Multiway Splitting Method for Toeplitz Matrix Vector Product. IEEE Trans. Computers 62(7): 1467-1471 (2013) - [j48]Ayad F. Barsoum, M. Anwar Hasan:
Enabling Dynamic Data and Indirect Mutual Trust for Cloud Computing Storage Systems. IEEE Trans. Parallel Distributed Syst. 24(12): 2375-2385 (2013) - [i3]Murat Cenk, M. Anwar Hasan:
On the Arithmetic Complexity of Strassen-Like Matrix Multiplications. IACR Cryptol. ePrint Arch. 2013: 107 (2013) - 2012
- [j47]M. Anwar Hasan, Christophe Nègre:
Sequential multiplier with sub-linear gate complexity. J. Cryptogr. Eng. 2(2): 91-97 (2012) - [j46]M. Anwar Hasan, Nicolas Méloni, 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) - [j45]M. Anwar Hasan, Ashkan Hosseinzadeh Namin, Christophe Nègre:
Toeplitz Matrix Approach for Binary Field Multiplication Using Quadrinomials. IEEE Trans. Very Large Scale Integr. Syst. 20(3): 449-458 (2012) - [c30]Ayad F. Barsoum, M. Anwar Hasan:
Integrity Verification of Multiple Data Copies over Untrusted Cloud Servers. CCGRID 2012: 829-834 - [c29]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 - [p1]Abdulaziz Alkhoraidly, Agustin Dominguez-Oviedo, M. Anwar Hasan:
Fault Attacks on Elliptic Curve Cryptosystems. Fault Analysis in Cryptography 2012: 137-155 - 2011
- [j44]Agustin Dominguez-Oviedo, M. Anwar Hasan:
Algorithm-level error detection for Montgomery ladder-based ECSM. J. Cryptogr. Eng. 1(1): 57-69 (2011) - [j42]Nicolas Méloni, Christophe Nègre, M. Anwar Hasan:
High performance GHASH and impacts of a class of unconventional bases. J. Cryptogr. Eng. 1(3): 201-218 (2011) - [j41]Agustin Dominguez-Oviedo, M. Anwar Hasan, Bijan Ansari:
Fault-Based Attack on Montgomery's Ladder Algorithm. J. Cryptol. 24(2): 346-374 (2011) - [j40]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) - [c28]Murat Cenk, Christophe Nègre, M. Anwar Hasan:
Improved Three-Way Split Formulas for Binary Polynomial Multiplication. Selected Areas in Cryptography 2011: 384-398 - [i2]Ayad F. Barsoum, M. Anwar Hasan:
On Verifying Dynamic Multiple Data Copies over Cloud Servers. IACR Cryptol. ePrint Arch. 2011: 447 (2011) - 2010
- [c27]Nicolas Méloni, Christophe Nègre, M. Anwar Hasan:
High Performance GHASH Function for Long Messages. ACNS 2010: 154-167 - [c26]Ashkan Hosseinzadeh Namin, M. Anwar Hasan:
Implementation of the compression function for selected SHA-3 candidates on FPGA. IPDPS Workshops 2010: 1-4 - 2009
- [j37]Agustin Dominguez-Oviedo, M. Anwar Hasan:
Error Detection and Fault Tolerance in ECSM Using Input Randomization. IEEE Trans. Dependable Secur. Comput. 6(3): 175-187 (2009) - [c25]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 - [c24]Nicolas Méloni, M. Anwar Hasan:
Elliptic Curve Scalar Multiplication Combining Yao's Algorithm and Double Bases. CHES 2009: 304-316 - 2008
- [j36]Bijan Ansari, M. Anwar Hasan:
High-Performance Architecture of Elliptic Curve Scalar Multiplication. IEEE Trans. Computers 57(11): 1443-1453 (2008) - [c23]M. Anwar Hasan, Christophe Nègre:
Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation. WAIFI 2008: 88-102 - 2002
- [j17]Huapeng Wu, M. Anwarul Hasan, Ian F. Blake, Shuhong Gao:
Finite Field Multiplier Using Redundant Representation. IEEE Trans. Computers 51(11): 1306-1316 (2002) - 2001
- [j14]Huapeng Wu, M. Anwar Hasan:
Efficient exponentiation using weakly dual basis. IEEE Trans. Very Large Scale Integr. Syst. 9(6): 874-879 (2001) - 1999
- [j11]Huapeng Wu, M. Anwarul Hasan:
Closed-Form Expression for the Average Weight of Signed-Digit Representations. IEEE Trans. Computers 48(8): 848-851 (1999) - [c4]Huapeng Wu, M. Anwarul Hasan, Ian F. Blake:
Highly Regular Architectures for Finite Field Computation Using Redundant Basis. CHES 1999: 269-279 - 1998
- [j10]Huapeng Wu, M. Anwarul Hasan:
Low Complexity Bit-Parallel Multipliers for a Class of Finite Fields. IEEE Trans. Computers 47(8): 883-887 (1998) - [j8]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) - 1997
- [j7]Huapeng Wu, M. Anwarul Hasan:
Efficient Exponentiation of a Primitive Root in GF(2^m). IEEE Trans. Computers 46(2): 162-172 (1997) - 1995
- [j5]M. Anwarul Hasan, Vijay K. Bhargava:
Architecture for a Low Complexity Rate-Adaptive Reed-Solomon Encoder. IEEE Trans. Computers 44(7): 938-942 (1995) - 1994
- [j4]M. Anwar Hasan, J. C. Lee, Vijay K. Bhargava:
A narrowband interference canceller with an adjustable center weight. IEEE Trans. Commun. 42(234): 877-880 (1994) - 1993
- [j3]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
- [j2]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) - [j1]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)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-03-20 01:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint