scientific article

Publication date: 1985

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

survey algorithms cryptography public key cryptosystems

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)

Related Items

An application of factoring ⋮ Computing Frobenius maps and factoring polynomials ⋮ A survey on implementation of lightweight block ciphers for resource constraints devices ⋮ On algorithms to find \(p\)-ordering ⋮ Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method ⋮ On the enumeration of polynomials with prescribed factorization pattern ⋮ Correspondences on Hyperelliptic Curves and Applications to the Discrete Logarithm ⋮ Discrete logarithms in \(\mathrm{GF}(p)\) ⋮ One-way functions and circuit complexity ⋮ On the design of cryptographic primitives ⋮ The order of a typical matrix with entries in a finite field ⋮ Nonabelian sets with distinct \(k\)-sums ⋮ How random is the characteristic polynomial of a random matrix ? ⋮ A key distribution system equivalent to factoring ⋮ A key-exchange system based on imaginary quadratic fields ⋮ Mathematical problems in cryptology ⋮ Studying the performance of artificial neural networks on problems related to cryptography ⋮ Algorithms in Algebraic Number Theory ⋮ Hyperelliptic cryptosystems ⋮ On the largest degree of an irreducible factor of a polynomial in \(\mathbb{F}_q[X\)] ⋮ Accelerating Iterative SpMV for the Discrete Logarithm Problem Using GPUs ⋮ Scalable zero knowledge via cycles of elliptic curves ⋮ Message encoding and retrieval for spread and cyclic orbit codes ⋮ Hardness of graph-structured algebraic and symbolic problems ⋮ Cache Optimized Solution for Sparse Linear System over Large Order Finite Field ⋮ Computation of low-weight parity checks for correlation attacks on stream ciphers ⋮ Some uses of microcomputers in number theory research ⋮ Faster individual discrete logarithms in finite fields of composite extension degree ⋮ The index calculus method using non-smooth polynomials ⋮ Enumeration of decomposable combinatorial structures with restricted patterns ⋮ A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields ⋮ On the complexity of matrix reduction over finite fields ⋮ Irreducible polynomials and linear recurring arrays ⋮ A note on discrete logarithms in finite fields ⋮ Factoring polynomials over finite fields: A survey ⋮ Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm ⋮ The computational efficacy of finite-field arithmetic ⋮ The Function Field Sieve in the Medium Prime Case ⋮ Indiscreet logarithms in finite fields of small characteristic ⋮ Irregularities in the Distribution of Irreducible Polynomials ⋮ Smoothness testing of polynomials over finite fields ⋮ Решение систем линейных уравнений при вычислении логарифмов в конечном простом поле ⋮ A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm ⋮ Search of primitive polynomials over finite fields ⋮ Fast scalable construction of ([compressed static | minimal perfect hash) functions] ⋮ An algorithm for evaluation of discrete logarithms in some nonprime finite fields ⋮ Interpolation of the Zech's logarithm: explicit forms ⋮ On the Equivalence of Generic Group Models ⋮ Sequences of consecutive smooth polynomials over a finite field ⋮ Function field sieve method for discrete logarithms over finite fields ⋮ Analysis of the Herlestam and Johannesson discrete logarithm scheme in \(GF(2^ N)\) for large N ⋮ Elliptic curve cryptosystems and their implementation ⋮ A short proof for explicit formulas for discrete logarithms in finite fields ⋮ Integers without large prime factors