Fast evaluation of logarithms in fields of characteristic two
From MaRDI portal
Recommendations
Cited in
(60)- On the number of polynomials over \(\mathrm{GF}(2)\) that factor into \(2, 3\) or \(4\) prime polynomials
- An application of factoring
- Discrete logarithms in \(\mathrm{GF}(p)\)
- A key distribution system equivalent to factoring
- Some soluble cases of the discrete logarithm problem
- On computing logarithms over GF(2**p)
- Computation of discrete logarithms in prime fields
- Computational problems in the theory of finite fields
- A note on cyclic groups, finite fields, and the discrete logarithm problem
- Cryptography and elliptic curves
- Elliptic curve cryptosystems and their implementation
- Batch RSA
- Smoothness test for polynomials defined over small characteristic finite fields
- Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields
- Indiscreet logarithms in finite fields of small characteristic
- A serial version of the Pohlig-Hellman algorithm for computing discrete logarithms
- Function field sieve method for discrete logarithms over finite fields
- Complexity of a determinate algorithm for the discrete logarithm
- Mathematical problems in cryptology
- 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
- A taxonomy of pairing-friendly elliptic curves
- Faster initial splitting for small characteristic composite extension degree fields
- Koblitz curves over quadratic fields
- A survey on fast correlation attacks
- An \(L(1/3)\) discrete logarithm algorithm for low degree curves
- Elliptic curve cryptography: the serpentine course of a paradigm shift
- Towards factoring in \(\mathrm{SL}(2,\mathbb F_{2^n})\)
- Irreducible polynomials with consecutive zero coefficients
- Generating more MNT elliptic curves
- Speeding up exponentiation using an untrusted computational resource
- Recognising the Suzuki groups in their natural representations.
- Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography
- Smoothness testing of polynomials over finite fields
- The index calculus method using non-smooth polynomials
- Analysis of Rabin's irreducibility test for polynomials over finite fields
- Traps to the BGJT-algorithm for discrete logarithms
- A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields
- Computing Logarithms in Finite Fields of Characteristic Two
- On Small Characteristic Algebraic Tori in Pairing-Based Cryptography
- 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
- Cryptographic properties of the hidden weighted bit function
- Irregularities in the Distribution of Irreducible Polynomials
- An algorithm for evaluation of discrete logarithms in some nonprime finite fields
- Accelerating Pollard's rho algorithm on finite fields
- Computation of low-weight parity checks for correlation attacks on stream ciphers
- Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
- Computation of a 30750-bit binary field discrete logarithm
- Solving systems of linear equations arising in the computation of logarithms in a finite prime field
- scientific article; zbMATH DE number 7310221 (Why is no real title available?)
- scientific article; zbMATH DE number 7310230 (Why is no real title available?)
- Selecting polynomials for the function field sieve
- The generalized Weil pairing and the discrete logarithm problem on elliptic curves
- Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm
- A generalization of the Hansen-Mullen conjecture on irreducible polynomials over finite fields
- A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point
- Index calculus in the trace zero variety
- Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity
This page was built for publication: Fast evaluation of logarithms in fields of characteristic two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3216753)
