Discrete logarithms and local units
From MaRDI portal
Publication:4287024
DOI10.1098/rsta.1993.0139zbMath0795.11063OpenAlexW2020929171MaRDI QIDQ4287024
Publication date: 20 September 1994
Published in: Philosophical Transactions of the Royal Society of London. Series A: Physical and Engineering Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1098/rsta.1993.0139
Units and factorization (11R27) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40) Factorization (11Y05)
Related Items
Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields ⋮ Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method ⋮ A hidden number problem in small subgroups ⋮ Algorithms in Algebraic Number Theory ⋮ Higher-dimensional sieving for the number field sieve algorithms ⋮ Cyclic extensions of prime degree and their \(p\)-adic regulators ⋮ Solving discrete logarithms on a 170-bit MNT curve by pairing reduction ⋮ Numerical verification of the Cohen-Lenstra-Martinet heuristics and of Greenberg's \(p\)-rationality conjecture ⋮ Collecting relations for the number field sieve in ⋮ On the signature calculus for finite fields of order square of prime numbers ⋮ Faster individual discrete logarithms in finite fields of composite extension degree ⋮ When e-th Roots Become Easier Than Factoring ⋮ An Experiment of Number Field Sieve over GF(p) of Low Hamming Weight Characteristic ⋮ Computing discrete logarithms in \(\mathbb F_{p^6}\) ⋮ Special prime numbers and discrete logs in finite prime fields ⋮ Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree ⋮ A Kilobit Hidden SNFS Discrete Logarithm Computation ⋮ Comparing two pairing-based aggregate signature schemes ⋮ The number field sieve for integers of low weight ⋮ Updating key size estimations for pairings ⋮ The Function Field Sieve in the Medium Prime Case ⋮ Indiscreet logarithms in finite fields of small characteristic ⋮ Lattice sieving in three dimensions for discrete log in medium characteristic ⋮ Using number fields to compute logarithms in finite fields ⋮ Refined analysis to the extended tower number field sieve ⋮ Some mathematical remarks on the polynomial selection in NFS ⋮ Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case ⋮ Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment ⋮ Function field sieve method for discrete logarithms over finite fields
