Related papers: On Shanks' Algorithm for Modular Square Roots

We present an efficient and elementary algorithm for computing the number of primes up to $N$ in $\tilde{O}(\sqrt N)$ time, improving upon the existing combinatorial methods that require $\tilde{O}(N ^ {2/3})$ time. Our method has a similar…

It is well known that for any prime $p\equiv 3$ (mod $4$), the class numbers of the quadratic fields $\mathbb{Q}(\sqrt{p})$ and $\mathbb{Q}(\sqrt{-p})$, $h(p)$ and $h(-p)$ respectively, are odd. It is natural to ask whether there is a…

We explore an algorithm for approximating roots of integers, discuss its motivation and derivation, and analyze its convergence rates with varying parameters and inputs. We also perform comparisons with established methods for approximating…

Let $p$ be an odd prime. For any $p$-adic integer $a$ we let $\overline{a}$ denote the unique integer $x$ with $-p/2<x<p/2$ and $x-a$ divisible by $p$. In this paper we study some permutations involving quadratic residues modulo $p$. For…

The classical division algorithm for polynomials requires $O(n^2)$ operations for inputs of size $n$. Using reversal technique and Newton iteration, it can be improved to $O({M}(n))$, where ${M}$ is a multiplication time. But the method…

A quantum processor (QuP) can be used to exploit quantum mechanics to find the prime factors of composite numbers[1]. Compiled versions of Shor's algorithm have been demonstrated on ensemble quantum systems[2] and photonic systems[3-5],…

We describe an implementation of Shor's quantum algorithm to factor n-bit integers using only 2n+2 qubits. In contrast to previous space-optimized implementations, ours features a purely Toffoli based modular multiplication circuit. The…

Shor's algorithm for factoring in polynomial time on a quantum computer\cite{Shor} gives an enormous advantage over all known classical factoring algorithm. We demonstrate how to factor products of large prime numbers using a compiled…

Elliptic curves with a known number of points over a given prime field with n elements are often needed for use in cryptography. In the context of primality proving, Atkin and Morain suggested the use of the theory of complex multiplication…

We show how one can use non-prime-power, composite moduli for computing representations of the product of two $n\times n$ matrices using only $n^{2+o(1)}$ multiplications.

We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions and on interpolation, which has received little attention in…

The modular multiplication operator, a central subroutine in Shor's factoring algorithm, is shown to be a coherent superposition of two quantum bakers maps when the multiplier is 2. The classical limit of the maps being completely chaotic,…

In this paper, we present algorithms to solve matrix multiplication problems in the MPC model. In particular, we consider the problem under various processor/memory constraints in the MPC model and prove the following results. 1.…

Given n=p*q with p and q prim and y in Z_{p*q}^*. Shor's Algorithm computes the order r of y, i.e. y^r=1 (mod n). If r=2k is even and y^k \ne -1 (mod n) we can easily compute a non trivial factor of n: gcd(y^k-1,n). In the original paper it…

Let $p=2n+1$ be an odd prime, and let $\zeta_{p^2-1}$ be a primitive $(p^2-1)$-th root of unity in the algebraic closure $\overline{\mathbb{Q}_p}$ of $\mathbb{Q}_p$. We let $g\in\mathbb{Z}_p[\zeta_{p^2-1}]$ be a primitive root modulo…

In this paper, we compute the action of the mod $p$ Steenrod operations on the modular invariants of the linear groups with $p$ an odd prime number.

Quantum multiplication is a fundamental operation in quantum computing. It is important to have a quantum multiplier with low complexity. In this paper, we propose the Quantum Multiplier Based on Exponent Adder (QMbead), a new approach that…

Let $p\equiv 1\pmod{8}$ and $q\equiv7\pmod 8$ be two prime numbers. The purpose of this paper is to compute the unit group of the fields $\KK=\QQ(\sqrt 2, \sqrt{p}, \sqrt{q} )$ and give their $2$-class numbers.

A novel very simple method for finding roots of polynomials over finite fields has been proposed. The essence of the proposed method is to search the roots via nested cycles over the subgroups of the multiplicative group of the Galois…

Let N and p be two prime numbers > 3 such that p divides N-1. We estimate the p-rank of the class group of Q(N^(1/p)) in terms of the discrete logarithm, with values un F_p, of certain units. Using the Gross--Koblitz formula and identities…