Time-Complexity Characterization of NIST Lightweight Cryptography Finalists

• URL: http://arxiv.org/abs/2602.05641v1
• Date: Thu, 05 Feb 2026 13:22:18 GMT
• Title: Time-Complexity Characterization of NIST Lightweight Cryptography Finalists
• Authors: Najmul Hasan, Prashanth BusiReddyGari,
• Abstract summary: Lightweight cryptography is becoming essential as emerging technologies in digital identity systems and Internet of Things verification continue to demand strong cryptographic assurance on devices with limited processing power, memory, and energy resources.<n>As these technologies move into routine use, they demand cryptographic primitives that maintain strong security and deliver predictable performance through clear theoretical models of time complexity.<n>Although NIST's lightweight cryptography project provides empirical evaluations of the ten finalist algorithms, a unified theoretical understanding of their time-complexity behavior remains absent.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Lightweight cryptography is becoming essential as emerging technologies in digital identity systems and Internet of Things verification continue to demand strong cryptographic assurance on devices with limited processing power, memory, and energy resources. As these technologies move into routine use, they demand cryptographic primitives that maintain strong security and deliver predictable performance through clear theoretical models of time complexity. Although NIST's lightweight cryptography project provides empirical evaluations of the ten finalist algorithms, a unified theoretical understanding of their time-complexity behavior remains absent. This work introduces a symbolic model that decomposes each scheme into initialization, data-processing, and finalization phases, enabling formal time-complexity derivation for all ten finalists. The results clarify how design parameters shape computational scaling on constrained mobile and embedded environments. The framework provides a foundation needed to distinguish algorithmic efficiency and guides the choice of primitives capable of supporting security systems in constrained environments.

Related papers

• Systematic Review of Lightweight Cryptographic Algorithms [0.764671395172401]
  AES, RSA, and DES are unsuitable for resource-constrained devices due to limited processing power, memory, and battery.<n>This paper provides a systematic review of lightweight cryptographic algorithms and the appropriateness of different algorithms in different areas such as IoT, RFID, and wireless sensor networks.<n>An overview of the evolution of lightweight cryptography based on those design trade-offs is also provided.
  arXiv  Detail & Related papers  (2026-02-16T13:23:03Z)
• Developing and Evaluating Lightweight Cryptographic Algorithms for Secure Embedded Systems in IoT Devices [0.0]
  The study presents novel lightweight algorithms that are founded upon the Feistel-network architecture and their safety under cryptanalytic attacks.<n>The results have shown that lightweight cryptography is an effective strategy that could be used to establish security and maintain performance in the IoT.
  arXiv  Detail & Related papers  (2026-01-06T12:45:12Z)
• A Fuzzy Logic-Based Cryptographic Framework For Real-Time Dynamic Key Generation For Enhanced Data Encryption [0.24629531282150874]
  Brute-force attacks, key compromise, and unauthorized access have become highly common cyber threats.<n>This research presents a novel fuzzy logic-based cryptographic framework that dynamically generates encryption keys in real-time.
  arXiv  Detail & Related papers  (2025-11-18T04:34:31Z)
• Unlocking Symbol-Level Precoding Efficiency Through Tensor Equivariant Neural Network [84.22115118596741]
  We propose an end-to-end deep learning (DL) framework with low inference complexity for symbol-level precoding.<n>We show that the proposed framework captures substantial performance gains of optimal SLP, while achieving an approximately 80-times speedup over conventional methods.
  arXiv  Detail & Related papers  (2025-10-02T15:15:50Z)
• Mapping Quantum Threats: An Engineering Inventory of Cryptographic Dependencies [0.0]
  The emergence of large-scale quantum computers, powered by algorithms like Shor's and Grover's, poses an existential threat to modern public-key cryptography.<n>This paper presents a systematic inventory of technologies exposed to quantum threats from the engineering perspective.
  arXiv  Detail & Related papers  (2025-09-29T11:30:17Z)
