25 citations · 25 across the 4 of their papers we have counts for
7 papers
REPQC: Reverse Engineering and Backdooring Hardware Accelerators for Post-quantum Cryptography
Samuel Pagliarini, Aikata Aikata, Malik Imran +1
Significant research efforts have been dedicated to designing cryptographic algorithms that are quantum-resistant. The motivation is clear: robust quantum computers, once available…
Multiplierless Design of High-Speed Very Large Constant Multiplications
Levent Aksoy, Debapriya Basu Roy, Malik Imran +1
In cryptographic algorithms, the constants to be multiplied by a variable can be very large due to security requirements. Thus, the hardware complexity of such algorithms heavily d…
Multiplierless Design of Very Large Constant Multiplications in Cryptography
Levent Aksoy, Debapriya Basu Roy, Malik Imran +2
This brief addresses the problem of implementing very large constant multiplications by a single variable under the shift-adds architecture using a minimum number of adders/subtrac…
Design Space Exploration of SABER in 65nm ASIC
Malik Imran, Felipe Almeida, Jaan Raik +3
This paper presents a design space exploration for SABER, one of the finalists in NIST's quantum-resistant public-key cryptographic standardization effort. Our design space explora…
Side-Channel Trojan Insertion -- a Practical Foundry-Side Attack via ECO
Tiago Perez, Malik Imran, Pablo Vaz +1
Design companies often outsource their integrated circuit (IC) fabrication to third parties where ICs are susceptible to malicious acts such as the insertion of a side-channel hard…
An Open-source Library of Large Integer Polynomial Multipliers
Malik Imran, Zain Ul Abideen, Samuel Pagliarini
Polynomial multiplication is a bottleneck in most of the public-key cryptography protocols, including Elliptic-curve cryptography and several of the post-quantum cryptography algor…