 
    Nadia El Mrabet
                                    50 
                                    
                            Documents
                                Présentation
Je travaille en cryptographie à base de courbes elliptiques.
J'étudie les implémentations efficaces et sécurisées vis à vis des attaques par canaux cachés.
Publications
                    
                    
                    5
                
                            
                    
                    
                    4
                
                            
                    
                    
                    3
                
                            
                    
                    
                    3
                
                            
                    
                    
                    3
                
                            
                    
                    
                    3
                
                            
                    
                    
                    3
                
                            
                    
                    
                    3
                
                            
                    
                    
                    3
                
                            
                    
                    
                    3
                
                            
                    
                    
                    3
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                    
                    
                    
                    6
                
                            
                    
                    
                    6
                
                            
                    
                    
                    5
                
                            
                    
                    
                    5
                
                            
                    
                    
                    5
                
                            
                    
                    
                    4
                
                            
                    
                    
                    4
                
                            
                    
                    
                    4
                
                            
                    
                    
                    3
                
                            
                    
                    
                    3
                
                            
                    
                    
                    3
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    2
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                    
                    
                    
                    3
                
                            
                    
                    
                    2
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                    
                    
                    
                    7
                
                            
                    
                    
                    5
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                            
                    
                    
                    1
                
                    
                    
                    
                    1
                
                    Publications
|  | PMNS arithmetic for elliptic curve cryptography16th International Conference on Cryptology, Africacrypt 2025, Jul 2025, Rabat, Morocco. pp.164-191, ⟨10.1007/978-3-031-97260-7_9⟩Communication dans un congrès
                    
        
        
            
                
                    hal-05061324
                                            v1 | 
| Multiplication de Montgomery tronquée et exponentiations modulaires en lot utilisant l'instruction VPMADD52RAIM 2024, GDR-IFM GT arith; DALI/LIRMM, Nov 2024, Perpignan, FranceCommunication dans un congrès
                    
        
        
            
                
                    hal-04830547
                                            v1 | |
|  | Post-Quantum Cryptography: Challenges and Opportunities for Robust and Secure HW Design34th IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems, Oct 2021, Athènes, Greece. pp.10.1109/DFT52944.2021.9568301, ⟨10.1109/DFT52944.2021.9568301⟩Communication dans un congrès
                    
        
        
            
                
                    cea-03452245
                                            v1 | 
|  | Randomization of Arithmetic over Polynomial Modular Number System26th IEEE International Symposium on Computer Arithmetic, Jun 2019, Kyoto, Japan. pp.199-206, ⟨10.1109/ARITH.2019.00048⟩Communication dans un congrès
                    
        
        
            
                
                    hal-02099713
                                            v1 | 
| An efficient and scalable modular inversion/division for public key cryptosystems2017 International Conference on Engineering & MIS (ICEMIS), May 2017, Monastir, France. pp.1-6, ⟨10.1109/ICEMIS.2017.8272995⟩Communication dans un congrès
                    
        
        
            
                
                    hal-02066982
                                            v1 | |
| Spectral approach for correlation power analysisSecond International Conference on Codes, Cryptology and Information Security, C2SI 2017, Apr 2017, Rabbat, Morocco. pp.238-253, ⟨10.1007/978-3-319-55589-8_16⟩Communication dans un congrès
                    
        
        
            
                
                    hal-01652010
                                            v1 | |
| Modeling a node capture attack in a secure wireless sensor networks2016 IEEE 3rd World Forum on Internet of Things (WF-IoT), Dec 2016, Reston, France. pp.188-193, ⟨10.1109/WF-IoT.2016.7845447⟩Communication dans un congrès
                    
        
        
            
                
                    hal-02066983
                                            v1 | |
|  | Practical validation of several fault attacks against the Miller algorithmFault Diagnosis and Tolerance in Cryptography (FDTC), 2014 Workshop on, Sep 2014, Busan, South Korea. ⟨10.1109/FDTC.2014.21⟩Communication dans un congrès
                    
        
        
            
                
                    hal-01100813
                                            v1 | 
|  | Side Channel Attacks against Pairing over Theta FunctionsCAI: Conference on Algebraic Informatics, Sep 2013, Porquerolles, France. pp.132-146, ⟨10.1007/978-3-642-40663-8_14⟩Communication dans un congrès
                    
        
        
            
                
                    hal-01197175
                                            v1 | 
