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

Journal of Discrete Mathematical Sciences and Cryptography

Secure public key encryption and key encapsulation mechanism based on group ring learning with errors problem

Gaurav Mittal, Sandeep Kumar, Sunil Kumar, Shiv Narain, Yogesh K. Gupta

Published Dec 19, 2024• 1 citation
Publisher

Abstract

In this paper, our main aim is to propose a group ring analogue of the well-known learning with errors problem and discuss its security. Using this novel problem, we construct IND-CPA secure public key encryption scheme and IND-CCA secure key encapsulation mechanism. We also discuss a toy example relevant to our encryption scheme.
DOI
10.47974/jdmsc-2131

Related papers

Efficient chosen ciphertext secure key encapsulation mechanism in standard model over ideal lattices

Xiaopeng Yang, Wenping Ma, Chengli Zhang

Key encapsulation mechanism (KEM) is an important key distribution mechanism that not only allows both sender and receiver to safely share a random session key, but also can be mainly applied to construct a hybrid public key encryption scheme. In this paper, we give an positive answer to the question of if it is possible to build an efficient KEM over lattices. More precisely, we design an efficient KEM scheme in standard model based on ideal lattices. We prove that the proposed scheme captures indistinguishability against active chosen ciphertext attacks (IND-CCA) under the ring learning with errors problem, or more formally, IND-CCA security. Compared with the current CCA secure KEM schemes based on lattices in the standard model, our scheme has shorter public key, secret key and encapsulation ciphertext. In addition, our KEM scheme realizes IND-CCA security in the standard model.

International Journal of Computer Mathematics•Feb 6, 2016•4 citations

Symmetric and asymmetric encryption schemes based on ill-posed inverse problems

Gaurav Mittal, Saibal Kumar Pal

In this work, we unveil an analogy between the well-known lattice based learning with error problem and ill-posed inverse problems. We show that LWE problem is a structured inverse problem. Further, we propose a symmetric encryption scheme based on ill-posed problems and thoroughly discuss its security. Finally, we propose a public key encryption scheme based on our symmetric encryption scheme and CRYSTALS-Kyber KEM (key encapsulation mechanism) and discuss its security.

Az Eszterházy Károly Tanárképző Főiskola tudományos közleményei. Tanulmányok a matematikai tudományok köréből/Az Eszterházy Károly Főiskola tudományos közleményei. Tanulmányok a matematikai tudományok köréből/Annales mathematicae et informaticae•Jan 1, 2026•0 citations

A Latticed-Based Public Key Encryption with KDM Security from R-LWE

Yan Fang Wu, Zheng Huang, Qiao Yan Wen

Since the introduction of the ring learning with errors (R-LWE) by Lyubashevsky, Peikert and Regev, many efficient and secure applications were founded in cryptography. In this paper, we mainly present an efficient public-key encryption scheme based on the R-LWE assumption. It is very simple to describe and analyze. As well as it can achieve security against certain key-dependent message (KDM) attacks. Namely, this efficient encryption scheme can securely encrypt its own secret key. The security of this scheme follows from the already proven hardness of the R-LWE problem since the R-LWE assumption is reducible to worst-case problems on the ideal lattice. Besides, the scheme enjoys a high level efficiency and low cost since the operations of the scheme are very simple and fast. The cost of both the encryption and decryption is only polylog(n) bit per message symbol.

Advanced engineering forum•Sep 1, 2012•0 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

Analogy between Learning With Error Problem and Ill-Posed Inverse Problems

Gaurav Mittal

In this work, we unveil an analogy between well-known lattice based learning with error problem and ill-posed inverse problems. We show that LWE problem is a structured inverse problem. Further, we propose a symmetric encryption scheme based on ill-posed problems and thoroughly discuss its security. Finally, we propose a public key encryption scheme based on our symmetric encryption scheme and CRYSTALS-Kyber KEM (key encapsulation mechanism) and discuss its security.

arXiv:2508.21653•Aug 29, 2025•0 citations

Efficient Quantum Public-Key Encryption From Learning With Errors

Javad Doliskani

Our main result is a quantum public-key encryption scheme based on the Extrapolated Dihedral Coset problem (EDCP) which is equivalent, under quantum polynomial-time reductions, to the Learning With Errors (LWE) problem. For limited number of public keys (roughly linear in the security parameter), the proposed scheme is information-theoretically secure. For polynomial number of public keys, breaking the scheme is as hard as solving the LWE problem. The public keys in our scheme are quantum states of size $\tilde{O}(n)$ qubits. The key generation and decryption algorithms require $\tilde{O}(n)$ qubit operations while the encryption algorithm takes $O(1)$ qubit operations.

arXiv:2105.12790•May 26, 2021•7 citations
Key encapsulation mechanism (KEM) is an important key distribution mechanism that not only allows both sender and receiver to safely share a random session key, but also can be mainly applied to construct a hybrid public key encryption scheme. In this paper, we give an positive answer to the question of if it is possible to build an efficient KEM over lattices. More precisely, we design an efficient KEM scheme in standard model based on ideal lattices. We prove that the proposed scheme captures indistinguishability against active chosen ciphertext attacks (IND-CCA) under the ring learning with errors problem, or more formally, IND-CCA security. Compared with the current CCA secure KEM schemes based on lattices in the standard model, our scheme has shorter public key, secret key and encapsulation ciphertext. In addition, our KEM scheme realizes IND-CCA security in the standard model.
Since the introduction of the ring learning with errors (R-LWE) by Lyubashevsky, Peikert and Regev, many efficient and secure applications were founded in cryptography. In this paper, we mainly present an efficient public-key encryption scheme based on the R-LWE assumption. It is very simple to describe and analyze. As well as it can achieve security against certain key-dependent message (KDM) attacks. Namely, this efficient encryption scheme can securely encrypt its own secret key. The security of this scheme follows from the already proven hardness of the R-LWE problem since the R-LWE assumption is reducible to worst-case problems on the ideal lattice. Besides, the scheme enjoys a high level efficiency and low cost since the operations of the scheme are very simple and fast. The cost of both the encryption and decryption is only polylog(n) bit per message symbol.
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.
Our main result is a quantum public-key encryption scheme based on the Extrapolated Dihedral Coset problem (EDCP) which is equivalent, under quantum polynomial-time reductions, to the Learning With Errors (LWE) problem. For limited number of public keys (roughly linear in the security parameter), the proposed scheme is information-theoretically secure. For polynomial number of public keys, breaking the scheme is as hard as solving the LWE problem. The public keys in our scheme are quantum states of size O~(n)\tilde{O}(n)O~(n) qubits. The key generation and decryption algorithms require O~(n)\tilde{O}(n)O~(n) qubit operations while the encryption algorithm takes O(1)O(1)O(1) qubit operations.