Discrete Logarithms in GF ( P ) Using the Number Field Sieve
From MaRDI portal
Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
Recommendations
Cited in
(80)- Discrete logarithms in \(\mathrm{GF}(p)\)
- Computation of discrete logarithms in prime fields
- Efficient signature generation by smart cards
- Elliptic curve implementation of zero-knowledge blobs
- User impersonation in key certification schemes
- A random number generator based on elliptic curve operations
- Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields
- Bootstrapping for approximate homomorphic encryption
- Birthday type attacks to the Naccache-Stern knapsack cryptosystem
- 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
- Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields
- New discrete logarithm computation for the medium prime case using the function field sieve
- Anonymous single-sign-on for \(n\) designated services with traceability
- Refined analysis to the extended tower number field sieve
- Solving discrete logarithm problems faster with the aid of pre-computation
- An \(L(1/3)\) discrete logarithm algorithm for low degree curves
- Elliptic curve cryptography: the serpentine course of a paradigm shift
- On the signature calculus for finite fields of order square of prime numbers
- Secure distributed constraint satisfaction: reaching agreement without revealing private information
- Speeding up exponentiation using an untrusted computational resource
- Subexponential time relations in the class group of large degree number fields
- Effective compression maps for torus-based cryptography
- scientific article; zbMATH DE number 1676635 (Why is no real title available?)
- Special prime numbers and discrete logs in finite prime fields
- Extended tower number field sieve: a new complexity for the medium prime case
- Traps to the BGJT-algorithm for discrete logarithms
- Subexponential class group and unit group computation in large degree number fields
- A general polynomial selection method and new asymptotic complexities for the tower number field sieve algorithm
- 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
- Ephemeral key recovery using index calculus method
- Construction of logarithm tables for Galois fields
- Quantum algorithms for algebraic problems
- Performance analysis of index calculus method
- Factor-4 and 6 compression of cyclotomic subgroups of \(\mathbb F^*_{2^{4m}}\) and \(\mathbb F^*_{3^{6m}}\)
- The Function Field Sieve in the Medium Prime Case
- scientific article; zbMATH DE number 5532108 (Why is no real title available?)
- Fast Computation of Discrete Logarithms in GF (q)
- scientific article; zbMATH DE number 4077312 (Why is no real title available?)
- Algorithms in Algebraic Number Theory
- Computing discrete logarithms in real quadratic congruence function fields of large genus
- scientific article; zbMATH DE number 1303121 (Why is no real title available?)
- scientific article; zbMATH DE number 475430 (Why is no real title available?)
- scientific article; zbMATH DE number 611186 (Why is no real title available?)
- scientific article; zbMATH DE number 708800 (Why is no real title available?)
- scientific article; zbMATH DE number 708805 (Why is no real title available?)
- scientific article; zbMATH DE number 1113854 (Why is no real title available?)
- On reducing factorization to the discrete logarithm problem modulo a composite
- Discrete logarithm problem using index calculus method
- scientific article; zbMATH DE number 1522937 (Why is no real title available?)
- Faster individual discrete logarithms in finite fields of composite extension degree
- The Special Function Field Sieve
- Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
- On asymptotic complexity of computing discrete logarithms over GF(p)
- scientific article; zbMATH DE number 799769 (Why is no real title available?)
- Using number fields to compute logarithms in finite fields
- Solving systems of linear equations arising in the computation of logarithms in a finite prime field
- Number of rational points of elliptic curves
- On the cubic sieve method for computing discrete logarithms over prime fields
- 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
- Public Key Cryptography - PKC 2006
- An optimal distributed discrete log protocol with applications to homomorphic secret sharing
- Algebraic curves and cryptography
- The generalized Weil pairing and the discrete logarithm problem on elliptic curves
- Fast hashing to \(\mathbb{G}_2\) on pairing-friendly curves with the lack of twists
- Cryptanalysis of algebraic verifiable delay functions
- On the classical hardness of the semidirect discrete logarithm problem in finite groups
- On the complexity formulae of the number field sieve and its variants
- Cycle detection algorithms and their applications
- Utilizing two subfields to accelerate individual logarithm computation in extended tower number field sieve
- First-degree prime ideals of composite extensions
- The structured generic-group model
- Discrete logarithm factory
- Index calculus in the trace zero variety
- Comparing two pairing-based aggregate signature schemes
This page was built for publication: Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5285942)
