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

Challenges for Ring-LWE.

Eric Crockett, Chris Peikert

Published Jan 1, 2016• 8 citations
OpenAlex

Related papers

The Hardness of LWE and Ring-LWE: A Survey.

David Balbás

•Jan 1, 2021•2 citations

On the Ring-LWE and Polynomial-LWE Problems

Miruna Roşca, Damien Stehlé, Alexandre Wallet

Lecture notes in computer science•Jan 1, 2018•111 citations

Module-LWE versus Ring-LWE, Revisited.

Yan Wang, Mingqiang Wang

•Jan 1, 2019•11 citations

Zero Knowledge Proofs from Ring-LWE

Xiang Xie, Rui Xue, Minqian Wang

Lecture notes in computer science•Jan 1, 2013•32 citations

Ring-LWE: Applications to Cryptography and Their Efficient Realization

Sujoy Sinha Roy, Angshuman Karmakar, Ingrid M.R. Verbauwhede

Lecture notes in computer science•Jan 1, 2016•9 citations

Public Key Encryption from MP-LWE for the Middle-Product One

Weixian Lai, Hao Lei, Lichun Li +1 more

Middle-Product Learning with Errors (MP-LWE) is a variant of the LWE problem introduced by Rosca et al., which achieves a trade-off between security and efficiency for lattice-based public-key encryption. In a nutshell, the public-key encryption based on MP-LWE outperform LWE-based schemes in efficiency while mitigating risks inherent in constructions from Polynomial/Ring LWE. A challenging problem is how to construct a PKE scheme whose security is based on some difficult problem that is the same hard as LWE, but it is of higher efficiency than existing LWE-based PKE schemes. In this paper, we solve this problem. First, we show MP-LWE for the middle-product one is of the same hard as LWE. Second, we propose a PKE scheme from MP-LWE for the middle-product one with shorter public key length than PKE scheme based on LWE.

•Jul 1, 2026•0 citations
Middle-Product Learning with Errors (MP-LWE) is a variant of the LWE problem introduced by Rosca et al., which achieves a trade-off between security and efficiency for lattice-based public-key encryption. In a nutshell, the public-key encryption based on MP-LWE outperform LWE-based schemes in efficiency while mitigating risks inherent in constructions from Polynomial/Ring LWE. A challenging problem is how to construct a PKE scheme whose security is based on some difficult problem that is the same hard as LWE, but it is of higher efficiency than existing LWE-based PKE schemes. In this paper, we solve this problem. First, we show MP-LWE for the middle-product one is of the same hard as LWE. Second, we propose a PKE scheme from MP-LWE for the middle-product one with shorter public key length than PKE scheme based on LWE.