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

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences

A Compact Digital Signature Scheme Based on the Module-LWR Problem

Hiroki Okada, Atsushi Takayasu, Kazuhide Fukushima, Shinsaku Kiyomoto, Tsuyoshi Takagi

Published Mar 18, 2021• 1 citation
Publisher

Abstract

We propose a new lattice-based digital signature scheme MLWRSign by modifying Dilithium, which is one of the second-round candidates of NIST's call for post-quantum cryptographic standards. To the best of our knowledge, our scheme MLWRSign is the first signature scheme whose security is based on the (module) learning with rounding (LWR) problem. Due to the simplicity of the LWR, the secret key size is reduced by approximately 30% in our scheme compared to Dilithium, while achieving the same level of security. Moreover, we implemented MLWRSign and observed that the running time of our scheme is comparable to that of Dilithium.

DOI
10.1587/transfun.2020dmp0012

Related papers

A Lattice-Based Threshold Signature Scheme for IoT Applications

Elizar Kustov

The advancement of quantum computing threatens classical cryptographic systems, such as RSA and ECDSA, which can be broken by quantum algorithms like Shor's algorithm. This necessitates the development of post-quantum cryptographic systems resistant to quantum attacks. Lattice-based cryptography, particularly the Learning with Errors (LWE) and Learning with Rounding (LWR) problems, is a promising approach. This paper presents a threshold signature scheme based on the Kryzhovnik signature, an adaptation of the Crystals-Dilithium scheme for LWR. The scheme leverages the hardness of the Module Learning with Rounding (MLWR) and Module Short Integer Solution (MSIS) problems to ensure post-quantum security. It allows a group of N participants to collaboratively generate a signature, requiring at least t participants to create a valid signature, preventing forgery by individual participants. The scheme uses Shamir's Secret Sharing, ensuring the shared secret is never stored explicitly. Key advantages include efficiency, security, and threshold-based access control, making it suitable for IoT and other resource-constrained environments.

Wave Electronics and its Application in Information and Telecommunication Systems (WECONF)•May 12, 2025•0 citations

A Blind Signature from Module Latices

Huy Quoc Le, Willy Susilo, Xuan Thanh Khuc +2 more

Since its birth by Chaum, blind signatures have become one of the fundamental components in the so-called e-cash or e-voting. The scheme ensures a message to be blinded before being signed. Among all lattice-based signatures submitted to NIST post-quantum cryptographic standardization, Dilithium is a very promising candidate. The scheme has some advantages such as simple to implement securely, conservative with parameters and minimal in total size of public key and signature. In this paper, we propose a blind signature scheme based on the framework of Dilithium in order to take advantages of Dilithium. The proposed scheme is blind and one-more unforgeable secure in the random oracle model under the hardness of the module Learning with Errors problem MLWE and the module short integer solution problem MSIS.

IEEE Conference on Dependable and Secure Computing (DSC)•Nov 1, 2019•12 citations

ModFalcon: Compact Signatures Based On Module-NTRU Lattices

Chitchanok Chuengsatiansup, Thomas Prest, Damien Stehlé +2 more

Lattices lead to promising practical post-quantum digital signatures, combining asymptotic efficiency with strong theoretical security guarantees. However, tuning their parameters into practical instantiations is a delicate task. On the one hand, NIST round~2 candidates based on Lyubashevsky's design (such as dilithium and qtesla) allow several tradeoffs between security and efficiency, but at the expense of a large bandwidth consumption. On the other hand, the hash-and-sign falcon signature is much more compact and is still very efficient, but it allows only two security levels, with large compactness and security gaps between them. We introduce a new family of signature schemes based on the falcon design, which relies on module lattices. Our concrete instantiation enjoys the compactness and efficiency of falcon, and allows an intermediate security level. It leads to the most compact lattice-based signature achieving a quantum security above 128 bits.

ACM Asia Conference on Computer and Communications Security (ASIA CCS)•Oct 5, 2020•47 citations

Post-Quantum Module Learning with Rounding-Based Public Key Encryption Using Incomplete Number Theoretic Transform

Anupama Arjun Pandit, Arun Mishra

