November 2019
Intermediate to advanced
346 pages
9h 36m
English
We begin Step 1 by importing the random library in order to generate random integers in Step 2. We also define a large prime number, P, as we will be wanting a random distribution modulo, P. In Step 2, we define how a function encrypts an integer by splitting it between three parties. The value of x here is randomly additively split between the three parties. All operations take place in the field of integer modulo P. Next, in Step 3, we demonstrate the result of encrypting an integer using our approach. Proceeding to Steps 4 and 5, we define a function to reverse encryption, that is decrypt, and then show that the operation is reversible. In Step 6, we define a function to add two encrypted numbers(!). Note that encrypted addition ...