Paper 2014/514
On Constrained Implementation of Lattice-based Cryptographic Primitives and Schemes on Smart Cards
Ahmad Boorghany and Siavash Bayat Sarmadi and Rasool Jalili
Abstract
Most lattice-based cryptographic schemes with a security proof suffer from large key sizes and heavy computations. This is also true for the simpler case of authentication protocols which are used on smart cards, as a very-constrained computing environment. Recent progress on ideal lattices has significantly improved the efficiency, and made it possible to implement practical lattice-based cryptography on constrained devices. However, to the best of our knowledge, no previous attempts were made to implement lattice-based schemes on smart cards. In this paper, we provide the results of our implementation of several state-of-the-art lattice-based authentication protocols on smart cards and a microcontroller widely used in smart cards. Our results show that only a few of the proposed lattice-based authentication protocols can be implemented using limited resources of such constrained devices, however, cutting-edge ones are suitably-efficient to be used practically on smart cards. Moreover, we have implemented fast Fourier transform (FFT) and discrete Gaussian sampling with different typical parameters sets, as well as versatile lattice-based public-key encryptions. These results have noticeable points which help to design or optimize lattice-based schemes for constrained devices.
Metadata
- Available format(s)
- Category
- Implementation
- Publication info
- Preprint. MINOR revision.
- Keywords
- Authentication ProtocolsConstrained DevicesConstrained ImplementationLattice-based CryptographyPost-quantum Cryptography
- Contact author(s)
- boorghany @ ce sharif edu
- History
- 2014-11-16: last of 2 revisions
- 2014-07-02: received
- See all versions
- Short URL
- https://ia.cr/2014/514
- License
-
CC BY