Fast evaluation of logarithms in fields of characteristic two
From MaRDI portal
Publication:3216753
DOI10.1109/TIT.1984.1056941zbMath0554.12013MaRDI QIDQ3216753
Publication date: 1984
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06) Factorization (11Y05)
Related Items
Smoothness test for polynomials defined over small characteristic finite fields, An application of factoring, Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields, Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method, A survey on fast correlation attacks, Discrete logarithms in \(\mathrm{GF}(p)\), Complexity of a determinate algorithm for the discrete logarithm, A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point, Batch RSA, New discrete logarithm computation for the medium prime case using the function field sieve, A key distribution system equivalent to factoring, Mathematical problems in cryptology, Some soluble cases of the discrete logarithm problem, The generalized Weil pairing and the discrete logarithm problem on elliptic curves, Cryptographic properties of the hidden weighted bit function, Index calculus in the trace zero variety, An \(L(1/3)\) discrete logarithm algorithm for low degree curves, Elliptic curve cryptography: the serpentine course of a paradigm shift, Accelerating Pollard's rho algorithm on finite fields, Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity, Computation of low-weight parity checks for correlation attacks on stream ciphers, Towards factoring in \(\mathrm{SL}(2,\mathbb F_{2^n})\), The index calculus method using non-smooth polynomials, Computation of discrete logarithms in prime fields, Computational problems in the theory of finite fields, A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields, Irreducible polynomials with consecutive zero coefficients, A note on cyclic groups, finite fields, and the discrete logarithm problem, Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm, Factor-4 and 6 compression of cyclotomic subgroups of and, Updating key size estimations for pairings, Analysis of Rabin's irreducibility test for polynomials over finite fields, Generating more MNT elliptic curves, Speeding up exponentiation using an untrusted computational resource, A taxonomy of pairing-friendly elliptic curves, The Function Field Sieve in the Medium Prime Case, Recognising the Suzuki groups in their natural representations., Indiscreet logarithms in finite fields of small characteristic, Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography, Irregularities in the Distribution of Irreducible Polynomials, Smoothness testing of polynomials over finite fields, Computation of a 30750-bit binary field discrete logarithm, A serial version of the Pohlig-Hellman algorithm for computing discrete logarithms, Faster initial splitting for small characteristic composite extension degree fields, Cryptography and elliptic curves, A generalization of the Hansen-Mullen conjecture on irreducible polynomials over finite fields, Koblitz curves over quadratic fields, An algorithm for evaluation of discrete logarithms in some nonprime finite fields, Selecting polynomials for the Function Field Sieve, Unnamed Item, Unnamed Item, Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields, On Small Characteristic Algebraic Tori in Pairing-Based Cryptography, Function field sieve method for discrete logarithms over finite fields, Elliptic curve cryptosystems and their implementation, On the number of polynomials over \(\mathrm{GF}(2)\) that factor into \(2, 3\) or \(4\) prime polynomials, Traps to the BGJT-algorithm for discrete logarithms
