The following pages link to M. Anwarul Hasan (Q2163761):
Displaying 50 items.
- (Q346559) (redirect page) (← links)
- On the arithmetic complexity of Strassen-like matrix multiplications (Q346560) (← links)
- Fault-based attack on Montgomery's ladder algorithm (Q656523) (← links)
- On \(\tau\)-adic representations of integers (Q1008948) (← links)
- A full RNS variant of FV like somewhat homomorphic encryption schemes (Q1698661) (← links)
- Security analysis of a cryptosystem based on subspace subcodes (Q2163762) (← links)
- Privacy-preserving attribute-keyword based data publish-subscribe service on cloud platforms (Q2293030) (← links)
- On binary signed digit representations of integers (Q2383981) (← links)
- A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers (Q2512883) (← links)
- (Q2707608) (← links)
- Fault Attacks on Elliptic Curve Cryptosystems (Q2838304) (← links)
- Improved Three-Way Split Formulas for Binary Polynomial Multiplication (Q2889884) (← links)
- Efficient Double Bases for Scalar Multiplication (Q2982143) (← links)
- (Q3154879) (← links)
- A class of unidirectional bit serial systolic architectures for multiplicative inversion and division over GF(2/sup m/) (Q3417013) (← links)
- A new construction of Massey-Omura parallel multiplier over GF(2/sup m/) (Q3417022) (← links)
- A modified Massey-Omura parallel multiplier for a class of finite fields (Q3417058) (← links)
- Towards Faster and Greener Cryptoprocessor for Eta Pairing on Supersingular Elliptic Curve over $\mathbb{F}_{2^{1223}}$ (Q3455496) (← links)
- Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation (Q3519554) (← links)
- Comments on "Five, Six, and Seven-Term Karatsuba-Like Formulae (Q3525130) (← links)
- High Performance GHASH Function for Long Messages (Q3575044) (← links)
- Elliptic Curve Scalar Multiplication Combining Yao’s Algorithm and Double Bases (Q3642946) (← links)
- (Q4354774) (← links)
- Architecture for a low complexity rate-adaptive Reed-Solomon encoder (Q4421232) (← links)
- (Q4425739) (← links)
- (Q4502794) (← links)
- (Q4536211) (← links)
- Low-Weight Polynomial Form Integers for Efficient Modular Multiplication (Q4564099) (← links)
- A New Approach to Subquadratic Space Complexity Parallel Multipliers for Extended Binary Fields (Q4564117) (← links)
- Subquadratic Computational Complexity Schemes for Extended Binary Field Multiplication Using Optimal Normal Bases (Q4564229) (← links)
- Finite field multiplier using redundant representation (Q4571246) (← links)
- Look-up table-based large finite field multiplication in memory constrained cryptosystems (Q4571367) (← links)
- Closed-form expression for the average weight of signed-digit representations (Q4571415) (← links)
- Low complexity bit-parallel multipliers for a class of finite fields (Q4571476) (← links)
- Double-basis multiplicative inversion over GF(2/sup m/) (Q4571482) (← links)
- New low-complexity bit-parallel finite field multipliers using weakly dual bases (Q4571485) (← links)
- Fast Bit Parallel-Shifted Polynomial Basis Multipliers in <formula formulatype="inline"><tex>$GF(2^{n})$</tex></formula> (Q4590517) (← links)
- (Q4736435) (← links)
- Concurrent Error Detection in Finite-Field Arithmetic Operations Using Pipelined and Systolic Architectures (Q4974884) (← links)
- High-Performance Architecture of Elliptic Curve Scalar Multiplication (Q4975063) (← links)
- On Low Complexity Bit Parallel Polynomial Basis Multipliers (Q5187954) (← links)
- Efficient Subquadratic Space Complexity Binary Polynomial Multipliers Based on Block Recombination (Q5268073) (← links)
- Improved Area-Time Tradeoffs for Field Multiplication Using Optimal Normal Bases (Q5274284) (← links)
- Improved Three-Way Split Formulas for Binary Polynomial and Toeplitz Matrix Vector Products (Q5274444) (← links)
- Multiway Splitting Method for Toeplitz Matrix Vector Product (Q5274457) (← links)
- Block Recombination Approach for Subquadratic Space Complexity Binary Field Multiplication Based on Toeplitz Matrix-Vector Product (Q5277655) (← links)
- Low Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation (Q5280607) (← links)
- Modular construction of low complexity parallel multipliers for a class of finite fields GF(2/sup m/) (Q5375358) (← links)
- Bit-serial systolic divider and multiplier for finite fields GF(2/sup m/) (Q5375359) (← links)
- Selected Areas in Cryptography (Q5713974) (← links)
