scientific article; zbMATH DE number 3956969
From MaRDI portal
Publication:3726006
Recommendations
Cited in
(63)- 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]\)
- Scalable zero knowledge via cycles of elliptic curves
- Message encoding and retrieval for spread and cyclic orbit codes
- Indiscreet logarithms in finite fields of small characteristic
- Function field sieve method for discrete logarithms over finite fields
- Finite fields and cryptology
- The order of a typical matrix with entries in a finite field
- Nonabelian sets with distinct k-sums
- Mathematical problems in cryptology
- Interpolation of the Zech's logarithm: explicit forms
- On the enumeration of polynomials with prescribed factorization pattern
- Computing Frobenius maps and factoring polynomials
- On the signature calculus for finite fields of order square of prime numbers
- On the complexity of matrix reduction over finite fields
- Smoothness testing of polynomials over finite fields
- The index calculus method using non-smooth polynomials
- Correspondences on hyperelliptic curves and applications to the discrete logarithm
- Accelerating Iterative SpMV for the Discrete Logarithm Problem Using GPUs
- 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
- scientific article; zbMATH DE number 5532108 (Why is no real title available?)
- Algorithms in Algebraic Number Theory
- Irregularities in the Distribution of Irreducible Polynomials
- An algorithm for evaluation of discrete logarithms in some nonprime finite fields
- How random is the characteristic polynomial of a random matrix ?
- scientific article; zbMATH DE number 708814 (Why is no real title available?)
- scientific article; zbMATH DE number 1500484 (Why is no real title available?)
- Computation of low-weight parity checks for correlation attacks on stream ciphers
- Faster individual discrete logarithms in finite fields of composite extension degree
- Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
- scientific article; zbMATH DE number 1406767 (Why is no real title available?)
- Solving systems of linear equations arising in the computation of logarithms in a finite prime field
- A survey on implementation of lightweight block ciphers for resource constraints devices
- Cache Optimized Solution for Sparse Linear System over Large Order Finite Field
- The past, evolving present, and future of the discrete logarithm
- On the Equivalence of Generic Group Models
- Progress in Cryptology - INDOCRYPT 2004
- Factoring polynomials over finite fields: A survey
- Hardness of graph-structured algebraic and symbolic problems
- Enumeration of decomposable combinatorial structures with restricted patterns
- Irreducible polynomials and linear recurring arrays
- Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm
- The structured generic-group model
- Search of primitive polynomials over finite fields
- Fast scalable construction of ([compressed] static | minimal perfect hash) functions
- A short proof for explicit formulas for discrete logarithms in finite fields
- On algorithms to find \(p\)-ordering
- 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
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3726006)