|  | Efficient Multiplication over Extension FieldsWAIFI 2012, Jul 2012, Ghent, Belgium. ⟨10.1007/978-3-642-31662-3_10⟩Communication dans un congrès
                    
        
        
            
                
                    hal-01197178
                                            v1 | 
| Efficient multiplication in finite field extensions of degree 5AFRICACRYPT 2011 - 4th International Conference on Cryptology, Jul 2011, Dakar, Senegal. pp.188-205, ⟨10.1007/978-3-642-21969-6_12⟩Communication dans un congrès
                    
                    istex
        
        
            
                
                    inria-00609920
                                            v1 | |
|  | Fault attacks against the Miller algorithm in Edwards Coordinates4th International Conference on Information Security and Assurance, ISA 2010, Jun 2010, Miyazaki, Japan. pp.72-85, ⟨10.1007/978-3-642-13365-7_8⟩Communication dans un congrès
                    
        
        
            
                
                    hal-01083374
                                            v1 | 
|  | A Variant of Miller’s Formula and AlgorithmProceedings of Pairing 2010, Dec 2010, Ishikawa, Japan. pp.417 - 434, ⟨10.1007/978-3-642-17455-1_26⟩Communication dans un congrès
                    
        
        
            
                
                    hal-01083368
                                            v1 | 
|  | What about Vulnerability to a Fault Attack of the Miller Algorithm during an Identity Based Protocol?ISA'09: The 3rd International Conference on Information and Assurance, Jun 2009, Séoul, South Korea. pp.122-134Communication dans un congrès
                    
        
        
            
                
                    lirmm-00387057
                                            v1 | 
|  | Pairing in Cryptography: an Arithmetic Point of ViewAdvanced Signal Processing Algorithms, Architectures, and Implementations XVII, Aug 2007, San Diego, California, United States. ⟨10.1117/12.733789⟩Communication dans un congrès
                    
        
        
            
                
                    lirmm-00181362
                                            v1 | 
|  | Special issue from mathematics to embedded devices13 (4), pp.475-477, 2021, ⟨10.1007/s12095-021-00502-1⟩Ouvrages
                    
        
        
            
                
                    hal-03424622
                                            v1 | 
| Guide to pairing based cryptographyCRC Press, 2017, 9781498729505Ouvrages
                    
        
        
            
                
                    hal-01579628
                                            v1 | 
|  | New Versions of Miller-loop Secured against Side-Channel AttacksArithmetic of Finite Fields, 13638, Springer International Publishing, pp.269-287, 2023, Lecture Notes in Computer Science, ⟨10.1007/978-3-031-22944-2_17⟩Chapitre d'ouvrage
                    
        
        
            
                
                    hal-03934165
                                            v1 | 
| Hardware Optimization on FPGA for the Modular Multiplication in the AMNS RepresentationRisks and Security of Internet and Systems, 12026, Springer International Publishing, pp.113-127, 2020, Lecture Notes in Computer Science, ⟨10.1007/978-3-030-41568-6_8⟩Chapitre d'ouvrage
                    
        
        
            
                
                    hal-03484214
                                            v1 | |
|  | Optimized and Secure Implementation of ROLLO-ICode-Based Cryptography Workshop, pp.117-137, 2020, ⟨10.1007/978-3-030-54074-6_7⟩Chapitre d'ouvrage
                    
        
        
            
                
                    hal-02929835
                                            v1 | 
| Resistance of the Point Randomisation Countermeasure for Pairings Against Side-Channel AttackObaidat, M.; Cabello, E. ICETE 2017: E-Business and Telecommunications, Springer, pp.150-172, 2019, ⟨10.1007/978-3-030-11039-0_8⟩Chapitre d'ouvrage
                    
        
        
            
                
                    hal-02066989
                                            v1 | |
| Physical attacksGuide to pairing based cryptography, 2017, 9781498729505Chapitre d'ouvrage
                    
        
        
            
                
                    hal-01579785
                                            v1 | |
