M. Anwar Hasan

From MaRDI portal
Person:2163761

Available identifiers

zbMath Open hasan.m-anwarMaRDI QIDQ2163761

List of research outcomes





PublicationDate of PublicationType
Speeding-up parallel computation of large smooth-degree isogeny using precedence-constrained scheduling2023-07-26Paper
A code-based hybrid signcryption scheme2023-07-24Paper
Security analysis of a cryptosystem based on subspace subcodes2022-08-11Paper
Privacy-preserving attribute-keyword based data publish-subscribe service on cloud platforms2020-02-06Paper
Bit-serial systolic divider and multiplier for finite fields GF(2/sup m/)2018-09-14Paper
Modular construction of low complexity parallel multipliers for a class of finite fields GF(2/sup m/)2018-09-14Paper
Closed-form expression for the average weight of signed-digit representations2018-07-09Paper
Low complexity bit-parallel multipliers for a class of finite fields2018-07-09Paper
Finite field multiplier using redundant representation2018-07-09Paper
New low-complexity bit-parallel finite field multipliers using weakly dual bases2018-07-09Paper
Look-up table-based large finite field multiplication in memory constrained cryptosystems2018-07-09Paper
Double-basis multiplicative inversion over GF(2/sup m/)2018-07-09Paper
A New Approach to Subquadratic Space Complexity Parallel Multipliers for Extended Binary Fields2018-06-12Paper
Subquadratic Computational Complexity Schemes for Extended Binary Field Multiplication Using Optimal Normal Bases2018-06-12Paper
Low-Weight Polynomial Form Integers for Efficient Modular Multiplication2018-06-12Paper
A full RNS variant of FV like somewhat homomorphic encryption schemes2018-02-16Paper
Fast Bit Parallel-Shifted Polynomial Basis Multipliers in <formula formulatype="inline"><tex>$GF(2^{n})$</tex></formula>2017-11-20Paper
High-Performance Architecture of Elliptic Curve Scalar Multiplication2017-08-08Paper
Concurrent Error Detection in Finite-Field Arithmetic Operations Using Pipelined and Systolic Architectures2017-08-08Paper
Low Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation2017-07-27Paper
Block Recombination Approach for Subquadratic Space Complexity Binary Field Multiplication Based on Toeplitz Matrix-Vector Product2017-07-12Paper
Improved Three-Way Split Formulas for Binary Polynomial and Toeplitz Matrix Vector Products2017-07-12Paper
Multiway Splitting Method for Toeplitz Matrix Vector Product2017-07-12Paper
Improved Area-Time Tradeoffs for Field Multiplication Using Optimal Normal Bases2017-07-12Paper
Efficient Subquadratic Space Complexity Binary Polynomial Multipliers Based on Block Recombination2017-06-20Paper
Efficient Double Bases for Scalar Multiplication2017-05-16Paper
On the arithmetic complexity of Strassen-like matrix multiplications2016-11-29Paper
Towards Faster and Greener Cryptoprocessor for Eta Pairing on Supersingular Elliptic Curve over $\mathbb{F}_{2^{1223}}$2015-12-04Paper
A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers2015-01-30Paper
Fault attacks on elliptic curve cryptosystems2013-07-09Paper
Improved three-way split formulas for binary polynomial multiplication2012-06-08Paper
Fault-based attack on Montgomery's ladder algorithm2012-01-18Paper
High performance GHASH function for long messages2010-07-06Paper
On low complexity bit parallel polynomial basis multipliers.2010-03-09Paper
Elliptic Curve Scalar Multiplication Combining Yao’s Algorithm and Double Bases2009-11-10Paper
On \(\tau\)-adic representations of integers2009-03-31Paper
Comments on "Five, Six, and Seven-Term Karatsuba-Like Formulae2008-09-10Paper
Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation2008-08-19Paper
On binary signed digit representations of integers2007-09-20Paper
A modified Massey-Omura parallel multiplier for a class of finite fields2007-01-09Paper
A new construction of Massey-Omura parallel multiplier over GF(2/sup m/)2007-01-09Paper
A class of unidirectional bit serial systolic architectures for multiplicative inversion and division over GF(2/sup m/)2007-01-09Paper
Selected Areas in Cryptography2005-12-27Paper
https://portal.mardi4nfdi.de/entity/Q31548792005-01-14Paper
https://portal.mardi4nfdi.de/entity/Q47364352004-08-09Paper
Architecture for a low complexity rate-adaptive Reed-Solomon encoder2003-11-10Paper
https://portal.mardi4nfdi.de/entity/Q44257392003-09-11Paper
https://portal.mardi4nfdi.de/entity/Q45362112002-11-28Paper
https://portal.mardi4nfdi.de/entity/Q27076082001-12-16Paper
https://portal.mardi4nfdi.de/entity/Q45027942000-11-07Paper
https://portal.mardi4nfdi.de/entity/Q43547741997-09-17Paper

Research outcomes over time

This page was built for person: M. Anwar Hasan