• Deep Learning-based Techniques for Integrated Sensing and Communication Systems: State-of-the-Art, Challenges, and Opportunities [54.12860202362483]
  This article comprehensively reviews recent developments and research on deep learning-based (DL-based) techniques for integrated sensing and communication (ISAC) systems.<n>ISAC is regarded as a key enabler for 6G and beyond networks, as many emerging applications, such as vehicular networks and industrial robotics, necessitate both sensing and communication capabilities.<n>As an alternative to conventional techniques, DL-based techniques offer efficient and near-optimal solutions with reduced computational complexity.
  arXiv  Detail & Related papers  (2025-08-23T22:27:51Z)
• Compressive Meta-Learning [49.300635370079874]
  Compressive learning is a framework that enables efficient processing by using random, non-linear features.<n>We propose a framework that meta-learns both the encoding and decoding stages of compressive learning methods.<n>We explore multiple applications -- including neural network-based compressive PCA, compressive ridge regression, compressive k-means, and autoencoders.
  arXiv  Detail & Related papers  (2025-08-14T22:08:06Z)
• Complexity of Post-Quantum Cryptography in Embedded Systems and Its Optimization Strategies [2.821324092673655]
  The National Institute of Standards and Technology (NIST) has initiated a standardization process for post-quantum cryptography (PQC) algorithms.<n>This paper first provides a comprehensive analysis of the hardware complexity of post-quantum cryptography (PQC) in embedded systems.<n>To address these challenges, this paper discusses optimization strategies such as pipelining, parallelization, and high-level synthesis.
  arXiv  Detail & Related papers  (2025-04-18T08:02:13Z)
• Cryptanalysis via Machine Learning Based Information Theoretic Metrics [58.96805474751668]
  We propose two novel applications of machine learning (ML) algorithms to perform cryptanalysis on any cryptosystem.<n>These algorithms can be readily applied in an audit setting to evaluate the robustness of a cryptosystem.<n>We show that our classification model correctly identifies the encryption schemes that are not IND-CPA secure, such as DES, RSA, and AES ECB, with high accuracy.
  arXiv  Detail & Related papers  (2025-01-25T04:53:36Z)
• Digital Twin-Assisted Federated Learning with Blockchain in Multi-tier Computing Systems [67.14406100332671]
  In Industry 4.0 systems, resource-constrained edge devices engage in frequent data interactions. This paper proposes a digital twin (DT) and federated digital twin (FL) scheme. The efficacy of our proposed cooperative interference-based FL process has been verified through numerical analysis.
  arXiv  Detail & Related papers  (2024-11-04T17:48:02Z)
• A Quantitative Security Analysis of S-boxes in the NIST Lightweight Cryptography Finalists [1.3349615170141398]
  In 2017, NIST put forward security requirements for a standard lightweight scheme.<n>In this paper, we evaluate the S-boxes of 6 NIST LWC competition finalists based on well-known cryptographic properties.
  arXiv  Detail & Related papers  (2024-04-09T07:56:52Z)
• Contextualizing MLP-Mixers Spatiotemporally for Urban Data Forecast at Scale [54.15522908057831]
  We propose an adapted version of the computationally-Mixer for STTD forecast at scale. Our results surprisingly show that this simple-yeteffective solution can rival SOTA baselines when tested on several traffic benchmarks. Our findings contribute to the exploration of simple-yet-effective models for real-world STTD forecasting.
  arXiv  Detail & Related papers  (2023-07-04T05:19:19Z)
• On Binding Objects to Symbols: Learning Physical Concepts to Understand Real from Fake [155.6741526791004]
  We revisit the classic signal-to-symbol barrier in light of the remarkable ability of deep neural networks to generate synthetic data. We characterize physical objects as abstract concepts and use the previous analysis to show that physical objects can be encoded by finite architectures. We conclude that binding physical entities to digital identities is possible in finite time with finite resources.
  arXiv  Detail & Related papers  (2022-07-25T17:21:59Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.