Refresh the ORAM by reinserting the stash back into the shuffle, and reshuffling the shuffle. This must happen on the T'th (period) a

Reveal to binary output if supported by type. :param: player to reveal to (default all)

Conditionally print an error message and abort the runtime. :param condition: regint/cint/int/cbit :param msg: message :param args: list

Set choice bits

Permute the memory using a newly generated permutation and return the permutation that would generate this particular shuffling. This

Send full secret to socket

Send shares of a list of values to a specified client socket. :param client_id: regint :param values: list of sint

Write shares of integer representation to ``Persistence/Transactions-P<playerno>.data``. See :ref:`this section <persistence>` for de

u = a <? b a: array of clear bits b: array of secret bits (same length as a)

Little-endian version

* This creates the "pseudo-encryption" of the R_q element mess, * - As required for key switching. */

* FFT modulo x^n + 1. * * n must be a power of two, root a 2n-th primitive root of unity. */

Find an mth primitive root moduli the current prime * This is deterministic so all players have the same root of unity * This assumes m is a power

s = (a ?< 0) k: bit length of a

a_0 = a % 2 k: bit length of a