.png){kind=icon}
.png){kind=icon}
Return
NTRU plus : Compact Construction of NTRU Using Simple Encoding Method
.png){kind=icon}
PRE
AI
DOI：10.1109/TIFS.2023.3299172.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
NTRU was the first practical public key encryption scheme constructed on a lattice over a polynomial-based ring and has been considered secure against significant cryptanalytic attacks over the past few decades. However, NTRU and its variants suffer from several drawbacks, including difficulties in achieving worst-case correctness error in a moderate modulus, inconvenient sampling distributions for messages, and relatively slower algorithms compared to other lattice-based schemes. In this work, we propose a new NTRU-based key encapsulation mechanism (KEM), called NTRU+, which overcomes nearly all existing drawbacks. NTRU+ is constructed based on two new generic transformations: ACWC(2) and FO? (a variant of the Fujisaki-Okamoto transform). ACWC(2) is used to easily achieve worst-case correctness error, while FO? is used to achieve chosen-ciphertext security without re-encryption. Both ACWC(2) and FO? are defined using a randomness-recovery algorithm and an encoding method. In particular, our simple encoding method, the semi-generalized one-time pad (SOTP), allows us to sample a message from a natural bit-string space with an arbitrary distribution. We provide four parameter sets for NTRU+ and present implementation results using NTT-friendly rings over cyclotomic trinomials.
Keywords:
NTRU
RLWE
lattice-based cryptography
post-quantum cryptography
Journal
IF:
8
Papers:
5.2K
Citations:
2.3W