New answers tagged modular-arithmetic
0
votes
Finding two inputs [i, j] of a custom Hash function where their Hashes are [H(i), H(j)] = [H(i), H(i)^2]
$i=j=0$, both representing the empty string and hashing to the integer $0$, is a trivial answer to the question for most of the plausible readings of “convert it to integer”. In the following I add to ...
- 137k
2
votes
Accepted
What is the inverse of this generalised automaton (based on bitwise XOR and modular addition)?
As the paper says, there is not a simple expression. The $\boxplus$ operator is surprisingly complex as a Boolean algebraic expression. It does however act analogously to a $T$-function and so there ...
- 21.3k
2
votes
Accepted
Trying to understand the basic principle of RSA from Wikipedia
In $(m^e)^d\equiv m\pmod n$, as long as $e$ and $d$ are positive integers, the fragment $(m^e)^d$ means $m$ raised to the power $e$, then raised to the power $d$, that is
$$\underbrace{{(\,\underbrace{...
- 137k
1
vote
Accepted
RSA: in $E(x) \equiv x^e \pmod N$, do we apply the mod function to $x^e$?
$E(x) \equiv x^e \pmod N$ as in the question means that $E(x)$ is congruent to $x^e$ modulo $N$, equivalently that $x^e-E(x)$ is a multiple of $N$. But it gives not bound for $E(x)$, thus does not ...
- 137k
Top 50 recent answers are included