I am confused about *correctness* of the encrytpion scheme.

For example, if we encrypt message m=1 using sample e=0, when decrypting we get:

m' = -m mod q mod 2 = -1 mod q mod 2 = q-1 mod q mod 2 = q-1 mod 2 = 0

=> m' != m

What am I missing?

*Instructor:*- Nir Bitansky
*Location and Hours:*- Dan David 202, Thursday 10:00 - 13:00

*Assignment 6 due*: Feb 7*Exam*: Feb 4*Moed B*: Mar 28

**Reference solution for Moed A**

(15 Feb 2018 19:59)

**Reference solution for assignment 6**

(15 Feb 2018 19:56)

**Deadline for assignment 6**

(30 Jan 2018 13:37)

No mistake.
The goal here is to show that the adversary cannot turn an encryption of an unknown...

(by nbitansky 05 Feb 2018 19:34, posts: 3)

(by nbitansky 05 Feb 2018 19:34, posts: 3)

Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-ShareAlike 3.0 License