CoefMod

Homomorphic encryption (Brakerski and Vaikuntanathan (2014) <doi:10.1137/120868669>) using Ring Learning with Errors (Lyubashevsky et al. (2012) <https://eprint.iacr.org/2012/230>) is a form of Learning with Errors (Regev (2005) <doi:10.1145/1060590.1060603>) using polynomial rings over finite fields. Functions to generate the required polynomials (using 'polynom'), with various distributions of coefficients are provided. Additionally, functions to generate and take coefficient modulo are provided.

Bastiaan Quast

HEtools

Homomorphic Encryption Polynomials

CoefMod function

<dl><dt>x</dt>
<dd>polynomial from the polynom package</dd>
<dt>k</dt>
<dd>the modulo</dd></dl>

Arguments

Coefficient Modulo — CoefMod

<dl>

<dt>x</dt>
<dd>polynomial from the polynom package</dd>


<dt>k</dt>
<dd>the modulo</dd>

</dl>

CoefMod: Coefficient Modulo

Description

Usage

Value

Arguments

Examples