Discrete logarithms and local units
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 475430
- scientific article; zbMATH DE number 475432
- scientific article; zbMATH DE number 5532108
- Public Key Cryptography - PKC 2006
- Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
Cited in
(36)- Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields
- Solving discrete logarithms on a 170-bit MNT curve by pairing reduction
- Computing discrete logarithms in \(\mathbb F_{p^6}\)
- Indiscreet logarithms in finite fields of small characteristic
- Function field sieve method for discrete logarithms over finite fields
- Updating key size estimations for pairings
- Lattice sieving in three dimensions for discrete log in medium characteristic
- Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
- Numerical verification of the Cohen-Lenstra-Martinet heuristics and of Greenberg's \(p\)-rationality conjecture
- Refined analysis to the extended tower number field sieve
- On the signature calculus for finite fields of order square of prime numbers
- Special prime numbers and discrete logs in finite prime fields
- scientific article; zbMATH DE number 1722682 (Why is no real title available?)
- Some mathematical remarks on the polynomial selection in NFS
- Extended tower number field sieve: a new complexity for the medium prime case
- Collecting relations for the number field sieve in \(\text{GF}(p^6)\)
- An experiment of number field sieve over \(\mathrm{GF}(p)\) of low Hamming weight characteristic
- The number field sieve for integers of low weight
- The Function Field Sieve in the Medium Prime Case
- Algorithms in Algebraic Number Theory
- Faster individual discrete logarithms in finite fields of composite extension degree
- Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
- Using number fields to compute logarithms in finite fields
- A hidden number problem in small subgroups
- When e-th Roots Become Easier Than Factoring
- Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree
- A Kilobit Hidden SNFS Discrete Logarithm Computation
- Higher-dimensional sieving for the number field sieve algorithms
- Cyclic extensions of prime degree and their p-adic regulators
- A note on public key cryptography based on Williams-Guy functions
- On the complexity formulae of the number field sieve and its variants
- Utilizing two subfields to accelerate individual logarithm computation in extended tower number field sieve
- On Approx-SVP in multiquadratic ideal lattices
- Revisiting pairing-friendly curves with embedding degrees 10 and 14
- On the alpha value of polynomials in the tower number field sieve algorithm
- Comparing two pairing-based aggregate signature schemes
This page was built for publication: Discrete logarithms and local units
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4287024)