Post Quantum Cryptographic (PQC) techniques are widely used in encryption standards and digital signatures. Lattice-based post-quantum cryptographic techniques have been reported in the last decades. The present work proposes an optimized quantum-safe lattice public key encryption (PKE) scheme based on the Module Learning with Rounding (MLWR) problem, enhanced by the use of Incomplete Number Theoretic Transform (NTT). The objective of the proposed scheme is to achieve efficient encryption and decryption while maintaining robust security in accordance with the National Institute of Standards and Technology (NIST) recommendations. The incomplete NTT relaxes the modulus q requirement, enables a smaller modulus for efficient arithmetic, and reduces computational complexity. This approach results in significant improvements in the speed of key generation, encryption, and decryption with a marked reduction in rejection probability, compared to schemes utilizing complete NTT. The proposed scheme demonstrates competitive performance against other lattice-based encryption schemes such as Kyber and Frodo. It shows lower encryption and decryption times while offering comparable security levels. Proposed scheme is at least a hundred times faster than Frodo lattice-based public-key encryption schemes. For NIST-recommended security level, in proposed scheme, each encryption needs an average of 300K CPU cycles, and each decryption needs 120K CPU cycles. Additionally, modulus 7937 enables a reduction in key and ciphertext sizes, optimizing the scheme for practical deployment in resource-constrained environments. Performance evaluations confirm the practicality of the scheme with substantial reductions in computational overhead, making it a highly efficient and secure candidate for post-quantum encryption.

International Journal of Advanced Computer Science and Applications•Jan 1, 2026•0 citations

Dilithium digital signature scheme

Onni Snåre

The development of quantum computers is a threat to current cryptographic algorithms, such as the RSA algorithm. Due to this, the development of post quantum cryptography is a topic of research. One digital signature algorithm that is proposed as a quantum proof solution is the Dilithium digital signature system. Dilithium is based on a learning with errors problem (LWE) in which the value of generated signatures includes an error term. The security of Dilithium is based on previous re- search on topics such as the Module LWE problem, the Fiat Shamir transformation with aborts and the Module Short integer solution problem (MSIS ). The reference implementation includes optimization in the signature generation process. By using the number theoretic transform the multiplication of the ring elements is point-wise or in other words in linear time. This thesis presents the mathematical foundations on which the systems security is based on. In addition, the security of digital signatures, identification schemes and the LWE problem are discussed. In the final chapter these topics are brought together to present the Dilithium scheme.

•Dec 18, 2025•0 citations

Exploring Lattice-based Post-Quantum Signature for JWT Authentication: Review and Case Study

Abdolmaged Alkhulaifi, El-Sayed M. El-Alfy

Due to the scalability of the stateless and compact JSON Web Tokens (JWT), they are increasingly used in securing modern applications to support single-sign-on context and establish trust in microservices or connected-devices architectures. However, currently JWT relies on traditional encryption algorithms that are based on integer factorization or discrete logarithm problems; this exposes JWT signatures to vulnerability when quantum computers become available. Recently, NIST has announced new standards which are quantum safe. In this paper, we investigate the usage of two quantum-resistant algorithms, which are NIST candidates of round 2 standardization process in 2019, to create and verify JWT signatures. Namely, we consider lattice-based schemes (DILITHIUM and qTESLA) and compare their performance against RSA for digital signature for different security levels defined by NIST. The results show that lattice-based digital signature schemes have better performance than RSA in terms of request per seconds and average response time. DILITHIUM has demonstrated the best performance while also having smaller performance loss when scaling the security level.

