#### Filter Results:

- Full text PDF available (14)

#### Publication Year

2000

2018

- This year (3)
- Last 5 years (21)
- Last 10 years (46)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Arash Reyhani-Masoleh, M. Anwar Hasan
- IEEE Transactions on Computers
- 2004

Representing the field elements with respect to the polynomial (or standard) basis, we consider bit parallel architectures for multiplication over the finite field GF(2m). In this effect, first we… (More)

- Arash Reyhani-Masoleh
- IEEE Transactions on Computers
- 2006

Recently, implementations of normal basis multiplication over the extended binary field GF(2/sup m/) have received considerable attention. A class of low complexity normal bases called Gaussian… (More)

- Arash Hariri, Arash Reyhani-Masoleh
- IEEE Transactions on Computers
- 2009

Multiplication and squaring are main finite field operations in cryptographic computations and designing efficient multipliers and squarers affect the performance of cryptosystems. In this paper, we… (More)

- Arash Reyhani-Masoleh, M. Anwar Hasan
- IEEE Transactions on Computers
- 2005

For efficient hardware implementation of finite field arithmetic units, the use of a normal basis is advantageous. In this paper, two classes of architectures for multipliers over the finite field… (More)

- Reza Azarderakhsh, Arash Reyhani-Masoleh
- IEEE Transactions on Very Large Scale Integration…
- 2012

Efficient implementation of point multiplication is crucial for elliptic curve cryptographic systems. This paper presents the implementation results of an elliptic curve crypto-processor over binary… (More)

- Arash Reyhani-Masoleh, M. Anwar Hasan
- IEEE Trans. Computers
- 2002

ÐThe Massey-Omura multiplier of GF
2m uses a normal basis and its bit parallel version is usually implemented using m identical combinational logic blocks whose inputs are cyclically shifted from… (More)

- Arash Reyhani-Masoleh, M. Anwar Hasan
- IEEE Transactions on Computers
- 2006

In many cryptographic schemes, the most time consuming basic arithmetic operation is the finite field multiplication and its hardware implementation for bit parallel operation may require millions of… (More)

- Mehran Mozaffari Kermani, Arash Reyhani-Masoleh
- IEEE Transactions on Computers
- 2010

The Advanced Encryption Standard (AES) has been lately accepted as the symmetric cryptography standard for confidential data transmission. However, the natural and malicious injected faults reduce… (More)

- Arash Reyhani-Masoleh, M. Anwar Hasan
- Selected Areas in Cryptography
- 2001

For cryptographic applications, normal bases have received considerable attention, especially for hardware implementation. In this article, we consider fast software algorithms for normal basis… (More)

- Reza Azarderakhsh, Arash Reyhani-Masoleh
- IEEE Transactions on Computers
- 2013

The extensive rise in the number of resource constrained wireless devices and the needs for secure communications with the servers imply fast and efficient cryptographic computations for both… (More)