Pages that link to "Item:Q908042"

The following pages link to Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity (Q908042):

Displayed 5 items.

• Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields (Q1620973) ‎ (← links)
• Still wrong use of pairings in cryptography (Q2335138) ‎ (← links)
• On Constructing Parameterized Families of Pairing-Friendly Elliptic Curves with $$\rho =1$$ (Q2980869) ‎ (← links)
• The Complexity of Public-Key Cryptography (Q5021130) ‎ (← links)
• ON BOUNDS FOR BALANCED EMBEDDING DEGREE (Q5150737) ‎ (← links)