Skip to main content

All Questions

-1 votes
1 answer
125 views

Found $a^2\equiv b^2(\mod RSA\_1024)$ What are the chances?

Due to the size of the numbers, I am writing them as a code. Below are $a$ and $b$ ...
Ilya Gazman's user avatar
  • 1,450
0 votes
1 answer
124 views

Find integer $x$ such that $x^2 \mod {1799832043}$ is divisible by $67610791$

Find integer $x$ such that $x^2 \mod {n}$ is divisible by $p$ For values $n = 1799832043, p = 67610791$ I have been using Tonelli-Shanks algorithm to solve this and it works for small primes with ...
Ilya Gazman's user avatar
  • 1,450
1 vote
0 answers
299 views

Pohlig-Hellman algorithm

I'm trying to use the Pohlig-Hellman algorithm to solve for $x$ where $15^x=131(\bmod 337)$. This is what I have so far: prime factors of p-1: $336=2^4*3*7$ $q=2: x=2^0*x_0+2^1*x_1+2^2*x_2+2^3*x_3$ ...
Matt Robbins's user avatar
0 votes
1 answer
642 views

Trailing zeroes in product of numbers with factorial power

I need to find the number of trailing zeroes in $1^{1!} \cdot 2^{2!} \cdot 3^{3!} \cdots N^{N!}$, where $N$ is natural number. Assuming $N$ is very large, say $500$, where you cannot find factorial ...
mat7's user avatar
  • 235