Paper 2018/1238 Original: eprint.iacr.org/2018/1238 ↗

Memory-Constrained Implementation of Lattice-based Encryption Scheme on the Standard Java Card Platform

Ye Yuan
Kazuhide Fukushima
Junting Xiao
Shinsaku Kiyomoto
Tsuyoshi Takagi
Abstract

Memory-constrained devices, including widely used smart cards, require resisting attacks by the quantum computers. Lattice-based encryption scheme possesses high efficiency and reliability which could run on small devices with limited storage capacity and computation resources such as IoT sensor nodes or smart cards. We present the first implementation of a lattice-based encryption scheme on the standard Java Card platform by combining number theoretic transform and improved Montgomery modular multiplication. The running time of decryption is nearly optimal (about 7 seconds for 128-bit security level). We also optimize discrete Ziggurat algorithm and Knuth-Yao algorithm to sample from prescribed probability distributions on the Java Card platform. More importantly, we indicate that polynomial multiplication can be performed on Java Card efficiently even if the long integers are not supported, which makes running more lattice-based cryptosystems on smart cards achievable.

Metadata
Available format(s)
PDF
Category
Implementation
Publication info
Preprint.
History
2018-12-31: last updated
2018-12-31: published
Short URL
https://ia.cr/2018/1238
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2018/1238,
      author = {Ye Yuan and Kazuhide Fukushima and Junting Xiao and Shinsaku Kiyomoto and Tsuyoshi Takagi},
      title = {Memory-Constrained Implementation of Lattice-based Encryption Scheme on the Standard Java Card Platform},
      howpublished = {Cryptology {ePrint} Archive, Paper 2018/1238},
      year = {2018},
      url = {https://eprint.iacr.org/2018/1238}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.