HEtools (Q84805): Difference between revisions
From MaRDI portal
Removed claim: depends on software (P342): polynom (Q23565) |
Added link to MaRDI item. |
||||||||||||||
| (4 intermediate revisions by one other user not shown) | |||||||||||||||
| Property / last update | |||||||||||||||
| |||||||||||||||
| Property / last update: 16 December 2022 / rank | |||||||||||||||
| Property / cites work | |||||||||||||||
| Property / cites work: Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$ / rank | |||||||||||||||
| Property / cites work | |||||||||||||||
| Property / cites work: On lattices, learning with errors, random linear codes, and cryptography / rank | |||||||||||||||
| Property / software version identifier | |||||||||||||||
0.2.0 | |||||||||||||||
| Property / software version identifier: 0.2.0 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / software version identifier: 0.2.0 / qualifier | |||||||||||||||
publication date: 11 November 2023
| |||||||||||||||
| Property / software version identifier | |||||||||||||||
1.0.0 | |||||||||||||||
| Property / software version identifier: 1.0.0 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / software version identifier: 1.0.0 / qualifier | |||||||||||||||
publication date: 8 December 2023
| |||||||||||||||
| Property / last update | |||||||||||||||
8 December 2023
| |||||||||||||||
| Property / last update: 8 December 2023 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / 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. | |||||||||||||||
| Property / 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. / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / author | |||||||||||||||
| Property / author: Bastiaan Quast / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / copyright license | |||||||||||||||
| Property / copyright license: MIT license / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / copyright license | |||||||||||||||
| Property / copyright license: File License / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / copyright license: File License / qualifier | |||||||||||||||
| Property / depends on software | |||||||||||||||
| Property / depends on software: polynom / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / cites work | |||||||||||||||
| Property / cites work: Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$ / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / cites work | |||||||||||||||
| Property / cites work: On lattices, learning with errors, random linear codes, and cryptography / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / MaRDI profile type | |||||||||||||||
| Property / MaRDI profile type: MaRDI software profile / rank | |||||||||||||||
Normal rank | |||||||||||||||
| links / mardi / name | links / mardi / name | ||||||||||||||
Latest revision as of 18:56, 12 March 2024
Homomorphic Encryption Polynomials
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | HEtools |
Homomorphic Encryption Polynomials |
Statements
8 December 2023
0 references
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.
0 references
