Search For:

Displaying 1-6 out of 6 total
New Low-Complexity Bit-Parallel Finite Field Multipliers Using Weakly Dual Bases
Found in: IEEE Transactions on Computers
By Huapeng Wu, M. Anwarul Hasan, Ian F. Blake
Issue Date:November 1998
pp. 1223-1234
<p><b>Abstract</b>—New structures of bit-parallel weakly dual basis (<scp>WDB</scp>) multipliers over the binary ground field are proposed. An upper bound on the size complexity of bit-parallel multiplier using an arbitrary ge...
 
Efficient Exponentiation of a Primitive Root in GF(2m)
Found in: IEEE Transactions on Computers
By Huapeng Wu, M. Anwarul Hasan
Issue Date:February 1997
pp. 162-172
<p><b>Abstract</b>—In this paper, exponentiation of a primitive root in GF(2<super><it>m</it></super>) is considered. Signed digit (SD) number representation is used to efficiently represent the exponent and the co...
 
Double-Basis Multiplicative Inversion Over GF(2m)
Found in: IEEE Transactions on Computers
By M. Anwarul Hasan
Issue Date:September 1998
pp. 960-970
<p><b>Abstract</b>—Inversion over Galois fields is much more difficult than the corresponding multiplication. In this article, efficient computation of inverses in GF(2<super><it>m</it></super>) is considered by so...
 
Low Complexity Bit-Parallel Multipliers for a Class of Finite Fields
Found in: IEEE Transactions on Computers
By Huapeng Wu, M. Anwarul Hasan
Issue Date:August 1998
pp. 883-887
<p><b>Abstract</b>—New implementations of bit-parallel multipliers for a class of finite fields are proposed. The class of finite fields is constructed with irreducible AOPs (all one polynomials) and ESPs (equally spaced polynomials). The...
 
Cloud-hosted key sharing towards secure and scalable mobile applications in clouds
Found in: 2013 International Conference on Computing, Networking and Communications (ICNC)
By Piotr K. Tysowski,M. Anwarul Hasan
Issue Date:January 2013
pp. 449-455
User data may be stored in a cloud to take advantage of its scalability, accessibility, and economics. However, data of a sensitive nature must be protected from being read in the clear by an untrusted cloud provider. It is also beneficial to provide finit...
 
Look-Up Table-Based Large Finite Field Multiplication in Memory Constrained Cryptosystems
Found in: IEEE Transactions on Computers
By M. Anwarul Hasan
Issue Date:July 2000
pp. 749-758
<p><b>Abstract</b>—Many cryptographic systems use multiplication in the finite field GF(<tmath>$2^n$</tmath>) for their underlying computations. In the recent past, a number of look-up table-based algorithms have been proposed...
 
 1