Skip to main content
replaced "Field" with "Ring" as it's more correct here, improved formatting and style
Source Link
SEJPM
  • 46.8k
  • 9
  • 103
  • 216

Is one time pad security on anthe One Time Pad secure in additive fieldRings?

Let's assume all operations are done on $\mathtt{F}_p$$\mathbb{Z}_p$ where $p$ is a large non-prime number.

To mask a value: $a$, we do the following:

1- pick a uniformly random value: $r$, from the field.

2- do as follows: $c= r+a \bmod p$.

  1. Pick a uniformly random value: $r$, from the ring.

  2. Do as follows: $c= r+a \bmod p$.

Question: isIs the above one-time pad secure?

Is one time pad security on an additive field?

Let's all operations are done on $\mathtt{F}_p$ where $p$ is a large non-prime number.

To mask a value: $a$, we do the following:

1- pick a uniformly random value: $r$, from the field.

2- do as follows: $c= r+a \bmod p$.

Question: is above one-time pad secure?

Is the One Time Pad secure in additive Rings?

Let's assume all operations are done on $\mathbb{Z}_p$ where $p$ is a large non-prime number.

To mask a value $a$, we do the following:

  1. Pick a uniformly random value: $r$, from the ring.

  2. Do as follows: $c= r+a \bmod p$.

Question: Is the above one-time pad secure?

Source Link
user153465
  • 1.6k
  • 12
  • 23

Is one time pad security on an additive field?

Let's all operations are done on $\mathtt{F}_p$ where $p$ is a large non-prime number.

To mask a value: $a$, we do the following:

1- pick a uniformly random value: $r$, from the field.

2- do as follows: $c= r+a \bmod p$.

Question: is above one-time pad secure?