practical quantum-secure key encapsulation from generic lattices
-
Updated
Oct 28, 2025 - Go
practical quantum-secure key encapsulation from generic lattices
Python implementation of "Somewhat Practical Fully Homomorphic Encryption"
We implement the progressive Improved Progressive BKZ with Lattice Sieving presented in https://eprint.iacr.org/2022/1343, one can call it to solve LWE challenge(https://www.latticechallenge.org/lwe_challenge/challenge.php) or other approximate svp problem.
Experimental port of the TFHE fully homomorphic encryption scheme to Rust.
Prototypes of a Learning With Errors (LWE) Implementation
Fast and ergonomic lattice cryptography library
Python implementation of "Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP"
Implementation of GLWE based Levelled Fully Homomorphic BGV using Pari/GP library in C++.
Some experiments to empirically analyze how the parameters of LWE impact the correctness of the algorithm on a single bit.
Privacy-Preserving E-Health Record Management Using Blockchain-Based Post-Quantum Access Control https://ieeexplore.ieee.org/document/10794736 doi:10.1109/UNet62310.2024.10794736 #CPABE #crypto #cryptography #smartcontracts #ieee #blockchain #ethereum #ehealth #python #flask #solidity #truffle #postquantumcryptography
Official code for 'Galois Invariants in Cyclotomic Lattice Enumeration'. Proves deterministic collapse of the SVP search space via modular pruning and MitM architecture. Demonstrates non-ergodicity of LWE noise, reducing complexity by the product of oracle primes. Supporting material for SEMA Journal (Springer Nature).
Empirical experiments with naive SVP, CVP and LWE search to explore lattice-algorithm complexity.
Implementations of anamorphic primal and dual Regev cryptosystems, in Python and Go
Learning with Errors crypto method for post-quantum appliaction (Module-LWE)
Python research prototype implementing Receiver-Anamorphic Encryption for the Signal Protocol using the Dual-Regev cryptosystem.
Module-LWE based key exchange protocol for secure IoT communications with efficient error reconciliation. Includes performance benchmarking and NS-3 network simulation.
GridLock is lattice based (LWE) Cryptosystem created as an educational project.
Survey of lattice-based post-quantum key agreement protocols built on the Learning With Errors (LWE) problem, with a quantitative comparison of Kyber, NewHope, FrodoKEM, BCNS and others against an ECDH-256 baseline.
Reproducible design-space study of lightweight lattice-based authentication & signatures (LWE tag + Lyubashevsky-style signature) for blockchain transactions; estimator + scaled-down lattice attacks; OpenSSL-anchored benchmarks.
Empirical study of a simplified LWE cryptosystem — Bachelor's thesis (TFG) in post-quantum cryptography
To associate your repository with the lwe topic, visit your repo's landing page and select "manage topics."