Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms - Simplified Setting for Small Characteristic Finite Fields
Antoine Joux
,
Cécile Pierrot
20th International Conference on the Theory and Application of Cryptology and Information Security , Dec 2014, Kaoshiung, Taiwan. pp.378-397,
⟨10.1007/978-3-662-45611-8_20⟩
Communication dans un congrès
hal-01213649v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Deciphering Charles Quint (A diplomatic letter from 1547)
Cécile Pierrot
,
Camille Desenclos
,
Pierrick Gaudry
,
Paul Zimmermann
6th International Conference on Historical Cryptology, HistoCrypt , Jun 2023, Munich, Germany. pp.148-158,
⟨10.3384/ecp195704⟩
Communication dans un congrès
hal-04083014v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Individual Discrete Logarithm with Sublattice Reduction
Haetham Al Aswad
,
Cécile Pierrot
Article dans une revue
hal-03737874v2
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
De la nécessité des problèmes que l’on ne sait pas résoudre
Cécile Pierrot
2019
Autre publication scientifique
hal-03213156v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Malleability of the blockchain's entropy
Cécile Pierrot
,
Benjamin Wesolowski
ArcticCrypt 2016 , Jul 2016, Longyearbyen, Norway
Communication dans un congrès
hal-01364045v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
The Multiple Number Field Sieve with Conjugation and Generalized Joux-Lercier Methods
Cécile Pierrot
Communication dans un congrès
hal-01056205v2
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Lattice Enumeration for Tower NFS: a 521-bit Discrete Logarithm Computation
Gabrielle de Micheli
,
Pierrick Gaudry
,
Cécile Pierrot
ASIACRYPT 2021 - 27th Annual International Conference on the Theory and Application of Cryptology and Information Security , Dec 2021, Virtual, Singapore. pp.67-96,
⟨10.1007/978-3-030-92062-3_3⟩
Communication dans un congrès
hal-03242324v2
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Technical history of discrete logarithms in small characteristic finite fields : The road from subexponential to quasi-polynomial complexity
Antoine Joux
,
Cécile Pierrot
Article dans une revue
hal-01243676v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
The Special Number Field Sieve in $\F _{p^{n}}$, Application to Pairing-Friendly Constructions
Antoine Joux
,
Cécile Pierrot
Communication dans un congrès
hal-01213666v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
The Multiple Number Field Sieve for Medium and High Characteristic Finite Fields
Razvan Barbulescu
,
Cécile Pierrot
Article dans une revue
hal-00952610v2
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
A Tale of Three Signatures: practical attack of ECDSA with wNAF
Gabrielle de Micheli
,
Rémi E. Piau
,
Cécile Pierrot
Communication dans un congrès
hal-02393302v2
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Nearly Sparse Linear Algebra and application to Discrete Logarithms Computations
Antoine Joux
,
Cécile Pierrot
Chapitre d'ouvrage
hal-01154879v2
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Polynomial Time Bounded Distance Decoding near Minkowski's Bound in Discrete Logarithm Lattices
Léo Ducas
,
Cécile Pierrot
Article dans une revue
hal-01891713v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms
Antoine Joux
,
Cécile Pierrot
Article dans une revue
hal-02173688v2
Actions
Partager
Gmail
Facebook
X
LinkedIn
More
Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields
Gabrielle de Micheli
,
Pierrick Gaudry
,
Cécile Pierrot
CRYPTO 2020 - 40th Annual International Cryptology Conference , Aug 2020, Santa Barbara / Virtual, United States. pp.32-61,
⟨10.1007/978-3-030-56880-1_2⟩
Communication dans un congrès
hal-02871839v1
Actions
Partager
Gmail
Facebook
X
LinkedIn
More