Loubna Ghammam

Orcid: 0000-0003-3438-1860

According to our database1, Loubna Ghammam authored at least 14 papers between 2015 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On Computing the Multidimensional Scalar Multiplication on Elliptic Curves.
IACR Cryptol. ePrint Arch., 2024

2022
New Versions of Miller-loop Secured Against Side-Channel Attacks.
Proceedings of the Arithmetic of Finite Fields - 9th International Workshop, 2022

2020
A Cryptanalysis of Two Cancelable Biometric Schemes Based on Index-of-Max Hashing.
IEEE Trans. Inf. Forensics Secur., 2020

2019
A taxonomy of pairings, their security, their complexity.
IACR Cryptol. ePrint Arch., 2019

GREYC-Hashing: Combining biometrics and secret for enhancing the security of protected templates.
Future Gener. Comput. Syst., 2019

2018
High speed and efficient area optimal ate pairing processor implementation over BN and BLS12 curves on FPGA.
Microprocess. Microsystems, 2018

Enhancing the Security of Transformation Based Biometric Template Protection Schemes.
Proceedings of the 2018 International Conference on Cyberworlds, 2018

2017
Efficient Optimal Ate Pairing at 128-bit Security Level.
IACR Cryptol. ePrint Arch., 2017

2016
Adequate Elliptic Curve for Computing the Product of n Pairings.
IACR Cryptol. ePrint Arch., 2016

On the Computation of the Optimal Ate Pairing at the 192-bit Security Level.
IACR Cryptol. ePrint Arch., 2016

Memory-saving computation of the pairing final exponentiation on BN curves.
Groups Complex. Cryptol., 2016

Adequate Elliptic Curves for Computing the Product of n Pairings.
Proceedings of the Arithmetic of Finite Fields - 6th International Workshop, 2016

2015
Area-Efficient Hardware Implementation of the Optimal Ate Pairing over BN curves.
IACR Cryptol. ePrint Arch., 2015

Memory-saving computation of the pairing fi nal exponentiation on BN curves.
IACR Cryptol. ePrint Arch., 2015


  Loading...