A reconciliation approach to key generation based on Module-LWE
Cryptography and Security
2021-02-25 v2 Information Theory
math.IT
Abstract
We consider a key encapsulation mechanism (KEM) based on Module-LWE where reconciliation is performed on the 8-dimensional lattice , which admits a fast CVP algorithm. Our scheme generates 256 bits of key and requires 3 or 4 bits of reconciliation per dimension. We show that it can outperform Kyber in terms of the modulus q with comparable error probability. We prove that our protocol is IND-CPA secure and improves the security level of Kyber by 7.3%.
Keywords
Cite
@article{arxiv.2001.04280,
title = {A reconciliation approach to key generation based on Module-LWE},
author = {Charbel Saliba and Laura Luzzi and Cong Ling},
journal= {arXiv preprint arXiv:2001.04280},
year = {2021}
}
Comments
5 pages. New version based on Module-LWE, with a different approach for the error probability bound. The previous version contained a mistake in the error scaling, which is now corrected