Lightweight Hybrid Block-Stream Cryptographic Algorithm for the Internet of Things

• URL: http://arxiv.org/abs/2505.08840v1
• Date: Tue, 13 May 2025 11:29:20 GMT
• Title: Lightweight Hybrid Block-Stream Cryptographic Algorithm for the Internet of Things
• Authors: Arsalan Vahi, Mirkamal Mirnia,
• Abstract summary: algorithm is designed specifically for application in Internet of Things (IoT) technology devices.<n>Design concept of this algorithm is based on the integration of a pseudo-random permutation function and a pseudo-random generator function.<n>Security analyses conducted on the algorithm, along with the results of NIST statistical tests, confirm its robustness against most common and advanced cryptographic attacks.
• Score: 1.6114012813668932
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this thesis, a novel lightweight hybrid encryption algorithm named SEPAR is proposed, featuring a 16-bit block length and a 128-bit initialization vector. The algorithm is designed specifically for application in Internet of Things (IoT) technology devices. The design concept of this algorithm is based on the integration of a pseudo-random permutation function and a pseudo-random generator function. This intelligent combination not only enhances the algorithm's resistance against cryptographic attacks but also improves its processing speed. The security analyses conducted on the algorithm, along with the results of NIST statistical tests, confirm its robustness against most common and advanced cryptographic attacks, including linear and differential attacks. The proposed algorithm has been implemented on various software platform architectures. The software implementation was carried out on three platforms: 8-bit, 16-bit, and 32-bit architectures. A comparative analysis with the BORON algorithm on a 32-bit ARM processor indicates a performance improvement of 42.25%. Furthermore, implementation results on 8-bit and 16-bit microcontrollers demonstrate performance improvements of 87.91% and 98.01% respectively, compared to the PRESENT cipher.

Related papers

• KScaNN: Scalable Approximate Nearest Neighbor Search on Kunpeng [46.35664429179457]
  A naive port of existing x86 ANNS algorithms to ARM platforms results in a substantial performance deficit.<n>We introduce KScaNN, a novel ANNS algorithm co-designed for the Kunpeng 920 ARM architecture.
  arXiv  Detail & Related papers  (2025-11-05T09:01:32Z)
• Perturbation-efficient Zeroth-order Optimization for Hardware-friendly On-device Training [48.13509528824236]
  Zeroth-order (ZO) optimization is an emerging deep neural network (DNN) training paradigm that offers computational simplicity and memory savings.<n>ZO requires generating a substantial number of Gaussian random numbers, which poses significant difficulties and even makes it infeasible for hardware platforms, such as FPGAs and ASICs.<n>We propose PeZO, a perturbation-efficient ZO framework that significantly reduces the demand for random number generation.<n>Our experiments show that PeZO reduces the required LUTs and FFs for random number generation by 48.6% and 12.7%, and saves at maximum 86% power consumption
  arXiv  Detail & Related papers  (2025-04-28T23:58:07Z)
• Qubit Optimized Quantum Implementation of SLIM [0.0]
  We introduce a novel quantum implementation of SLIM, a lightweight block cipher optimized for 32-bit plaintext and an 80-bit key.<n>This work highlights SLIM's potential as a resource-efficient and secure candidate for quantum-resistant encryption protocols.
  arXiv  Detail & Related papers  (2024-12-14T13:52:36Z)
• HAPM -- Hardware Aware Pruning Method for CNN hardware accelerators in resource constrained devices [44.99833362998488]
  The present work proposes a generic hardware architecture ready to be implemented on FPGA devices. The inference speed of the design is evaluated over different resource constrained FPGA devices. We demonstrate that our hardware-aware pruning algorithm achieves a remarkable improvement of a 45 % in inference time compared to a network pruned using the standard algorithm.
  arXiv  Detail & Related papers  (2024-08-26T07:27:12Z)
• Lightweight Cryptanalysis of IoT Encryption Algorithms : Is Quota Sampling the Answer? [0.0]
  Two well-known lightweight algorithms are SIMON and SIMECK which have been specifically designed for use on resource-constrained IoT devices. It is necessary to test these algorithms for resilience against differential cryptanalysis attacks. In this paper, we introduce Versatile Investigative Sampling Technique for Advanced Cryptanalysis.
  arXiv  Detail & Related papers  (2024-04-12T00:08:39Z)
• Improving the Performance of Digitized Counterdiabatic Quantum Optimization via Algorithm-Oriented Qubit Mapping [0.4681661603096333]
  This paper presents strategies to improve the performance of digitized counterdiabatic quantum optimization algorithms. Our approach increases the approximation ratio by an average of 4.49$times$ without error mitigation. Our findings provide valuable insights into the codesign of algorithm implementation, tailored to optimize qubit mapping and algorithm parameters.
  arXiv  Detail & Related papers  (2023-11-24T17:39:08Z)
• Efficient Hardware Implementation of Constant Time Sampling for HQC [2.5234156040689237]
  HQC is one of the code-based finalists in the last round of the NIST post quantum cryptography standardization process.<n>A critical compute kernel with respect to efficient hardware implementations and security in HQC is the sampling method used to derive random numbers.<n>Due to its security criticality, recently an updated sampling algorithm was presented to increase its robustness against side-channel attacks.
  arXiv  Detail & Related papers  (2023-09-28T14:57:48Z)
• Efficient Convex Algorithms for Universal Kernel Learning [46.573275307034336]
  An ideal set of kernels should: admit a linear parameterization (for tractability); dense in the set of all kernels (for accuracy) Previous algorithms for optimization of kernels were limited to classification and relied on computationally complex Semidefinite Programming (SDP) algorithms. We propose a SVD-QCQPQP algorithm which dramatically reduces the computational complexity as compared with previous SDP-based approaches.
  arXiv  Detail & Related papers  (2023-04-15T04:57:37Z)
• Quantum-enhanced symmetric cryptanalysis for S-AES [0.0]
  We present an algorithm for optimized Grover's attack on downscaled Simplifed-AES cipher. For 16-bit S-AES the proposed attack requires 23 qubits in general case and 19, 15 or 11 if 4, 8 or 12 bits were leaked in confguration.
  arXiv  Detail & Related papers  (2023-04-11T17:46:44Z)
• Adaptable Butterfly Accelerator for Attention-based NNs via Hardware and Algorithm Co-design [66.39546326221176]
  Attention-based neural networks have become pervasive in many AI tasks. The use of the attention mechanism and feed-forward network (FFN) demands excessive computational and memory resources. This paper proposes a hardware-friendly variant that adopts a unified butterfly sparsity pattern to approximate both the attention mechanism and the FFNs.
  arXiv  Detail & Related papers  (2022-09-20T09:28:26Z)
• Rapid Person Re-Identification via Sub-space Consistency Regularization [51.76876061721556]
  Person Re-Identification (ReID) matches pedestrians across disjoint cameras. Existing ReID methods adopting real-value feature descriptors have achieved high accuracy, but they are low in efficiency due to the slow Euclidean distance computation. We propose a novel Sub-space Consistency Regularization (SCR) algorithm that can speed up the ReID procedure by 0.25$ times.
  arXiv  Detail & Related papers  (2022-07-13T02:44:05Z)
• Minimal Filtering Algorithms for Convolutional Neural Networks [82.24592140096622]
  We develop fully parallel hardware-oriented algorithms for implementing the basic filtering operation for M=3,5,7,9, and 11. A fully parallel hardware implementation of the proposed algorithms in each case gives approximately 30 percent savings in the number of embedded multipliers.
  arXiv  Detail & Related papers  (2020-04-12T13:18:25Z)

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.