HEtools

CRANHEtoolsMaRDI QIDQ84805FDOQ84805

Homomorphic Encryption Polynomials

Bastiaan Quast

Last update: 8 December 2023

Copyright license: MIT license, File License

Software version identifier: 0.1.0, 0.2.0, 1.0.0

Description

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.

Cites work

• Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
• On lattices, learning with errors, random linear codes, and cryptography

Cited In (1)

• HomomorphicEncryption

This page was built for software: HEtools