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

Communications in computer and information science

New Trapdoor and Preimage Sampling on NTRU Lattice

Chengrong Liu, Chunming Tang, Huiwen Jia

Published Jan 1, 2022• 0 citations
Publisher
DOI
10.1007/978-981-19-8445-7_18

Related papers

A New Trapdoor over Module-NTRU Lattice and its Application to ID-based Encryption.

Jung Hee Cheon, Duhyeong Kim, Tae-Chan Kim +1 more

•Jan 1, 2019•6 citations

A new Gaussian sampling for trapdoor lattices with arbitrary modulus

Yupu Hu, Huiwen Jia

Designs Codes and Cryptography•Apr 30, 2019•11 citations

Simple Lattice Trapdoor Sampling from a Broad Class of Distributions

Vadim Lyubashevsky, Daniel Wichs

Lecture notes in computer science•Jan 1, 2015•50 citations

A Comparative Study of Trapdoor Sampling Algorithms for Lattice-Based Cryptography

R. Ajay Srivatsan, Sai Karthik Rajan, Uthara Nair +1 more

Lecture notes in networks and systems•Jan 1, 2026•0 citations

GPV Preimage Sampling with Weak Smoothness and Its Applications to Lattice Signatures

Shiduo Zhang, Huiwen Jia, Delong Ran +3 more

Lecture notes in computer science•Dec 7, 2025•3 citations

A Lattice-based Signcryption Scheme Without Trapdoors

LU Xiu-hua, Wen Qiao-yan, Licheng Wang +1 more

The existing lattice-based signcryption schemes are based on trapdoor generation algorithm and preimage sample algorithm. However, both algorithms are complex, require a lot of time to run, and affect the efficiency of latticed-based signcryption schemes deeply. To solve this problem, the first lattice-based signcryption scheme without trapdoor generation algorithm and preimage sample algorithm is proposed, with the help of the technique of lattice signatures without trapdoors and the associated signature compression technique, as well as the encryption method based on the learning with errors assumption. The scheme achieves indistinguishability against adaptive chosen ciphertext attacks under the learning with errors assumption. It also achieves existential unforgeability against adaptive chosen message attacks under the small integer solution assumption. The proposed scheme is not only quantum resistant, but also efficient.

JOURNAL OF ELECTRONICS INFORMATION TECHNOLOGY•Sep 19, 2016•7 citations
The existing lattice-based signcryption schemes are based on trapdoor generation algorithm and preimage sample algorithm. However, both algorithms are complex, require a lot of time to run, and affect the efficiency of latticed-based signcryption schemes deeply. To solve this problem, the first lattice-based signcryption scheme without trapdoor generation algorithm and preimage sample algorithm is proposed, with the help of the technique of lattice signatures without trapdoors and the associated signature compression technique, as well as the encryption method based on the learning with errors assumption. The scheme achieves indistinguishability against adaptive chosen ciphertext attacks under the learning with errors assumption. It also achieves existential unforgeability against adaptive chosen message attacks under the small integer solution assumption. The proposed scheme is not only quantum resistant, but also efficient.