Pages that link to "Item:Q5862178"

The following pages link to Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic (Q5862178):

Displaying 7 items.

• Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields (Q2096515) (← links)
• Dynamic universal accumulator with batch update over bilinear groups (Q2152172) (← links)
• Tensors in computations (Q5887832) (← links)
• Lattice packings of cross‐polytopes from Reed–Solomon codes and Sidon sets (Q6051405) (← links)
• A survey of elliptic curves for proof systems (Q6063127) (← links)
• Individual discrete logarithm with sublattice reduction (Q6070357) (← links)
• Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation (Q6182003) (← links)