Pages that link to "Item:Q4287024"
From MaRDI portal
The following pages link to Discrete logarithms and local units (Q4287024):
Displaying 30 items.
- Comparing two pairing-based aggregate signature schemes (Q970534) (← links)
- Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields (Q1620973) (← links)
- Solving discrete logarithms on a 170-bit MNT curve by pairing reduction (Q1698673) (← links)
- Computing discrete logarithms in \(\mathbb F_{p^6}\) (Q1746956) (← links)
- Indiscreet logarithms in finite fields of small characteristic (Q1783724) (← links)
- Function field sieve method for discrete logarithms over finite fields (Q1854276) (← links)
- Updating key size estimations for pairings (Q2010589) (← links)
- Lattice sieving in three dimensions for discrete log in medium characteristic (Q2033517) (← links)
- Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment (Q2096516) (← links)
- Numerical verification of the Cohen-Lenstra-Martinet heuristics and of Greenberg's \(p\)-rationality conjecture (Q2199677) (← links)
- Refined analysis to the extended tower number field sieve (Q2304549) (← links)
- On the signature calculus for finite fields of order square of prime numbers (Q2436760) (← links)
- Special prime numbers and discrete logs in finite prime fields (Q2759106) (← links)
- Some mathematical remarks on the polynomial selection in NFS (Q2826687) (← links)
- Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case (Q2835600) (← links)
- Collecting relations for the number field sieve in (Q2971019) (← links)
- An Experiment of Number Field Sieve over GF(p) of Low Hamming Weight Characteristic (Q3005589) (← links)
- The number field sieve for integers of low weight (Q3584792) (← links)
- The Function Field Sieve in the Medium Prime Case (Q3593100) (← links)
- Algorithms in Algebraic Number Theory (Q4005808) (← links)
- Faster individual discrete logarithms in finite fields of composite extension degree (Q4612570) (← links)
- Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method (Q4794653) (← links)
- Using number fields to compute logarithms in finite fields (Q4955874) (← links)
- A hidden number problem in small subgroups (Q5315437) (← links)
- When e-th Roots Become Easier Than Factoring (Q5387090) (← links)
- Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree (Q5738795) (← links)
- A Kilobit Hidden SNFS Discrete Logarithm Computation (Q5738878) (← links)
- Higher-dimensional sieving for the number field sieve algorithms (Q6165871) (← links)
- Cyclic extensions of prime degree and their \(p\)-adic regulators (Q6165873) (← links)
- A note on public key cryptography based on Williams-Guy functions (Q6546689) (← links)
