The following pages link to (Q3840165):
Displaying 10 items.
- (EC)DSA lattice attacks based on Coppersmith's method (Q280950) (← links)
- Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity (Q908042) (← links)
- Birthday type attacks to the Naccache-Stern knapsack cryptosystem (Q1653036) (← links)
- Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields (Q2096515) (← links)
- On the enumeration of polynomials with prescribed factorization pattern (Q2135566) (← links)
- Faster initial splitting for small characteristic composite extension degree fields (Q2302583) (← links)
- Smoothness testing of polynomials over finite fields (Q2513763) (← links)
- The Function Field Sieve in the Medium Prime Case (Q3593100) (← links)
- Smooth ideals in hyperelliptic function fields (Q4529714) (← links)
- Square-free smooth polynomials in residue classes and generators of irreducible polynomials (Q5060346) (← links)
