Publication:3726006
From MaRDI portal
zbMath0594.94016MaRDI QIDQ3726006
Publication date: 1985
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94A60: Cryptography
11Y16: Number-theoretic algorithms; complexity
11T06: Polynomials over finite fields
Related Items
How random is the characteristic polynomial of a random matrix ?, Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method, Factoring polynomials over finite fields: A survey, Irreducible polynomials and linear recurring arrays, Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm, Search of primitive polynomials over finite fields, A short proof for explicit formulas for discrete logarithms in finite fields, On the design of cryptographic primitives, Studying the performance of artificial neural networks on problems related to cryptography, Some uses of microcomputers in number theory research, Analysis of the Herlestam and Johannesson discrete logarithm scheme in \(GF(2^ N)\) for large N, An application of factoring, Discrete logarithms in \(\mathrm{GF}(p)\), One-way functions and circuit complexity, A key distribution system equivalent to factoring, A key-exchange system based on imaginary quadratic fields, Hyperelliptic cryptosystems, A note on discrete logarithms in finite fields, The computational efficacy of finite-field arithmetic, A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm, Elliptic curve cryptosystems and their implementation, Integers without large prime factors, On the largest degree of an irreducible factor of a polynomial in \(\mathbb{F}_q[X\)], Function field sieve method for discrete logarithms over finite fields, The order of a typical matrix with entries in a finite field, Nonabelian sets with distinct \(k\)-sums, Mathematical problems in cryptology, Computing Frobenius maps and factoring polynomials, On the complexity of matrix reduction over finite fields, The index calculus method using non-smooth polynomials, A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields, Sequences of consecutive smooth polynomials over a finite field, The Function Field Sieve in the Medium Prime Case, Algorithms in Algebraic Number Theory, Irregularities in the Distribution of Irreducible Polynomials, An algorithm for evaluation of discrete logarithms in some nonprime finite fields
