Abderrahman Daif

According to our database, Abderrahman Daif authored at least 6 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

A masking method based on orthonormal spaces, protecting several bytes against both SCA and FIA with a reduced cost.

Claude Carlet, Abderrahman Daif, Sylvain Guilley, Cédric Tavernier

J. Cryptogr. Eng., June, 2024

Quasi-linear masking against SCA and FIA, with cost amortization.

Claude Carlet, Abderrahman Daif, Sylvain Guilley, Cédric Tavernier

IACR Trans. Cryptogr. Hardw. Embed. Syst., 2024

2023

Quasi-linear masking to protect against both SCA and FIA.

Claude Carlet, Abderrahman Daif, Sylvain Guilley, Cédric Tavernier

IACR Cryptol. ePrint Arch., 2023

2019

Les codes correcteurs au service de la cryptographie symétrique et asymétrique. (Correction codes at the service of cryptography).

Abderrahman Daif

PhD thesis, 2019

Polynomial direct sum masking to protect against both SCA and FIA.

Claude Carlet, Abderrahman Daif, Sylvain Guilley, Cédric Tavernier

J. Cryptogr. Eng., 2019

2015

Optimized linear complementary codes implementation for hardware trojan prevention.

Claude Carlet, Abderrahman Daif, Jean-Luc Danger, Sylvain Guilley, Zakaria Najm, Xuan Thuy Ngo, Thibault Porteboeuf, Cédric Tavernier

Proceedings of the European Conference on Circuit Theory and Design, 2015