The following pages link to Cécile Pierrot (Q680943):
Displaying 15 items.
- Malleability of the blockchain's entropy (Q680944) (← links)
- Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity (Q908042) (← links)
- Polynomial time bounded distance decoding near Minkowski's bound in discrete logarithm lattices (Q1999896) (← links)
- Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields (Q2096515) (← links)
- Nearly sparse linear algebra and application to discrete logarithms computations (Q2829802) (← links)
- The multiple number field sieve for medium- and high-characteristic finite fields (Q2878838) (← links)
- Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms (Q2938855) (← links)
- The Multiple Number Field Sieve with Conjugation and Generalized Joux-Lercier Methods (Q2948327) (← links)
- (Q2969790) (← links)
- A Tale of Three Signatures: Practical Attack of ECDSA with wNAF (Q5048983) (← links)
- The Past, Evolving Present, and Future of the Discrete Logarithm (Q5255841) (← links)
- The Special Number Field Sieve in $\mathbb{F}_{p^{n}}$ (Q5746221) (← links)
- Individual discrete logarithm with sublattice reduction (Q6070357) (← links)
- Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation (Q6182003) (← links)
- Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms (Q6584318) (← links)
