Questions tagged [congruence]

If two numbers $b$ and $c$ have the property that their difference $b-c$ is integrally divisible by a number $m$ (i.e., $(b-c)/m$ is an integer), then $b$ and $c$ are said to be "congruent modulo $m$."

If two numbers $b$ and $c$ have the property that their difference $b-c$ is integrally divisible by a number $m$ (i.e., $(b-c)/m$ is an integer), then $b$ and $c$ are said to be "congruent modulo $m$."

The number $m$ is called the modulus, and the statement "$b$ is congruent to $c$ (modulo $m$)"; mathematically written as $b≡c \pmod{m}$.

If $b-c$ is not integrally divisible by $m$, then it is said that "$b$ is not congruent to $c$ (modulo $m$),"; mathematically written as $b≢c \pmod{m}$.

The explicit $\pmod{m}$ is sometimes omitted when the modulus $m$ is understood by context, so in such cases, care must be taken not to confuse the symbol $≡$ with the equivalence sign.

The quantity $b$ is sometimes called the "base," and the quantity $c$ is called the residue or remainder. There are several types of residues. The common residue defined to be non-negative and smaller than $m$, while the minimal residue is $c$ or $c-m$, whichever is smaller in absolute value.

20 questions
1
vote
2 answers

What exactly means to sample from the set of congruence classes?

Say one is doing some cryptography around the set of congruence classes, namely: $$\mathbb{Z}/n\mathbb{Z} = \mathbb{Z}_n = \{[0]_n, [1]_m, \dots, [n-1]_n\}.$$ Sometimes we use to write $a \leftarrow_R \mathbb{Z}_n$ to denote that we are sampling an…
Bean Guy
  • 732
  • 3
  • 11
0
votes
0 answers

Find a polynomial time algorithm for the following problem

Let $p$ be a prime number and let $c \in \mathbb{Z}_p$ and $e \in (\mathbb{Z}/(p-1))^{\ast}$. Put $c \equiv_p m^e$. Find a polynomial time algorithm that given $p$, $e$, and $c$ will compute $m$. I have tried but failed, I am looking for a complete…
Bob
  • 1
  • 1