2016 · 101 citations · 15 references
ComputingComputer EngineeringComputer ScienceComputer SecurityCryptographyInternet Of ThingsCryptographic AlgorithmsCryptographic ArchitectureLattice-based CryptographyCryptanalysis Of Lattice SchemesEncryption Scheme SecurityEnergyLightweight CryptographyNtru CryptosystemPublic-key EncryptionRing Lattices
In the emerging Internet of Things, lightweight public-key cryptography is an essential component for many cost-efficient security solutions. Since conventional public-key schemes, such as ECC and RSA, remain expensive and energy hungry even after aggressive optimization, this work investigates a possible alternative. In particular, we show the practical potential of replacing the Gaussian noise distribution in the Ring-LWE based encryption scheme by Lindner and Peikert/Lyubashevsky et al. with a binary distribution. When parameters are carefully chosen, our construction is resistant against any state-of-the-art cryptanalytic techniques (e.g., attacks on original Ring-LWE or NTRU) and suitable for low-cost scenarios. In the end, our scheme can enable public-key encryption even on very small and low-cost 8-bit (ATXmega128) and 32-bit (Cortex-M0) microcontrollers.
15
On lattices, learning with errors, random linear codes, and cryptography
Oded Regev · Journal of the ACM · 2009 · 2.2K citations
On the concrete hardness of Learning with Errors
M. Albrecht, Rachel Player, Sam Scott · Journal of Mathematical Cryptology · 2015 · 789 citations · Full text
Classical hardness of learning with errors
Zvika Brakerski, Adeline Roux-Langlois, Chris Peikert et al. · 2013 · 597 citations