Pages that link to "Item:Q1179517"
From MaRDI portal
The following pages link to Computation of discrete logarithms in prime fields (Q1179517):
Displaying 14 items.
- Discrete logarithm problem using index calculus method (Q445390) (← links)
- Lower bounds for decision problems in imaginary, norm-Euclidean quadratic integer rings (Q1015166) (← links)
- An interactive identification scheme based on discrete logarithms and factoring (Q1184505) (← links)
- Fast matrix decomposition in \(\mathbb F_2\) (Q2511223) (← links)
- Special prime numbers and discrete logs in finite prime fields (Q2759106) (← links)
- Improved Sieving on Algebraic Curves (Q2946455) (← links)
- An Experiment of Number Field Sieve over GF(p) of Low Hamming Weight Characteristic (Q3005589) (← links)
- Performance analysis of index calculus method (Q3561529) (← links)
- Faster individual discrete logarithms in finite fields of composite extension degree (Q4612570) (← links)
- Computing Prime Factorization And Discrete Logarithms: From Index Calculus To Xedni Calculus (Q4707308) (← links)
- Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method (Q4794653) (← links)
- Решение систем линейных уравнений при вычислении логарифмов в конечном простом поле (Q4959032) (← links)
- Public-key cryptography on smart cards (Q5235428) (← links)
- On the cubic sieve method for computing discrete logarithms over prime fields (Q5719250) (← links)
