Pages that link to "Item:Q5285942"

The following pages link to Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve (Q5285942):

Displaying 44 items.

• Effective compression maps for torus-based cryptography (Q264119) (← links)
• On reducing factorization to the discrete logarithm problem modulo a composite (Q445245) (← links)
• Discrete logarithm problem using index calculus method (Q445390) (← links)
• The generalized Weil pairing and the discrete logarithm problem on elliptic curves (Q596141) (← links)
• Cycle detection algorithms and their applications (Q690565) (← links)
• Index calculus in the trace zero variety (Q895005) (← links)
• Comparing two pairing-based aggregate signature schemes (Q970534) (← links)
• Computation of discrete logarithms in prime fields (Q1179517) (← links)
• Efficient signature generation by smart cards (Q1180508) (← links)
• Elliptic curve implementation of zero-knowledge blobs (Q1180510) (← links)
• User impersonation in key certification schemes (Q1312103) (← links)
• A random number generator based on elliptic curve operations (Q1433102) (← links)
• Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields (Q1620973) (← links)
• Bootstrapping for approximate homomorphic encryption (Q1648805) (← links)
• Birthday type attacks to the Naccache-Stern knapsack cryptosystem (Q1653036) (← links)
• Computing discrete logarithms in \(\mathbb F_{p^6}\) (Q1746956) (← links)
• Indiscreet logarithms in finite fields of small characteristic (Q1783724) (← links)
• Function field sieve method for discrete logarithms over finite fields (Q1854276) (← links)
• Updating key size estimations for pairings (Q2010589) (← links)
• Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields (Q2096515) (← links)
• New discrete logarithm computation for the medium prime case using the function field sieve (Q2158232) (← links)
• Anonymous single-sign-on for \(n\) designated services with traceability (Q2167743) (← links)
• Refined analysis to the extended tower number field sieve (Q2304549) (← links)
• An \(L(1/3)\) discrete logarithm algorithm for low degree curves (Q2429709) (← links)
• Elliptic curve cryptography: the serpentine course of a paradigm shift (Q2430981) (← links)
• On the signature calculus for finite fields of order square of prime numbers (Q2436760) (← links)
• Secure distributed constraint satisfaction: reaching agreement without revealing private information (Q2457708) (← links)
• Speeding up exponentiation using an untrusted computational resource (Q2491304) (← links)
• Subexponential time relations in the class group of large degree number fields (Q2513760) (← links)
• Special prime numbers and discrete logs in finite prime fields (Q2759106) (← links)
• Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case (Q2835600) (← links)
• Traps to the BGJT-algorithm for discrete logarithms (Q2878837) (← links)
• Subexponential class group and unit group computation in large degree number fields (Q2878849) (← 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)
• Ephemeral key recovery using index calculus method (Q3062048) (← links)
• Quantum algorithms for algebraic problems (Q3077033) (← links)
• Performance analysis of index calculus method (Q3561529) (← links)
• Factor-4 and 6 compression of cyclotomic subgroups of and (Q3580730) (← links)
• The Function Field Sieve in the Medium Prime Case (Q3593100) (← links)
• Faster individual discrete logarithms in finite fields of composite extension degree (Q4612570) (← links)
• Решение систем линейных уравнений при вычислении логарифмов в конечном простом поле (Q4959032) (← links)
• Fast hashing to \(\mathbb{G}_2\) on pairing-friendly curves with the lack of twists (Q6136710) (← links)