HEtools
Homomorphic Encryption Polynomials
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.
- Version1.0.0
- R versionunknown
- LicenseMIT
- LicenseLICENSE
- Needs compilation?No
- Last release12/08/2023
Documentation
Team
Bastiaan Quast
Insights
Last 30 days
Last 365 days
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Data provided by CRAN
Binaries
Dependencies
- Depends1 package
- Suggests1 package
- Reverse Depends1 package