TY - GEN
T1 - Memory-constrained implementation of lattice-based encryption scheme on standard Java Card
AU - Yuan, Ye
AU - Fukushima, Kazuhide
AU - Kiyomoto, Shinsaku
AU - Takagi, Tsuyoshi
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/6/16
Y1 - 2017/6/16
N2 - Since NSA announced the plans for transitioning to the algorithms which are resistant to attacks by the potential quantum computers, the interest of implementation of post-quantum cryptography (PQC) on various devices has emerged. Including widely used Java Card, memory-constrained smart cards need the efficient implementation of encryption schemes to resist quantum-computing attacks. Meanwhile, lattice-based cryptography, as one of the strongest candidates for PQC, has attracted wide attention due to their applicability and operating efficiency in recent years. However, due to the limited memory resources and computing power, long integer multiplication is a challenge on Java Card, and it had been considered that only a few lattice-based cryptosystems are fitting into such devices. In this paper, we show the first implementation of a lattice-based encryption scheme on standard Java Card whose running time is nearly optimal (about 100 seconds in decryption for 128-bit security) by combining the use of iterative fast Fourier transform and improved Montgomery modular multiplication. More importantly, we indicate that polynomial multiplication and over signed 15-bit integer arithmetic can be performed on Java Card even if the long integers are not supported, which makes running more lattice-based protocols on Java Card achievable.
AB - Since NSA announced the plans for transitioning to the algorithms which are resistant to attacks by the potential quantum computers, the interest of implementation of post-quantum cryptography (PQC) on various devices has emerged. Including widely used Java Card, memory-constrained smart cards need the efficient implementation of encryption schemes to resist quantum-computing attacks. Meanwhile, lattice-based cryptography, as one of the strongest candidates for PQC, has attracted wide attention due to their applicability and operating efficiency in recent years. However, due to the limited memory resources and computing power, long integer multiplication is a challenge on Java Card, and it had been considered that only a few lattice-based cryptosystems are fitting into such devices. In this paper, we show the first implementation of a lattice-based encryption scheme on standard Java Card whose running time is nearly optimal (about 100 seconds in decryption for 128-bit security) by combining the use of iterative fast Fourier transform and improved Montgomery modular multiplication. More importantly, we indicate that polynomial multiplication and over signed 15-bit integer arithmetic can be performed on Java Card even if the long integers are not supported, which makes running more lattice-based protocols on Java Card achievable.
UR - http://www.scopus.com/inward/record.url?scp=85025170503&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85025170503&partnerID=8YFLogxK
U2 - 10.1109/HST.2017.7951796
DO - 10.1109/HST.2017.7951796
M3 - Conference contribution
AN - SCOPUS:85025170503
T3 - Proceedings of the 2017 IEEE International Symposium on Hardware Oriented Security and Trust, HOST 2017
SP - 47
EP - 50
BT - Proceedings of the 2017 IEEE International Symposium on Hardware Oriented Security and Trust, HOST 2017
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 10th IEEE International Symposium on Hardware Oriented Security and Trust, HOST 2017
Y2 - 1 May 2017 through 5 May 2017
ER -