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

Compact Encryption Based on Module-NTRU Problems

Shi Bai, Hansraj Jangir, Hao Lin, Tran Ngo, Weiqiang Wen, Jinwei Zheng

Published Jan 1, 2024• 6 citations
Publisher
DOI
10.1007/978-3-031-62743-9_13

Related papers

BI-NTRU Encryption Schemes: Two New Secure Variants of NTRU

Michel Seck, Djiby Sow

Communications in computer and information science•Jan 1, 2019•6 citations

Efficient Identity-Based Encryption over NTRU Lattices

Léo Ducas, Vadim Lyubashevsky, Thomas Prest

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

On adapting NTRU for Post-Quantum Public-Key Encryption

Eodardo Signorini, Guglielmo Morgari, Simone Dutto

•Jan 1, 2024•0 citations

Multi-key fully homomorphic encryption from NTRU and (R)LWE with faster bootstrapping

Kexin Xu, Benjamin Hong Meng Tan, Liping Wang +2 more

Theoretical Computer Science•Jun 12, 2023•16 citations

Identity-based Linkable Ring Signcryption on NTRU Lattice

Xiaofang Huang

Although the current lattice-based ring signcryption scheme resists quantum attacks,it has large key storage and high encryption/decryption time.The linkable lattice ring signcryption scheme not only can protect signer anonymity,but also can determine whether two signatures are generated by the same signer.Thus,based on the compact Gaussian sampling algorithm and rejection sampling technique,the identity-based linkable ring signcryption scheme is constructed on the NTRU lattice.Firstly,the system master key is generated using the trapdoor generation algorithm on the NTRU lattice.Then private keys of ring members are obtained based on the compact Gaussian sampling algorithm.Finally,the user signature is generated using rejection sampling,and the key encapsulation mechanism encrypts the signature.Security proof in the random oracle model (ROM) that DRLWE and NTRU small integer solutions are difficult to solve ensures confidentiality,unforgeability,unconditional anonymity,and linkability.Performance analysis shows that compared to the lattice-based ring signcryption and linkable ring signature schemes on NTRU,the proposed scheme has a smaller public key and lower encryption/decryption cost,greatly improving efficiency.

•Sep 1, 2025•0 citations

Lattice-Based Cryptography and NTRU

Duncan A. Buell

Undergraduate topics in computer science•Jan 1, 2021•2 citations
Although the current lattice-based ring signcryption scheme resists quantum attacks,it has large key storage and high encryption/decryption time.The linkable lattice ring signcryption scheme not only can protect signer anonymity,but also can determine whether two signatures are generated by the same signer.Thus,based on the compact Gaussian sampling algorithm and rejection sampling technique,the identity-based linkable ring signcryption scheme is constructed on the NTRU lattice.Firstly,the system master key is generated using the trapdoor generation algorithm on the NTRU lattice.Then private keys of ring members are obtained based on the compact Gaussian sampling algorithm.Finally,the user signature is generated using rejection sampling,and the key encapsulation mechanism encrypts the signature.Security proof in the random oracle model (ROM) that DRLWE and NTRU small integer solutions are difficult to solve ensures confidentiality,unforgeability,unconditional anonymity,and linkability.Performance analysis shows that compared to the lattice-based ring signcryption and linkable ring signature schemes on NTRU,the proposed scheme has a smaller public key and lower encryption/decryption cost,greatly improving efficiency.