Ye Yuan

TL;DR: This paper shows the first implementation of a lattice-based encryption scheme on standard Java Card whose running time is nearly optimal by combining the use of iterative fast Fourier transform and improved Montgomery modular multiplication and indicates that polynomial multiplication and over signed 15-bit integer arithmetic can be performed on Java Card even if the long integers are not supported.

TL;DR: This work investigates and implements several recent lattice-based encryption schemes and public-key exchange protocols including Lizard, ring-Lizard, Kyber, Frodo, and NewHope in JavaScript, which are the active candidates of postquantum cryptography due to their applicabilities and efficiencies and shows that implementing lattices-based cryptography on JavaScript-enabled platforms is achievable and results in desirable portability.

TL;DR: The first implementation of lattice-based encryption scheme on the standard Java Card platform by combining number theoretic transform and improved Montgomery modular multiplication was presented in this article. But the running time of decryption is nearly optimal (about 7 seconds for 128-bit security level).

TL;DR: It is indicated 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.