Pages that link to "Item:Q4911577"
From MaRDI portal
The following pages link to Breaking Pairing-Based Cryptosystems Using η T Pairing over GF(397) (Q4911577):
Displaying 10 items.
- Effective compression maps for torus-based cryptography (Q264119) (← links)
- Solving discrete logarithms on a 170-bit MNT curve by pairing reduction (Q1698673) (← links)
- Indiscreet logarithms in finite fields of small characteristic (Q1783724) (← links)
- Updating key size estimations for pairings (Q2010589) (← links)
- Heuristics of the Cocks-Pinch method (Q2437964) (← links)
- Key Length Estimation of Pairing-Based Cryptosystems Using η T Pairing (Q2894363) (← links)
- Accelerating Iterative SpMV for the Discrete Logarithm Problem Using GPUs (Q2949470) (← links)
- On Constructing Parameterized Families of Pairing-Friendly Elliptic Curves with $$\rho =1$$ (Q2980869) (← links)
- An experiment of number field sieve for discrete logarithm problem over $\text{GF}(p^n)$ (Q3121357) (← links)
- Selecting polynomials for the Function Field Sieve (Q5501157) (← links)