Mohammad Farmani

2016201720182019202020212022202320242 6 14 12 9 16 17 13 4

Public access

1 article

0 articles

available

not available

Based on funding mandates

Siavash Bayat SarmadiDepartment of Computer Eng., Sharif University of TechnologyVerified email at sharif.edu
Thomas EisenbarthUniversity of LübeckVerified email at uni-luebeck.de
Yier JinAssociate Professor, University of FloridaVerified email at ece.ufl.edu
Raziyeh SalarifardAssistant Professor , Department of Computer Engineering and Science, Shahid Beheshti UniversityVerified email at sbu.ac.ir

Mohammad Farmani

Verified email at ufl.edu


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Tale of Two Shares: Why Two-Share Threshold Implementation Seems Worthwhile—and Why It Is Not C Chen, M Farmani, T Eisenbarth Advances in Cryptology – ASIACRYPT 10031, pp.819-843, 2016	26	2016
High-Throughput Low-Complexity Systolic Montgomery Multiplication OverBased on Trinomials S Bayat-Sarmadi, M Farmani IEEE Transactions on Circuits and Systems II: Express Briefs 62 (4), 377-381, 2015	23	2015
Hardware-assisted cybersecurity for IoT devices F Rahman, M Farmani, M Tehranipoor, Y Jin 2017 18th International Workshop on Microprocessor and SOC Test and …, 2017	20	2017
RHAT: Efficient RowHammer-Aware Test for Modern DRAM Modules M Farmani, M Tehranipoor, F Rahman 2021 IEEE European Test Symposium (ETS), 2021	15	2021
High-Throughput Low-Complexity Unified Multipliers Over in Dual and Triangular Bases R Salarifard, S Bayat-Sarmadi, M Farmani IEEE Transactions on Circuits and Systems I: Regular Papers 63 (11), 1944-1953, 2016	6	2016
Threshold Implementations of the Present Cipher M Farmani WORCESTER POLYTECHNIC INSTITUTE, 2017	3	2017

The system can't perform the operation now. Try again later.

Articles 1–6

Citations per year