Nadia El Mrabet

Orcid: 0000-0003-3840-584X

According to our database1, Nadia El Mrabet authored at least 57 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Montgomery Multiplication Scalable Systolic Designs Optimized for DSP48E2.
ACM Trans. Reconfigurable Technol. Syst., March, 2024

Exploiting ROLLO's constant-time implementations with a single-trace analysis.
Des. Codes Cryptogr., March, 2024

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

2023
PMNS revisited for consistent redundancy and equality test.
IACR Cryptol. ePrint Arch., 2023

2022
SIKE Channels Zero-Value Side-Channel Attacks on SIKE.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2022

Faster Beta Weil Pairing on BLS Pairing Friendly Curves with Odd Embedding Degree.
Math. Comput. Sci., 2022

SIKE Channels.
IACR Cryptol. ePrint Arch., 2022

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

A software comparison of RNS and PMNS.
Proceedings of the 29th IEEE Symposium on Computer Arithmetic, 2022

2021
Two hardware implementations for modular multiplication in the AMNS: Sequential and semi-parallel.
J. Inf. Secur. Appl., 2021

Resistance of Isogeny-Based Cryptographic Implementations to a Fault Attack.
IACR Cryptol. ePrint Arch., 2021

Side-Channel Attack on ROLLO Post-Quantum Cryptographic Scheme.
IACR Cryptol. ePrint Arch., 2021

Special issue from mathematics to embedded devices.
Cryptogr. Commun., 2021

Hardware Implementation of Multiplication over Quartic Extension Fields.
Proceedings of the Seventh International Conference on Mathematics and Computing, 2021

Post-Quantum Cryptography: Challenges and Opportunities for Robust and Secure HW Design.
Proceedings of the 36th IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems, 2021

Hardware Implementations of Pairings at Updated Security Levels.
Proceedings of the Smart Card Research and Advanced Applications, 2021

2020
On the power of template attacks in highly multivariate context.
J. Cryptogr. Eng., 2020

Improving side-channel attacks against pairing-based cryptography.
J. Cryptogr. Eng., 2020

Multiplication over Extension Fields for Pairing-based Cryptography: an Hardware Point of View.
IACR Cryptol. ePrint Arch., 2020

Optimized and Secure Implementation of ROLLO-I.
Proceedings of the Code-Based Cryptography - 8th International Workshop, 2020

2019
Optimized implementation of the NIST PQC submission ROLLO on microcontroller.
IACR Cryptol. ePrint Arch., 2019

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

On the near prime-order MNT curves.
Appl. Algebra Eng. Commun. Comput., 2019

A Practical Use Case of Homomorphic Encryption.
Proceedings of the 2019 International Conference on Cyberworlds, 2019

Delegation of Computation Using FV Cryptosystem.
Proceedings of the Risks and Security of Internet and Systems, 2019

Hardware Optimization on FPGA for the Modular Multiplication in the AMNS Representation.
Proceedings of the Risks and Security of Internet and Systems, 2019

Randomization of Arithmetic Over Polynomial Modular Number System.
Proceedings of the 26th IEEE Symposium on Computer Arithmetic, 2019

2018
Choosing and generating parameters for pairing implementation on BN curves.
Appl. Algebra Eng. Commun. Comput., 2018

2017
A Scalable and Systolic Architectures of Montgomery Modular Multiplication for Public Key Cryptosystems Based on DSPs.
J. Hardw. Syst. Secur., 2017

Resistance of the Point Randomisation Countermeasure for Pairings Against Side-Channel Attack.
Proceedings of the E-Business and Telecommunications - 14th International Joint Conference, 2017

Spectral Approach for Correlation Power Analysis.
Proceedings of the Codes, Cryptology and Information Security, 2017

Contributions à la cryptographie à base de couplage.
, 2017

2016
A Systolic Hardware Architectures of Montgomery Modular Multiplication for Public Key Cryptosystems.
IACR Cryptol. ePrint Arch., 2016

Optimal Ate Pairing on Elliptic Curves with Embedding Degree 9, 15 and 27.
IACR Cryptol. ePrint Arch., 2016

Modeling a node capture attack in a secure wireless sensor networks.
Proceedings of the 3rd IEEE World Forum on Internet of Things, 2016

High-Performance Elliptic Curve Cryptography by Using the CIOS Method for Modular Multiplication.
Proceedings of the Risks and Security of Internet and Systems, 2016

2015
On near prime-order elliptic curves with small embedding degrees.
IACR Cryptol. ePrint Arch., 2015

Choosing and generating parameters for low level pairing implementation on BN curves.
IACR Cryptol. ePrint Arch., 2015

A survey of fault attacks in pairing based cryptography.
Cryptogr. Commun., 2015

Failure of the Point Blinding Countermeasure Against Fault Attack in Pairing-Based Cryptography.
Proceedings of the Codes, Cryptology, and Information Security, 2015

2014
Efficient computation of pairings on Jacobi quartic elliptic curves.
J. Math. Cryptol., 2014

Implementation of faster miller over Barreto-Naehrig curves in Jacobian cordinates.
Proceedings of the Global Summit on Computer & Information Technology, 2014

Practical Validation of Several Fault Attacks against the Miller Algorithm.
Proceedings of the 2014 Workshop on Fault Diagnosis and Tolerance in Cryptography, 2014

2013
Side Channel Attacks against Pairing over Theta Functions.
IACR Cryptol. ePrint Arch., 2013

Efficient Pairings Computation on Jacobi Quartic Elliptic Curves.
IACR Cryptol. ePrint Arch., 2013

Pairings from a tensor product point of view.
CoRR, 2013

2012
Fault Attacks on Pairing-Based Cryptography.
Proceedings of the Fault Analysis in Cryptography, 2012

Efficient Multiplication over Extension Fields.
Proceedings of the Arithmetic of Finite Fields - 4th International Workshop, 2012

2011
Fault Attack against Miller's algorithm.
IACR Cryptol. ePrint Arch., 2011

Fault Attacks against the Miller Algorithm in Hessian Coordinates.
Proceedings of the Information Security and Cryptology - 7th International Conference, 2011

Efficient Multiplication in Finite Field Extensions of Degree 5.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2011, 2011

2010
Fault Attacks against the Miller's Algorithm in Edwards Coordinates.
Proceedings of the Information Security and Assurance - 4th International Conference, 2010

A Variant of Miller's Formula and Algorithm.
Proceedings of the Pairing-Based Cryptography - Pairing 2010, 2010

2009
Arithmétique des couplages, performance et résistance aux attaques par canaux cachés. (Arithmetic of Pairings, Efficiency and Weakness of Pairing Based Cryptography with respect to Side Channel Attacks).
PhD thesis, 2009

A study of pairing computation for elliptic curves with embedding degree 15.
IACR Cryptol. ePrint Arch., 2009

What about Vulnerability to a Fault Attack of the Miller's Algorithm During an Identity Based Protocol?.
Proceedings of the Advances in Information Security and Assurance, 2009

Finite Field Multiplication Combining AMNS and DFT Approach for Pairing Cryptography.
Proceedings of the Information Security and Privacy, 14th Australasian Conference, 2009


  Loading...