| 2008 |
|---|
| 22 | EE | Mehran Mozaffari Kermani,
Arash Reyhani-Masoleh:
A Lightweight Concurrent Fault Detection Scheme for the AES S-Boxes Using Normal Basis.
CHES 2008: 113-129 |
| 21 | EE | Arash Reyhani-Masoleh:
A New Bit-Serial Architecture for Field Multiplication Using Polynomial Bases.
CHES 2008: 300-314 |
| 20 | EE | Arash Hariri,
Arash Reyhani-Masoleh:
Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fields.
WAIFI 2008: 103-116 |
| 2007 |
|---|
| 19 | EE | Arash Hariri,
Arash Reyhani-Masoleh:
Fault Detection Structures for the Montgomery Multiplication over Binary Extension Fields.
FDTC 2007: 37-46 |
| 18 | EE | Mehran Mozaffari Kermani,
Arash Reyhani-Masoleh:
A Structure-independent Approach for Fault Detection Hardware Implementations of the Advanced Encryption Standard.
FDTC 2007: 47-53 |
| 2006 |
|---|
| 17 | EE | Mehran Mozaffari Kermani,
Arash Reyhani-Masoleh:
Parity Prediction of S-Box for AES.
CCECE 2006: 2357-2360 |
| 16 | EE | Mehran Mozaffari Kermani,
Arash Reyhani-Masoleh:
Parity-Based Fault Detection Architecture of S-box for Advanced Encryption Standard.
DFT 2006: 572-580 |
| 15 | EE | Arash Reyhani-Masoleh:
Efficient Algorithms and Architectures for Field Multiplication Using Gaussian Normal Bases.
IEEE Trans. Computers 55(1): 34-47 (2006) |
| 14 | EE | Arash Reyhani-Masoleh,
M. Anwar Hasan:
Fault Detection Architectures for Field Multiplication Using Polynomial Bases.
IEEE Trans. Computers 55(9): 1089-1103 (2006) |
| 2005 |
|---|
| 13 | EE | Arash Reyhani-Masoleh,
M. Anwar Hasan:
Low Complexity Word-Level Sequential Normal Basis Multipliers.
IEEE Trans. Computers 54(2): 98-110 (2005) |
| 2004 |
|---|
| 12 | EE | Arash Reyhani-Masoleh,
M. Anwar Hasan:
Efficient digit-serial normal basis multipliers over binary extension fields.
ACM Trans. Embedded Comput. Syst. 3(3): 575-592 (2004) |
| 11 | EE | Arash Reyhani-Masoleh,
M. Anwar Hasan:
Towards fault-tolerant cryptographic computations over finite fields.
ACM Trans. Embedded Comput. Syst. 3(3): 593-613 (2004) |
| 10 | EE | Arash Reyhani-Masoleh,
M. Anwar Hasan:
Low Complexity Bit Parallel Architectures for Polynomial Basis Multiplication over GF(2^{m}).
IEEE Trans. Computers 53(8): 945-959 (2004) |
| 2003 |
|---|
| 9 | EE | Arash Reyhani-Masoleh,
M. Anwarul Hasan:
On Low Complexity Bit Parallel Polynomial Basis Multipliers.
CHES 2003: 189-202 |
| 8 | EE | Arash Reyhani-Masoleh,
M. Anwarul Hasan:
Low Complexity Sequential Normal Basis Multipliers over GF(2m).
IEEE Symposium on Computer Arithmetic 2003: 188-195 |
| 7 | EE | Arash Reyhani-Masoleh,
M. Anwarul Hasan:
Fast Normal Basis Multiplication Using General Purpose Processors.
IEEE Trans. Computers 52(11): 1379-1390 (2003) |
| 6 | EE | Arash Reyhani-Masoleh,
M. Anwarul Hasan:
Efficient Multiplication Beyond Optimal Normal Bases.
IEEE Trans. Computers 52(4): 428-439 (2003) |
| 2002 |
|---|
| 5 | EE | Arash Reyhani-Masoleh,
M. Anwarul Hasan:
Error Detection in Polynomial Basis Multipliers over Binary Extension Fields.
CHES 2002: 515-528 |
| 4 | EE | Arash Reyhani-Masoleh,
M. Anwar Hasan:
Efficient digit-serial normal basis multipliers over GF(2/sup m/).
ISCAS (5) 2002: 781-784 |
| 3 | EE | Arash Reyhani-Masoleh,
M. Anwarul Hasan:
A New Construction of Massey-Omura Parallel Multiplier over GF(2m).
IEEE Trans. Computers 51(5): 511-520 (2002) |
| 2001 |
|---|
| 2 | EE | Arash Reyhani-Masoleh,
M. Anwarul Hasan:
Fast Normal Basis Multiplication Using General Purpose Processors.
Selected Areas in Cryptography 2001: 230-244 |
| 2000 |
|---|
| 1 | EE | Arash Reyhani-Masoleh,
M. Anwarul Hasan:
On Efficient Normal Basis Multiplication.
INDOCRYPT 2000: 213-224 |
