Pages that link to "Item:Q3216753"

The following pages link to Fast evaluation of logarithms in fields of characteristic two (Q3216753):

Displaying 50 items.

• Cryptographic properties of the hidden weighted bit function (Q400509) (← links)
• Accelerating Pollard's rho algorithm on finite fields (Q431795) (← links)
• The generalized Weil pairing and the discrete logarithm problem on elliptic curves (Q596141) (← links)
• Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm (Q697496) (← links)
• A generalization of the Hansen-Mullen conjecture on irreducible polynomials over finite fields (Q765803) (← links)
• A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point (Q850776) (← links)
• Index calculus in the trace zero variety (Q895005) (← links)
• Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity (Q908042) (← links)
• On the number of polynomials over \(\mathrm{GF}(2)\) that factor into \(2, 3\) or \(4\) prime polynomials (Q1071058) (← links)
• An application of factoring (Q1081302) (← links)
• Discrete logarithms in \(\mathrm{GF}(p)\) (Q1094455) (← links)
• A key distribution system equivalent to factoring (Q1112781) (← links)
• Some soluble cases of the discrete logarithm problem (Q1115897) (← links)
• Computation of discrete logarithms in prime fields (Q1179517) (← links)
• Computational problems in the theory of finite fields (Q1180998) (← links)
• A note on cyclic groups, finite fields, and the discrete logarithm problem (Q1196516) (← links)
• Cryptography and elliptic curves (Q1267725) (← links)
• Elliptic curve cryptosystems and their implementation (Q1312102) (← links)
• Batch RSA (Q1363068) (← links)
• Smoothness test for polynomials defined over small characteristic finite fields (Q1616168) (← links)
• Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields (Q1620973) (← links)
• Indiscreet logarithms in finite fields of small characteristic (Q1783724) (← links)
• A serial version of the Pohlig-Hellman algorithm for computing discrete logarithms (Q1803561) (← links)
• Function field sieve method for discrete logarithms over finite fields (Q1854276) (← links)
• Complexity of a determinate algorithm for the discrete logarithm (Q1898267) (← links)
• Mathematical problems in cryptology (Q1910812) (← 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)
• A taxonomy of pairing-friendly elliptic curves (Q2267367) (← links)
• Faster initial splitting for small characteristic composite extension degree fields (Q2302583) (← links)
• Koblitz curves over quadratic fields (Q2318090) (← links)
• A survey on fast correlation attacks (Q2376656) (← 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)
• Towards factoring in \(\mathrm{SL}(2,\mathbb F_{2^n})\) (Q2448084) (← links)
• Irreducible polynomials with consecutive zero coefficients (Q2469482) (← links)
• Generating more MNT elliptic curves (Q2491266) (← links)
• Speeding up exponentiation using an untrusted computational resource (Q2491304) (← links)
• Recognising the Suzuki groups in their natural representations. (Q2496861) (← links)
• Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography (Q2512887) (← links)
• Smoothness testing of polynomials over finite fields (Q2513763) (← links)
• The index calculus method using non-smooth polynomials (Q2719078) (← links)
• Analysis of Rabin's irreducibility test for polynomials over finite fields (Q2772930) (← links)
• Traps to the BGJT-algorithm for discrete logarithms (Q2878837) (← links)
• A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields (Q3137444) (← links)
• Computing Logarithms in Finite Fields of Characteristic Two (Q3320493) (← links)
• On Small Characteristic Algebraic Tori in Pairing-Based Cryptography (Q3430820) (← links)
• Factor-4 and 6 compression of cyclotomic subgroups of and (Q3580730) (← links)
• The Function Field Sieve in the Medium Prime Case (Q3593100) (← links)