Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
From MaRDI portal
Publication:5285942
DOI10.1137/0406010zbMath0772.11046OpenAlexW1969728959WikidataQ93247700 ScholiaQ93247700MaRDI QIDQ5285942
Publication date: 29 June 1993
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0406010
Related Items (55)
Effective compression maps for torus-based cryptography ⋮ 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 ⋮ Number of rational points of elliptic curves ⋮ Bootstrapping for approximate homomorphic encryption ⋮ Birthday type attacks to the Naccache-Stern knapsack cryptosystem ⋮ New discrete logarithm computation for the medium prime case using the function field sieve ⋮ Algorithms in Algebraic Number Theory ⋮ Anonymous single-sign-on for \(n\) designated services with traceability ⋮ The generalized Weil pairing and the discrete logarithm problem on elliptic curves ⋮ Index calculus in the trace zero variety ⋮ A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm ⋮ Fast hashing to \(\mathbb{G}_2\) on pairing-friendly curves with the lack of twists ⋮ An \(L(1/3)\) discrete logarithm algorithm for low degree curves ⋮ Elliptic curve cryptography: the serpentine course of a paradigm shift ⋮ Collecting relations for the number field sieve in ⋮ On the signature calculus for finite fields of order square of prime numbers ⋮ On reducing factorization to the discrete logarithm problem modulo a composite ⋮ Discrete logarithm problem using index calculus method ⋮ Faster individual discrete logarithms in finite fields of composite extension degree ⋮ A random number generator based on elliptic curve operations ⋮ Computation of discrete logarithms in prime fields ⋮ Efficient signature generation by smart cards ⋮ Elliptic curve implementation of zero-knowledge blobs ⋮ Secure distributed constraint satisfaction: reaching agreement without revealing private information ⋮ An Experiment of Number Field Sieve over GF(p) of Low Hamming Weight Characteristic ⋮ Performance analysis of index calculus method ⋮ Computing discrete logarithms in \(\mathbb F_{p^6}\) ⋮ On the cubic sieve method for computing discrete logarithms over prime fields ⋮ Cycle detection algorithms and their applications ⋮ Special prime numbers and discrete logs in finite prime fields ⋮ Algebraic curves and cryptography ⋮ An optimal distributed discrete log protocol with applications to homomorphic secret sharing ⋮ Factor-4 and 6 compression of cyclotomic subgroups of and ⋮ Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree ⋮ Computation of a 768-Bit Prime Field Discrete Logarithm ⋮ A Kilobit Hidden SNFS Discrete Logarithm Computation ⋮ Comparing two pairing-based aggregate signature schemes ⋮ Updating key size estimations for pairings ⋮ Speeding up exponentiation using an untrusted computational resource ⋮ The Function Field Sieve in the Medium Prime Case ⋮ Indiscreet logarithms in finite fields of small characteristic ⋮ Ephemeral key recovery using index calculus method ⋮ Using number fields to compute logarithms in finite fields ⋮ Subexponential time relations in the class group of large degree number fields ⋮ Решение систем линейных уравнений при вычислении логарифмов в конечном простом поле ⋮ Quantum algorithms for algebraic problems ⋮ Refined analysis to the extended tower number field sieve ⋮ Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case ⋮ Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields ⋮ Function field sieve method for discrete logarithms over finite fields ⋮ User impersonation in key certification schemes ⋮ Computing discrete logarithms in real quadratic congruence function fields of large genus ⋮ Traps to the BGJT-algorithm for discrete logarithms ⋮ Subexponential class group and unit group computation in large degree number fields
This page was built for publication: Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
