Not a blockchain! Homomorphic encryption is the conversion of data into ciphertext that can be analyzed and worked with as if it were still in its original form. Homomorphic encryption enables complex mathematical operations to be performed on encrypted data without compromising the encryption.
Understanding CKKS Encoding and Decoding: Canonical Embedding and Scaling Explained
Basics of RNS with ASCII math and simple examples.
Deterministic primality testing for 64-bit integers using Miller-Rabin.
How to sample a small secret polynomial s(X) for CKKS using a ternary distribution with an exact Hamming weight, plus a concise Rust implementation.
Description the main Fully Homomorphic Encryption (FHE) schemes — BGV, CKKS, BFV, FHEW, and TFHE — with concise explanations of their traits, arithmetic types, and best use cases.
Very short overview of public key generation in CKKS via RLWE.