Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

A Thorough Treatment of Highly-Efficient NTRU Instantiations

Julien Duman, Kathrin Hövelmanns, Eike Kiltz, Vadim Lyubashevsky, Gregor Seiler, Dominique Unruh

Published Jan 1, 2023• 19 citations
Publisher
DOI
10.1007/978-3-031-31368-4_3

Related papers

Fast Multi-key Bootstrapping Instantiated with NTRU and (R)LWE

Zhen Han, Jiasi Weng, sen Dong +1 more

Lecture notes in computer science•Jan 1, 2026•0 citations

On the Efficiency of Provably Secure NTRU

Daniel Cabarcas, Patrick Weiden, Johannes A Buchmann

Lecture notes in computer science•Jan 1, 2014•15 citations

Compact and Efficient Kems Over Ntru Lattices

Zhichuang Liang, Boyue Fang, Jieyu Zheng +1 more

•Jan 1, 2023•4 citations

Compact and efficient KEMs over NTRU lattices

Zhichuang Liang, Boyue Fang, Jieyu Zheng +1 more

Computer Standards & Interfaces•Jan 2, 2024•9 citations

On the hardness of NTRU problems

Yang Wang, Mingqiang Wang

Frontiers of Computer Science•Apr 2, 2022•1 citation

Lattice signatures using NTRU on the hardness of worst‐case ideal lattice problems

Dipayan Das, Vishal Saraswat, Kajla Basu

Recently, lattice signatures based on the Fiat‐Shamir framework have seen a lot of improvements which are efficient in practice. The security of these signature schemes depends mainly on the hardness of solving short integer solutions (SIS) and/or learning with errors problem in the random oracle model. The authors propose an alternative lattice‐based signature scheme on the Fiat‐Shamir framework over the ring . The key generation in the signature scheme is based on the combination of NTRU and Ring SIS like key generation. Both the signature and the verification are done efficiently by doing polynomial convolutions in the ring . The proposed signature scheme is provably secure based on the hardness of the Ring SIS problem in the random oracle model. The scheme is also efficient up to constant factors as the highly practical schemes which have provable secure instantiation.

IET Information Security•Jun 2, 2020•5 citations
Recently, lattice signatures based on the Fiat‐Shamir framework have seen a lot of improvements which are efficient in practice. The security of these signature schemes depends mainly on the hardness of solving short integer solutions (SIS) and/or learning with errors problem in the random oracle model. The authors propose an alternative lattice‐based signature scheme on the Fiat‐Shamir framework over the ring . The key generation in the signature scheme is based on the combination of NTRU and Ring SIS like key generation. Both the signature and the verification are done efficiently by doing polynomial convolutions in the ring . The proposed signature scheme is provably secure based on the hardness of the Ring SIS problem in the random oracle model. The scheme is also efficient up to constant factors as the highly practical schemes which have provable secure instantiation.