Pages that link to "Item:Q3806810"
From MaRDI portal
The following pages link to A simple and fast probabilistic algorithm for computing square roots modulo a prime number (Corresp.) (Q3806810):
Displaying 20 items.
- Improved authenticated multiple-key agreement protocol (Q597218) (← links)
- On splitting sets in block designs and finding roots of polynomials (Q915734) (← links)
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- Efficient randomized generation of optimal algorithms for multiplication in certain finite fields (Q1198957) (← links)
- An algorithm to compute the number of points on elliptic curves of \(j\)-invariant 0 or 1728 over a finite field (Q1313211) (← links)
- Improved low-computation partially blind signatures. (Q1412496) (← links)
- Taking cube roots in \(\mathbb Z_{m}\) (Q1614110) (← links)
- On the complexity of the discrete logarithm and Diffie-Hellman problems (Q1827563) (← links)
- New cube root algorithm based on the third order linear recurrence relations in finite fields (Q2345923) (← links)
- On the Cipolla-Lehmer type algorithms in finite fields (Q2631927) (← links)
- A complete generalization of Atkin's square root algorithm (Q2843816) (← links)
- On Relationship of Computational Diffie-Hellman Problem and Computational Square-Root Exponent Problem (Q3005597) (← links)
- On taking square roots without quadratic nonresidues over finite fields (Q3015058) (← links)
- An algorithm for recognising the exterior square of a matrix (Q4264517) (← links)
- Dirichlet’s proof of the three-square theorem: An algorithmic perspective (Q4561383) (← links)
- On Shanks' Algorithm for Modular Square Roots (Q4670089) (← links)
- (Q4987759) (← links)
- (Q6039849) (← links)
- Square root computation in finite fields (Q6564090) (← links)
- On the computation of \(r\)-th roots in finite fields (Q6615544) (← links)