| Mathematical backgroundGuide to pairing based cryptography, 2017, 9781498729505Chapitre d'ouvrage
                    
        
        
            
                
                    hal-01579664
                                            v1 | |
|  | High-Performance Elliptic Curve Cryptography by Using the CIOS Method for Modular MultiplicationCRiSIS 2016: Risks and Security of Internet and Systems, pp.185-198, 2017, ⟨10.1007/978-3-319-54876-0_15⟩Chapitre d'ouvrage
                    
        
        
            
                
                    hal-02066985
                                            v1 | 
| Choosing parametersNadia El Mrabet; Marc Joye. Guide to pairing based cryptography, CRC Press, 2016, Chapman & Hall/CRC Cryptography and Network Security, 9781498729505Chapitre d'ouvrage
                    
        
        
            
                
                    hal-01579710
                                            v1 | |
| A Scalable and Systolic Architectures of Montgomery Modular Multiplication for Public Key Cryptosystems Based on DSPsSPACE 2016: Security, Privacy, and Applied Cryptography Engineering, pp.138-156, 2016, ⟨10.1007/978-3-319-49445-6_8⟩Chapitre d'ouvrage
                    
        
        
            
                
                    hal-02066984
                                            v1 | |
| Arithmetic of Finite FieldsNadia El Mrabet; Marc Joye. Guide to pairing based cryptography, Chapman and Hall/CRC, 2016, Chapman & Hall/CRC Cryptography and network Security Series, 9781498729505Chapitre d'ouvrage
                    
        
        
            
                
                    hal-01579661
                                            v1 | |
| Fault Attacks on Pairing-Based CryptographyFault Analysis in Cryptography, 2012, ⟨10.1007/978-3-642-29656-7_13⟩Chapitre d'ouvrage
                    
        
        
            
                
                    hal-01197167
                                            v1 | 
|  | A survey of Fault Attacks in Pairing Based CryptographyAutre publication scientifique hal-01197172 v1 | 
|  | Harmonic Analysis and a Bentness-Like Notion in Certain Finite Abelian Groups Over Some Finite Fields2015Autre publication scientifique
                    
        
        
            
                
                    hal-01197141
                                            v1 | 
|  | Failure of the Point Blinding Countermeasure Against Fault Attack in Pairing-Based CryptographyAutre publication scientifique hal-01197148 v1 | 
|  | On Near Prime-Order Elliptic Curves with Small Embedding DegreesAutre publication scientifique hal-01197193 v1 | 
|  | A taxonomy of pairings, their security, their complexity2020Pré-publication, Document de travail
                    
        
        
            
                
                    hal-02129868
                                            v2 | 
|  | Pairings from a tensor product point of view2013Pré-publication, Document de travail
                    
        
        
            
                
                    hal-00816318
                                            v2 | 
|  | Fault Attack against Miller's algorithm2010Pré-publication, Document de travail
                    
        
        
            
                
                    hal-00655465
                                            v1 | 
|  | Finite field multiplication combining AMNS and DFT approach for pairing cryptography2009Pré-publication, Document de travail
                    
        
        
            
                
                    hal-00360280
                                            v1 | 
|  | Pairing Computation for Elliptic Curves with Embedding Degree 15RR-09012, 2009, pp.14Rapport
                    
        
        
            
                
                    lirmm-00380549
                                            v1 | 
|  | Differential Power Analysis against the Miller AlgorithmRR-08021, 2008Rapport
                    
        
        
            
                
                    lirmm-00323684
                                            v1 | 
|  | What about vulnerability to a fault attack of the Miller algorithm during an Identity Based Protocol ?RR-08022, 2008Rapport
                    
        
        
            
                
                    lirmm-00323685
                                            v1 | 
|  | Arithmétique des couplages, performance et résistance aux attaques par canaux cachés.Informatique [cs]. Université Montpellier II - Sciences et Techniques du Languedoc, 2009. Français. ⟨NNT : ⟩Thèse
                    
        
        
            
                
                    tel-00450099
                                            v1 | 
|  | Contributions à la cryptographie à base de couplage.Cryptographie et sécurité [cs.CR]. Université Paris 8 Vincennes – Saint-Denis, 2017HDR
                    
        
        
            
                
                    tel-01716835
                                            v1 | 
                Chargement...
            
            Chargement...