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 Systems Architecture

PQES: Post-quantum encryption and signature scheme based on FFT-accelerated polynomial ring lattice for IoT devices

Zexiang Zhang, Rao Hong, Shaoqing Jia, Huiling Feng, Shuanggen Liu

Published Jul 15, 2025• 4 citations
Publisher
DOI
10.1016/j.sysarc.2025.103515

Related papers

Post-quantum lattice-based attribute encryption with user revocation and privacy for edge-IoT devices

Saima Hasib, Akhtar Rasool, Manasi Gyanchandani

Cluster Computing•Sep 1, 2026•0 citations

Lattice-Based Cryptography for Internet-of-Things in Post-quantum Computing

Levi Palmer, Yousef Fazea

Lecture notes on data engineering and communications technologies•Jan 1, 2024•3 citations

A Post-Quantum Public-Key Signcryption Scheme over Scalar Integers Based on a Modified LWE Structure

Mostefa Kara, Mohammad Ali A. Hammoudeh, Abdullah Alamri +1 more

To ensure confidentiality and integrity in the era of quantum computing, most post-quantum cryptographic schemes are designed to achieve either encryption or digital signature functionalities separately. Although a few signcryption schemes exist that combine these operations into a single, more efficient process, they typically rely on complex vector, matrix, or polynomial-based structures. In this work, a novel post-quantum public-key encryption and signature (PQES) scheme based entirely on scalar integer operations is presented. The proposed scheme employs a simplified structure where the ciphertext, keys, and core cryptographic operations are defined over scalar integers modulo n, significantly reducing computational and memory overhead. By avoiding high-dimensional lattices or ring-based constructions, the PQES approach enhances implementability on constrained devices while maintaining strong security properties. The design is inspired by modified learning-with-errors (LWE) assumptions, adapted to scalar settings, making it suitable for post-quantum applications. Security and performance evaluations, achieving a signcryption time of 0.0007 s and an unsigncryption time of 0.0011 s, demonstrate that the scheme achieves a practical balance between efficiency and resistance to quantum attacks.

Sensors•Jul 31, 2025•3 citations

Efficient Lattice-Based Digital Signatures for Embedded IoT Systems

Maksim Iavich, Nursulu A. Kapalova, Kairat Sakan

This paper offers a lattice-based digital signature construction, optimized for the provision of post-quantum security in resource-constrained environments, such as Internet of Things (IoT) devices. The offered scheme is built upon structured hardness assumptions, defined over polynomial rings that exhibit inherent algebraic symmetry. By exploiting the cyclic properties of these ring structures and implementing efficient Number Theoretic Transforms (NTTs), the construction achieves compact signatures that are under 3 KB and a runtime feasibility that uses less than 10 KB of RAM. The signature generation process incorporates balanced rejection sampling and carefully designed polynomial encodings that preserve structural regularity and computational efficiency. The security of the offered scheme is proven. The benchmark results generated from using the ARM Cortex-M4 platform demonstrate its practical usability. This study highlights how symmetric algebraic frameworks based on lattice-based cryptography can be leveraged to achieve both theoretical security and real-world performance in the post-quantum era.

Symmetry•Sep 12, 2025•6 citations

Lattice-based cryptosystems for the security of resource-constrained IoT devices in post-quantum world: a survey

Kübra Seyhan, Tu N. Nguyen, Sedat Akleylek +1 more

Cluster Computing•Aug 13, 2021•71 citations

PQS-AKA: Post-Quantum Secure Lightweight Authenticated Lattice-Based Key Agreement for IoT Communications

Ajeet Pratap Singh, Appala Naidu Tentu, K. Gangadhara Rao

Lecture notes in networks and systems•Jan 1, 2025•0 citations
To ensure confidentiality and integrity in the era of quantum computing, most post-quantum cryptographic schemes are designed to achieve either encryption or digital signature functionalities separately. Although a few signcryption schemes exist that combine these operations into a single, more efficient process, they typically rely on complex vector, matrix, or polynomial-based structures. In this work, a novel post-quantum public-key encryption and signature (PQES) scheme based entirely on scalar integer operations is presented. The proposed scheme employs a simplified structure where the ciphertext, keys, and core cryptographic operations are defined over scalar integers modulo n, significantly reducing computational and memory overhead. By avoiding high-dimensional lattices or ring-based constructions, the PQES approach enhances implementability on constrained devices while maintaining strong security properties. The design is inspired by modified learning-with-errors (LWE) assumptions, adapted to scalar settings, making it suitable for post-quantum applications. Security and performance evaluations, achieving a signcryption time of 0.0007 s and an unsigncryption time of 0.0011 s, demonstrate that the scheme achieves a practical balance between efficiency and resistance to quantum attacks.
This paper offers a lattice-based digital signature construction, optimized for the provision of post-quantum security in resource-constrained environments, such as Internet of Things (IoT) devices. The offered scheme is built upon structured hardness assumptions, defined over polynomial rings that exhibit inherent algebraic symmetry. By exploiting the cyclic properties of these ring structures and implementing efficient Number Theoretic Transforms (NTTs), the construction achieves compact signatures that are under 3 KB and a runtime feasibility that uses less than 10 KB of RAM. The signature generation process incorporates balanced rejection sampling and carefully designed polynomial encodings that preserve structural regularity and computational efficiency. The security of the offered scheme is proven. The benchmark results generated from using the ARM Cortex-M4 platform demonstrate its practical usability. This study highlights how symmetric algebraic frameworks based on lattice-based cryptography can be leveraged to achieve both theoretical security and real-world performance in the post-quantum era.