Basic Math
Modulo Arithmetic
Properties of Modulo Arithmetic
Fully Homomorphic Encryption
Homomorphic encryption is a form of encryption that allows computations to be performed on encrypted data without first having to decrypt it. The resulting computations are left in an encrypted form which, when decrypted, result in an output that is identical to that of the operations performed on the unencrypted data.
Table of Contents
-
Basic Math
- Modulo Arithmetic
- Group
- Field
- Order
- Polynomial Ring
- Decomposition
- Roots of Unity
- Cyclotomic Polynomial
- Roots of Unity and Cyclotomic
- Vector and Matrix
- Euler’s Formula
- Modulo Rescaling
- Chinese Remainder Theorem
- Taylor Series
- Lagrange’s Polynomial Interpolation
- Efficient Polynomial Multiplication by FFT and NTT
- Post-quantum Cryptography
- Generic Fully Homomorphic Encryption
- Fully Homomorphic Encryption Schemes
- GPU Accelerated Fully Homomorphic Encryption