2 research outputs found
Memoryâconstrained implementation of latticeâbased encryption scheme on standard Java Card platform
Abstract The latticeâbased encryption scheme has high efficiency and reliability, and it can be run on small devices with limited memory capacity and computational resources such as sensor nodes or smart cards. The first implementation is presented of the original ringâlearningâwithâerrorsâbased encryption scheme on a standard Java Card platform by combining the number theoretic transform with improved Montgomery modular multiplication. Without any cryptographic coprocessor support, the decryption running time is around 7Â s, corresponding to the AESâ128 security level. Two efficient discrete Gaussian sampling approaches, known at the discrete Ziggurat sampling algorithm and KnuthâYao algorithm, were implemented on the Java Card and resulted in a reduction in running times. More important, polynomial modular multiplication is shown to perform efficiently on a standard Java Card platform even when the big integers and floatingâpoint number operations are not supported. The results show the feasibility of implementing more latticeâbased cryptosystems on existing memoryâconstrained Java Cards. A preliminary version of this paper appeared with the title âMemoryâconstrained implementation of latticeâbased encryption scheme on standard Java Cardâ in Proceedings of the 2017 IEEE International Symposium on Hardware Oriented Security and Trust (HOST)