Practical CCA2-Secure and Masked Ring-LWE Implementation

• Main Authors: Tobias Oder, Tobias Schneider, Thomas Pöppelmann, Tim Güneysu
• Format: Article
• Language: English
• Published: Ruhr-Universität Bochum 2018-02-01
• Series: Transactions on Cryptographic Hardware and Embedded Systems
• Subjects: Ideal Lattices; ring-LWE; CCA2 security; Masking; Hiding; Sampling
• Online Access: https://tches.iacr.org/index.php/TCHES/article/view/836

During the last years public-key encryption schemes based on the hardness of ring-LWE have gained significant popularity. For real-world security applications assuming strong adversary models, a number of practical issues still need to be addressed. In this work we thus present an instance of ring-LWE encryption that is protected against active attacks (i.e., adaptive chosen-ciphertext attacks) and equipped with countermeasures against side-channel analysis. Our solution is based on a postquantum variant of the Fujisaki-Okamoto (FO) transform combined with provably secure first-order masking. To protect the key and message during decryption, we developed a masked binomial sampler that secures the re-encryption process required by FO. Our work shows that CCA2-secured RLWE-based encryption can be achieved with reasonable performance on constrained devices but also stresses that the required transformation and handling of decryption errors implies a performance overhead that has been overlooked by the community so far. With parameters providing 233 bits of quantum security, our implementation requires 4,176,684 cycles for encryption and 25,640,380 cycles for decryption with masking and hiding countermeasures on a Cortex-M4F. The first-order security of our masked implementation is also practically verified using the non-specific t-test evaluation methodology.