Pages that link to "Item:Q4794653"

The following pages link to Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method (Q4794653):

Displayed 29 items.

• Cycle detection algorithms and their applications (Q690565) ‎ (← links)
• Index calculus in the trace zero variety (Q895005) ‎ (← links)
• Computing discrete logarithms in \(\mathbb F_{p^6}\) (Q1746956) ‎ (← links)
• Indiscreet logarithms in finite fields of small characteristic (Q1783724) ‎ (← links)
• Updating key size estimations for pairings (Q2010589) ‎ (← links)
• Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields (Q2096515) ‎ (← links)
• Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment (Q2096516) ‎ (← links)
• Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation (Q2182074) ‎ (← links)
• Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography (Q2512887) ‎ (← links)
• Some mathematical remarks on the polynomial selection in NFS (Q2826687) ‎ (← links)
• The multiple number field sieve for medium- and high-characteristic finite fields (Q2878838) ‎ (← links)
• A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm (Q2958114) ‎ (← 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)
• An experiment of number field sieve for discrete logarithm problem over $\text{GF}(p^n)$ (Q3121357) ‎ (← links)
• The number field sieve for integers of low weight (Q3584792) ‎ (← links)
• The Function Field Sieve in the Medium Prime Case (Q3593100) ‎ (← links)
• ECM on Graphics Cards (Q3627453) ‎ (← links)
• Faster individual discrete logarithms in finite fields of composite extension degree (Q4612570) ‎ (← links)
• Решение систем линейных уравнений при вычислении логарифмов в конечном простом поле (Q4959032) ‎ (← links)
• A new ranking function for polynomial selection in the number field sieve (Q4998643) ‎ (← links)
• A classification of ECM-friendly families of elliptic curves using modular curves (Q5070546) ‎ (← links)
• A Brief History of Pairings (Q5267789) ‎ (← links)
• When e-th Roots Become Easier Than Factoring (Q5387090) ‎ (← links)
• Selecting polynomials for the Function Field Sieve (Q5501157) ‎ (← links)
• Computation of a 768-Bit Prime Field Discrete Logarithm (Q5738876) ‎ (← links)
• A Kilobit Hidden SNFS Discrete Logarithm Computation (Q5738878) ‎ (← links)
• Higher-dimensional sieving for the number field sieve algorithms (Q6165871) ‎ (← links)
• Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation (Q6182003) ‎ (← links)