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

Ring-LWE: Applications to Cryptography and Their Efficient Realization

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

Published Jan 1, 2016• 9 citations
Publisher
DOI
10.1007/978-3-319-49445-6_18

Related papers

Integer Version of Ring-LWE and Its Applications

Chunsheng Gu

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

Efficient Linear Homomorphic Encryption from LWE Over Rings

Ting Wang, Jianping Yu, Peng Zhang +1 more

Wireless Personal Communications•Jul 29, 2013•2 citations

Efficient Protocols for Oblivious Linear Function Evaluation from Ring-LWE

Carsten Baum, Daniel E. Escudero, Alberto Pedrouzo-Ulloa +2 more

Lecture notes in computer science•Jan 1, 2020•20 citations

One Sample Ring-LWE with Rounding and Its Application to Key Exchange

Jíntai Ding, Xinwei Gao, Tsuyoshi Takagi +1 more

Lecture notes in computer science•Jan 1, 2019•14 citations

The Ring-LWE Problem in Lattice-Based Cryptography: The Case of Twisted Embeddings

Jheyne Nayara Ortiz, Robson Ricardo de Araujo, Diego F. Aranha +2 more

Several works have characterized weak instances of the Ring-LWE problem by exploring vulnerabilities arising from the use of algebraic structures. Although these weak instances are not addressed by worst-case hardness theorems, enabling other ring instantiations enlarges the scope of possible applications and favors the diversification of security assumptions. In this work, we extend the Ring-LWE problem in lattice-based cryptography to include algebraic lattices, realized through twisted embeddings. We define the class of problems Twisted Ring-LWE, which replaces the canonical embedding by an extended form. By doing so, we allow the Ring-LWE problem to be used over maximal real subfields of cyclotomic number fields. We prove that Twisted Ring-LWE is secure by providing a security reduction from Ring-LWE to Twisted Ring-LWE in both search and decision forms. It is also shown that the twist factor does not affect the asymptotic approximation factors in the worst-case to average-case reductions. Thus, Twisted Ring-LWE maintains the consolidated hardness guarantee of Ring-LWE and increases the existing scope of algebraic lattices that can be considered for cryptographic applications. Additionally, we expand on the results of Ducas and Durmus (Public-Key Cryptography, 2012) on spherical Gaussian distributions to the proposed class of lattices under certain restrictions. As a result, sampling from a spherical Gaussian distribution can be done directly in the respective number field while maintaining its format and standard deviation when seen in Zn via twisted embeddings.

Entropy•Aug 26, 2021•16 citations

Limits on the Efficiency of (Ring) LWE-Based Non-interactive Key Exchange

Siyao Guo, Pritish Kamath, Alon Rosen +1 more

Journal of Cryptology•Oct 25, 2021•14 citations
Several works have characterized weak instances of the Ring-LWE problem by exploring vulnerabilities arising from the use of algebraic structures. Although these weak instances are not addressed by worst-case hardness theorems, enabling other ring instantiations enlarges the scope of possible applications and favors the diversification of security assumptions. In this work, we extend the Ring-LWE problem in lattice-based cryptography to include algebraic lattices, realized through twisted embeddings. We define the class of problems Twisted Ring-LWE, which replaces the canonical embedding by an extended form. By doing so, we allow the Ring-LWE problem to be used over maximal real subfields of cyclotomic number fields. We prove that Twisted Ring-LWE is secure by providing a security reduction from Ring-LWE to Twisted Ring-LWE in both search and decision forms. It is also shown that the twist factor does not affect the asymptotic approximation factors in the worst-case to average-case reductions. Thus, Twisted Ring-LWE maintains the consolidated hardness guarantee of Ring-LWE and increases the existing scope of algebraic lattices that can be considered for cryptographic applications. Additionally, we expand on the results of Ducas and Durmus (Public-Key Cryptography, 2012) on spherical Gaussian distributions to the proposed class of lattices under certain restrictions. As a result, sampling from a spherical Gaussian distribution can be done directly in the respective number field while maintaining its format and standard deviation when seen in Zn via twisted embeddings.