IEEE Vehicular Technology Conference•May 1, 2020•25 citations
We propose a new lattice-based digital signature scheme MLWRSign by modifying Dilithium, which is one of the second-round candidates of NIST's call for post-quantum cryptographic standards. To the best of our knowledge, our scheme MLWRSign is the first signature scheme whose security is based on the (module) learning with rounding (LWR) problem. Due to the simplicity of the LWR, the secret key size is reduced by approximately 30% in our scheme compared to Dilithium, while achieving the same level of security. Moreover, we implemented MLWRSign and observed that the running time of our scheme is comparable to that of Dilithium.
The advancement of quantum computing threatens classical cryptographic systems, such as RSA and ECDSA, which can be broken by quantum algorithms like Shor's algorithm. This necessitates the development of post-quantum cryptographic systems resistant to quantum attacks. Lattice-based cryptography, particularly the Learning with Errors (LWE) and Learning with Rounding (LWR) problems, is a promising approach. This paper presents a threshold signature scheme based on the Kryzhovnik signature, an adaptation of the Crystals-Dilithium scheme for LWR. The scheme leverages the hardness of the Module Learning with Rounding (MLWR) and Module Short Integer Solution (MSIS) problems to ensure post-quantum security. It allows a group of N participants to collaboratively generate a signature, requiring at least t participants to create a valid signature, preventing forgery by individual participants. The scheme uses Shamir's Secret Sharing, ensuring the shared secret is never stored explicitly. Key advantages include efficiency, security, and threshold-based access control, making it suitable for IoT and other resource-constrained environments.
Since its birth by Chaum, blind signatures have become one of the fundamental components in the so-called e-cash or e-voting. The scheme ensures a message to be blinded before being signed. Among all lattice-based signatures submitted to NIST post-quantum cryptographic standardization, Dilithium is a very promising candidate. The scheme has some advantages such as simple to implement securely, conservative with parameters and minimal in total size of public key and signature. In this paper, we propose a blind signature scheme based on the framework of Dilithium in order to take advantages of Dilithium. The proposed scheme is blind and one-more unforgeable secure in the random oracle model under the hardness of the module Learning with Errors problem MLWE and the module short integer solution problem MSIS.
Lattices lead to promising practical post-quantum digital signatures, combining asymptotic efficiency with strong theoretical security guarantees. However, tuning their parameters into practical instantiations is a delicate task. On the one hand, NIST round~2 candidates based on Lyubashevsky's design (such as dilithium and qtesla) allow several tradeoffs between security and efficiency, but at the expense of a large bandwidth consumption. On the other hand, the hash-and-sign falcon signature is much more compact and is still very efficient, but it allows only two security levels, with large compactness and security gaps between them. We introduce a new family of signature schemes based on the falcon design, which relies on module lattices. Our concrete instantiation enjoys the compactness and efficiency of falcon, and allows an intermediate security level. It leads to the most compact lattice-based signature achieving a quantum security above 128 bits.
Post Quantum Cryptographic (PQC) techniques are widely used in encryption standards and digital signatures. Lattice-based post-quantum cryptographic techniques have been reported in the last decades. The present work proposes an optimized quantum-safe lattice public key encryption (PKE) scheme based on the Module Learning with Rounding (MLWR) problem, enhanced by the use of Incomplete Number Theoretic Transform (NTT). The objective of the proposed scheme is to achieve efficient encryption and decryption while maintaining robust security in accordance with the National Institute of Standards and Technology (NIST) recommendations. The incomplete NTT relaxes the modulus q requirement, enables a smaller modulus for efficient arithmetic, and reduces computational complexity. This approach results in significant improvements in the speed of key generation, encryption, and decryption with a marked reduction in rejection probability, compared to schemes utilizing complete NTT. The proposed scheme demonstrates competitive performance against other lattice-based encryption schemes such as Kyber and Frodo. It shows lower encryption and decryption times while offering comparable security levels. Proposed scheme is at least a hundred times faster than Frodo lattice-based public-key encryption schemes. For NIST-recommended security level, in proposed scheme, each encryption needs an average of 300K CPU cycles, and each decryption needs 120K CPU cycles. Additionally, modulus 7937 enables a reduction in key and ciphertext sizes, optimizing the scheme for practical deployment in resource-constrained environments. Performance evaluations confirm the practicality of the scheme with substantial reductions in computational overhead, making it a highly efficient and secure candidate for post-quantum encryption.
The development of quantum computers is a threat to current cryptographic algorithms, such as the RSA algorithm. Due to this, the development of post quantum cryptography is a topic of research. One digital signature algorithm that is proposed as a quantum proof solution is the Dilithium digital signature system. Dilithium is based on a learning with errors problem (LWE) in which the value of generated signatures includes an error term. The security of Dilithium is based on previous re- search on topics such as the Module LWE problem, the Fiat Shamir transformation with aborts and the Module Short integer solution problem (MSIS ). The reference implementation includes optimization in the signature generation process. By using the number theoretic transform the multiplication of the ring elements is point-wise or in other words in linear time. This thesis presents the mathematical foundations on which the systems security is based on. In addition, the security of digital signatures, identification schemes and the LWE problem are discussed. In the final chapter these topics are brought together to present the Dilithium scheme.
Due to the scalability of the stateless and compact JSON Web Tokens (JWT), they are increasingly used in securing modern applications to support single-sign-on context and establish trust in microservices or connected-devices architectures. However, currently JWT relies on traditional encryption algorithms that are based on integer factorization or discrete logarithm problems; this exposes JWT signatures to vulnerability when quantum computers become available. Recently, NIST has announced new standards which are quantum safe. In this paper, we investigate the usage of two quantum-resistant algorithms, which are NIST candidates of round 2 standardization process in 2019, to create and verify JWT signatures. Namely, we consider lattice-based schemes (DILITHIUM and qTESLA) and compare their performance against RSA for digital signature for different security levels defined by NIST. The results show that lattice-based digital signature schemes have better performance than RSA in terms of request per seconds and average response time. DILITHIUM has demonstrated the best performance while also having smaller performance loss when scaling the security level.