Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2008.11814

An algorithm for finding square root modulo p

Rajeev Kumar
View original source ↗Read source document ↗Export metadata ↓

Abstract

We propose a novel algorithm for finding square roots modulo p. Although there exists a direct formula to calculate square root of an element modulo prime (3 mod 4), but calculating square root modulo prime (1 mod 4) is non trivial. Tonelli-Shanks algorithm remains the most widely used and probably the fastest when averaged over all primes [19]. This paper proposes a new algorithm for finding square roots modulo all odd primes, which shows improvement over existing method in practical terms although asymptotically gives the same run time as Tonelli-Shanks. Apart from practically efficient computation time, the proposed method does not necessarily require availability of non-residue and can work with `relative non-residue' also. Such `relative non-residues' are much easier to find ( probability 2/3) compared to non-residues ( probability 1/2).

Explore related subjects

math.GM

Keep this discovery

BibTeXRIS

Rajeev Kumar. 2020-08-24. An algorithm for finding square root modulo p. https://arxiv.org/abs/2008.11814

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM↗
arXiv2026

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM↗