Pages that link to "Item:Q1094455"
From MaRDI portal
The following pages link to Discrete logarithms in \(\mathrm{GF}(p)\) (Q1094455):
Displayed 39 items.
- Discrete logarithm problem using index calculus method (Q445390) (← links)
- A short proof for explicit formulas for discrete logarithms in finite fields (Q802668) (← links)
- A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point (Q850776) (← links)
- Applying quick exponentiation for block upper triangular matrices (Q865509) (← links)
- Some uses of microcomputers in number theory research (Q912884) (← links)
- Lower bounds for decision problems in imaginary, norm-Euclidean quadratic integer rings (Q1015166) (← links)
- On the security of cryptosystem using automorphism groups (Q1029031) (← links)
- A key distribution system equivalent to factoring (Q1112781) (← links)
- On zero-testing and interpolation of \(k\)-sparse multivariate polynomials over finite fields (Q1178687) (← links)
- Computation of discrete logarithms in prime fields (Q1179517) (← links)
- Efficient signature generation by smart cards (Q1180508) (← links)
- Computational problems in the theory of finite fields (Q1180998) (← links)
- A note on cyclic groups, finite fields, and the discrete logarithm problem (Q1196516) (← links)
- Solving linear equations over GF(2): Block Lanczos algorithm (Q1311312) (← links)
- Elliptic curve cryptosystems and their implementation (Q1312102) (← links)
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption (Q1648782) (← links)
- Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms (Q1737153) (← links)
- Function field sieve method for discrete logarithms over finite fields (Q1854276) (← links)
- Fast generation of prime numbers and secure public-key cryptographic parameters. (Q1895963) (← links)
- Mathematical problems in cryptology (Q1910812) (← links)
- Non-interactive zero knowledge from sub-exponential DDH (Q2056667) (← links)
- One-way permutations on elliptic curves (Q2277234) (← links)
- Analysis and design of a secure key exchange scheme (Q2390334) (← links)
- Algebraic generalization of Diffie-Hellman key exchange (Q2413287) (← links)
- Solving sparse linear systems of equations over finite fields using bit-flipping algorithm (Q2435450) (← links)
- Cubic sieve congruence of the discrete logarithm problem, and fractional part sequences (Q2437317) (← links)
- Special prime numbers and discrete logs in finite prime fields (Q2759106) (← links)
- An Experiment of Number Field Sieve over GF(p) of Low Hamming Weight Characteristic (Q3005589) (← links)
- Ephemeral key recovery using index calculus method (Q3062048) (← links)
- A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields (Q3137444) (← links)
- Performance analysis of index calculus method (Q3561529) (← links)
- Faster individual discrete logarithms in finite fields of composite extension degree (Q4612570) (← links)
- Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method (Q4794653) (← links)
- Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree (Q4827599) (← links)
- Решение систем линейных уравнений при вычислении логарифмов в конечном простом поле (Q4959032) (← links)
- The Complexity of Public-Key Cryptography (Q5021130) (← links)
- Number of rational points of elliptic curves (Q5064359) (← links)
- On the cubic sieve method for computing discrete logarithms over prime fields (Q5719250) (← links)
- Elimination ideal and bivariate resultant over finite fields (Q6081978) (← links)