Bahram Rashidi

dblp:147/6937 · DBLP profile ↗
← Back
10ranked-venue papers
10as first author
7since 2021 · last 2026
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 8 · 8 first-author · 7 since 2021Artificial intelligence and machine learning · 1 · 1 first-authorSecurity and privacy · 1 · 1 first-author
YearPublicationVenuePosition
2026 Area-efficient and high-performance approximate multiplier based on approximate 4:2 compressors
Bahram Rashidi
Integr.1
2026 Analysis of hazards in hardware implementations of cryptographic substitution boxes (S-boxes) with hazard location and mitigation
Bahram Rashidi
Integr.1
2024 Efficient and low-cost approximate multipliers for image processing applications
Bahram Rashidi
Integr.1
2024 Fault-tolerant and error-correcting 4-bit S-boxes for cryptography applications with multiple errors detection
Bahram Rashidi
J. Supercomput.1
2024 APPAs: fast and efficient approximate parallel prefix adders and multipliers
Bahram Rashidi
J. Supercomput.1
2022 Glitch-less hardware implementation of block ciphers based on an efficient glitch filter
Bahram Rashidi
Integr.1
2021 Compact and efficient structure of 8-bit S-box for lightweight cryptography
Bahram Rashidi
Integr.1
2017 High-performance and high-speed implementation of polynomial basis Itoh-Tsujii inversion algorithm over GF(2 m )
abstract
In this study high‐performance and high‐speed field‐programmable gate array (FPGA) implementations of polynomial basis Itoh–Tsujii inversion algorithm (ITA) over GF(2 m ) constructed by irreducible trinomials and pentanomials are presented. The proposed structures are designed by one field multiplier and k ‐times squarer blocks or exponentiation by 2 k , where k is a small positive integer. The k ‐times squarer blocks have an efficient tree structure with low critical path delay, and the multiplier is based on a proposed high‐speed digit‐serial architecture with minimum hardware resources. Furthermore, to reduce the computation time of ITA, the critical path of the circuit is broken to finer path using several registers. The computation times of the structure on Virtex‐4 FPGA family are 0.262, 0.192 and 0.271 µs for GF(2 163 ), GF(2 193 ) and GF(2 233 ), respectively. The comparison results with other implementations of the polynomial basis Itoh–Tsujii inversion algorithm verify the improvement in the proposed architecture in terms of speed and performance.
Bahram Rashidi, Reza Rezaeian Farashahi, Sayed Masoud Sayedi
IET Inf. Secur.1
2016 An efficient and high-speed VLSI implementation of optimal normal basis multiplication over GF(2m)
Bahram Rashidi, Sayed Masoud Sayedi, Reza Rezaeian Farashahi
Integr.1
2013 High performance and low-power finite impulse response filter based on ring topology with modified retiming serial multiplier on FPGA
abstract
In this study, a low‐power and high performance architecture for finite impulse response digital filter based on the ring topology which is modelled from recurrent neural network is presented. The proposed structure is based on a ring topology reduced number of multipliers, adders and also CLK cycles. In the design, all the operators including multipliers and adders have been designed at gate level. Multiplication is a very important operation in many digital filters hence, the authors designed a novel and modified retiming serial multiplier. To increase the performance, the authors use two types of adders, a proposed high‐speed logarithmic carry look ahead adder and a carry save adder with four inputs. The proposed structure is modelled and verified using FPGA and simulation results. It has been successfully synthesised and implemented with Xilinx ISE 7.1 and Virtex IV FPGA, target device Xc4vf100. The results demonstrate that the proposed method has high performance and low‐power consumption.
Bahram Rashidi
IET Signal Process.1