Mohammad Esmaeildoust

Learn More
In this paper an efficient reverse converter for the new five moduli set {2n, 22n+1 − 1, 2n/2 − 1, 2n/2 + 1, 2n + 1} for even n is presented. With a little changes in latest introduced five moduli set {2n, 2n/2 − 1, 2n/2 + 1, 2n + 1, 22n−1 − 1} in order to achieve simple multiplicative inverse, this new moduli set is presented. The converter is designed in(More)
This paper presents a general architecture for designing efficient reverse converters based on the moduli set {2α, 22β+1-1, 2β-1}, where β ≺ α 2β, by using a parallel implementation of mixed-radix conversion (MRC) algorithm. The moduli set {2α, 22β+1-1, 2β-1} is free from modulo (2k+1)-type which can result in an efficient arithmetic unit for residue number(More)
Modular multiplication is the most important part of public key cryptography algorithm like RSA and elliptic curve cryptography. Residue Number System is an efficient way to speed up these applications because of its carry free nature. Efficiency of modular multiplication in RNS is depending on effective selection of RNS bases. In this work efficient design(More)
Modular multiplication is the main and basic operation in public key cryptography algorithms like Elliptic Curve Cryptography (ECC). By using Residue Number System (RNS) in these algorithms, large number computation is replaced by computation over the small moduli without carry propagation between moduli. Moduli selection has an important role in the(More)
The NTRU cryptography is a lattice-based public key cryptography. Encryption and decryption process in NTRU are based on polynomial multiplication. This property makes NTRU to be very fast compared to other public key cryptography algorithm such as elliptic curve cryptography and RSA. In order to fast implementation of NTRU, hardware implementation of NTRU(More)
Frequent episode discovery in alerts generated by intrusion detection systems has useful information for administrators. In this paper we consider the process of discovering frequent episodes in event sequences. Counting the frequencies of a set of candidate episodes is the most computationally intensive part of this process. We investigate the frequency(More)
In partially recon ̄gurable devices like FPGA, logic resources and communication channels can be recon ̄gured without a®ecting other section of the device. This allows parallel execution of multiple tasks on a FPGA. Due to limited resources on a FPGA, an e®ective management for e±cient execution of tasks is required. We present a new approach for management(More)
  • 1