Current Members and HQP
Moslem Haidarpor, Post Doctorate Fellow
Hardware Security
One of the fast multiplication methods is Karartsuba gorithm. The polynomial edition of extensively studied for efficient realization. These studies try to improve the and cost in both algorithm and device level. However, the question to answer is: does reducing the complexity necessarily results in faster or cheaper hardware?
In this work, we show that this not always the case for the Karatsuba algorithm.
Alex Leigh, Post Doctorate Fellow
Hardware Security
Madhan Kumar Thirumoorthi, Ph.D. Candidate
Hardware Security
Harikrishnan Balagopal, Ph.D. Candidate
Hardware Security
Hiva Assasi, Ph.D. Candidate
Hardware Security
Elnaz Akhavan Rezaee, Ph.D. Candidate
Foroogh Behnia, Ph.D. Candidate
Route optimization for a fleet of EV buses
Narges Rahimi, Ph.D. Candidate
Risk Assesment for EV buses
Emilio Quaggiotto, M.A.Sc. student
Hardware Security
Prashee Arora, M.A.Sc. student
Hardware Security
Fahimeh Pakzadalinodehi, M.A.Sc. student
Hardware Security
