판 이력 — On the hardness of the NTRU problem | AIChainDay