Loubna Ghammam
YOU?
Author Swipe
View article: New Versions of Miller-loop Secured Against Side-Channel Attacks
New Versions of Miller-loop Secured Against Side-Channel Attacks Open
View article: A taxonomy of pairings, their security, their complexity
A taxonomy of pairings, their security, their complexity Open
L'article a été soumis à "Journal of Mathematical Cryptology" https://journals.flvc.org/mathcryptology/ en aoũt 2019. Nous n'avons pas reçu de réponse car les éditeurs ont démissionné. En mai 2020 Guillevic a publié une attacque qui nous a…
View article: A Cryptanalysis of Two Cancelable Biometric Schemes Based on Index-of-Max Hashing
A Cryptanalysis of Two Cancelable Biometric Schemes Based on Index-of-Max Hashing Open
Cancelable biometric schemes generate secure biometric templates by combining\nuser specific tokens and biometric data. The main objective is to create\nirreversible, unlinkable, and revocable templates, with high accuracy in\nmatching. In…
View article: A Cryptanalysis of Two Cancelable Biometric Schemes based on Index-of-Max Hashing
A Cryptanalysis of Two Cancelable Biometric Schemes based on Index-of-Max Hashing Open
Cancelable biometric schemes generate secure biometric templates by combining user specific tokens and biometric data. The main objective is to create irreversible, unlinkable, and revocable templates, with high accuracy in matching. In th…
View article: GREYC-Hashing: Combining biometrics and secret for enhancing the security of protected templates
GREYC-Hashing: Combining biometrics and secret for enhancing the security of protected templates Open
View article: Enhancing the Security of Transformation Based Biometric Template Protection Schemes
Enhancing the Security of Transformation Based Biometric Template Protection Schemes Open
International audience
View article: Efficient Optimal Ate Pairing at 128-bit Security Level
Efficient Optimal Ate Pairing at 128-bit Security Level Open
International audience
View article: Memory-saving computation of the pairing final exponentiation on BN curves
Memory-saving computation of the pairing final exponentiation on BN curves Open
Tate pairing computation is made of two steps. The first one, the Miller loop, is an exponentiation in the group of points of an elliptic curve. The second one, the final exponentiation, is an exponentiation in the multiplicative group of …