Secure Hash Algorithm Research Articles

Comparative study of password storing using hash function with MD5, SHA1, SHA2, and SHA3 algorithm

<span>The main purpose of passwords is to prevent unauthorized people from accessing the system. The rise in internet users has led to an increase in password hacking, which has resulted in a variety of problems. These issues include opponents stealing a company's or nation's private information and harming the economy or the organization's security. Password hacking is a common tool used by hackers for illegal purposes. Password security against hackers is essential. There are several ways to hack passwords, including traffic interception, social engineering, credential stuffing, and password spraying. In an attempt to prevent hacking, hashing algorithms are therefore mostly employed to hash passwords, making password cracking more difficult. In the suggested work, several hashing techniques, including message digest (MD5), secure hash algorithms (SHA1, SHA2, and SHA3) have been used. They have become vulnerable as a result of being used to store passwords. A rainbow table attack is conceivable. Passwords produced with different hash algorithms can have their hash values attacked with the help of the Hashcat program. It is proven that the SHA3 algorithm can help with more secure password storage when compared to other algorithms.</span>

A secure and privacy preserving model for healthcare applications based on blockchain-layered architecture

Blockchain is one of the emerging technologies that are applied in various fields and its application in Healthcare 4.0 is crucial to handle the vast amount of health records that are growing continuously everyday. This paper explores the application of blockchain technology-based layered architecture integrated with Interplanetary File System (IPFS) storage to provide a secure and robust sharing platform for healthcare system. A multilayer security is provided in the proposed system including a 128-bit Random Deoxyribonucleic Acid (DNA) encoding sequence with a modified version of the 128-bit Advanced Encryption Standard (AES) key expansion symmetric key technique is being used before storing the records in the IPFS storage, Rivest–Shamir–Adleman (RSA) 2048 digital envelope is used for secure transmission of symmetric keys, RSA 1024 is used for digital signature, and Secure Hash Algorithm 256-bit (SHA-256) is used for hashing the record files. Comparative analysis with existing state-of-the-art in blockchain-based E-healthcare system is discussed. The performance of various assessment metrics is evaluated, including encryption and decryption time for EHR records, mining time, record retrieval time, smart contract execution time and network latency. Additionally, a reputation-based filtering mechanism specifically designed in the proposed model to detect and mitigate the various attacks.

Message Authentication Scheme on Light Weight Parallel Encryption Model With Digit Artithmetic of Covertext using Secure Hash Algorithm

This research aims to enhance message security by developing a Light Weight Parallel Digit Arithmetic of Covertext (PDAC) encryption-based authentication scheme that adopts the Secure Hash Algorithm (SHA) algorithm to ensure message integrity and authentication aspects. Through experiments, tests are conducted on two main aspects: entropy and collision resistance. The experimental results show that the average entropy generated reaches 4.992, or 62.41% of the optimal entropy value. While this result shows a good randomness, there is room for further improvement to reach the optimal level. Collision resistance testing using Google's SHAttered tool showed very positive results. No collisions were found in any of the samples tested, indicating that the PDAC scheme combined with SHA can maintain message integrity well. This indicates that PDAC has strong resistance to hash-based attacks, ensuring that messages remain authentic and safe from manipulation. Thus, this study concludes that PDAC schemes offer a good balance between efficiency, security, and low power consumption, making it suitable for use in resource-constrained environments such as IoT devices and mobile applications

Developing a nationwide dataset of UK veterans seeking help from sector charities

Abstract Background The assistance to military veterans and their families in the UK is provided by both the NHS and over 1800 military charities. These charities count services using different definitions and reporting systems, so to date a national registry of service usage does not exist. The aim of the MONARCH study is to build a standardised registry of service usage data for the military charity sector, in order to identify patterns of use, gain insight on possible risk factors, and guide the allocation of resources. Methods Data is anonymised and a unique identifier is generated by adopting a Secure Hashing Algorithm, allowing both privacy protection and avoiding double counts. Data is standardised, and linked with an automated process to create an aggregated dataset. The dataset describes the population, using both a-priori and machine learning approaches (K-means clustering) to unveil different usage patterns. In addition, it will be linked to an online interactive dashboard. Results To date 5 national charities have shared data, for a total of 42,509 veterans with 128,423 needs. The mean age of beneficiaries was 60.1 years (SD 20.5), and 90% were male. 65% were receiving some other form of statutory benefit, 5% was homeless and 1% was imprisoned. 65% of the needs recorded concerned social wellbeing. 40% of veterans were helped at least in two different years. The k-means clustering approach based on the number of accesses, number of needs and repetition of need returned 4 subgroups of use that were identical to those created using a priori knowledge. Conclusions The dataset is the most comprehensive source of charity usage data in the UK to date. Service usage is generally homogenous among subgroups, but some differences were highlighted indicating that younger, non-officer veterans may be more at risk of presenting with more complex needs. These first useful insights can help allocate resources to build an effective preventive strategy for more complex cases. Key messages • The MONARCH dataset is the first comprehensive nationwide registry in the UK of military charity data. • The understanding of usage patterns can lead to the design of targeted preventive strategies.

Securing oil port logistics: A blockchain framework for efficient and trustworthy trade documents.

The oil port logistics involves multiple parties including oil tanker owners, port authorities, customs, oil suppliers, and shipping companies. These parties need to exchange a significant amount of data and documentation related to cargo, such as bills of lading, customs declarations, and cargo manifests. This huge amount of data and documentation provides ample opportunities for data manipulation and corruption. Moreover, physical documentation is slow and prone to errors and manipulation. This data can be securely stored and shared between different parties in a tamper-proof and transparent manner using blockchain. Blockchain is a decentralized technology that employs secure hashing and consensus algorithms that can detect any data modification. Hence, this work proposes a blockchain-enabled immutable, and efficient framework for trade documentation in oil port logistics. The proposed framework provides timely processing of oil trade documents and ensures immutability while increasing trust among the trade entities. In addition, this work implements a private blockchain for the execution of smart contracts, which can ensure that all parties involved in the logistics process comply with pre-agreed rules and regulations. Simulation results validate the effectiveness of the proposed framework in terms of transparency, immutability, network latency, throughput, and resource utilization.

Colloidal particles as noise source for random number generation

In this work, we investigate colloidal particle patterns as a possible noise source for random number generation. We systematically analyze the minimum entropy of the noise source over different particle concentrations of {1, 3, 5, 7, 10, 12, 15} mg/ml according to the recommendations of the National Institute of Standards and Technology Special Publication 800-90B. The estimated minimum entropy of the non-independent and identically distributed particle pattern noise source is Hmin = 0.5896/1 bit at a particle amount of 5 mg/ml. For further entropy extraction on the noise source data, the secure hash algorithm is used to construct an entropy source. The randomness of the derived entropy source is verified according to the National Institute of Standards and Technology Special Publication 800-22 Rev. 1a and the accompanying statistical test suite. The entropy source passes all randomness tests of the statistical test suite and shows an estimated minimum entropy of Hmin = 0.9992/1 bit.

Design and Implementation of USB Key System Based on Dual-Factor Identity Authentication Protocol

With the increasing demand for information security, traditional single-factor authentication technology can no longer meet security requirements. To this end, this paper proposes a Universal Serial Bus (USB) Key hardware and software system based on a two-factor authentication protocol, aiming to improve the security and reliability of authentication. This paper first analyzes the current status and technical principles of USB Key-related research domestically and internationally and designs a two-factor authentication protocol that combines impact/response authentication and static password authentication. The system consists of a host computer and a USB Key device. The host computer interacts with the USB Key through a graphical user interface. The Secure Hash Algorithm 1 (SHA-1) and MySQL database are used to implement the authentication function. Experimental results show that the designed two-factor authentication protocol can effectively prevent replay attacks and information tampering, and improve the security of authentication. If the corresponding USB Key is not inserted, the system will prompt that the device is not found. Once the USB Key is inserted, user identity is confirmed through two-factor verification, which includes impact/response authentication and static password authentication.

A QoS Analysis of SHA Algorithms for IoT Systems

Secure Hash Algorithms (SHA) are widely used in the Internet of Things (IoT) systems for message authentication and integrity verification. However, the performance of different SHA algorithms can vary significantly in terms of Quality of Service (QoS) metrics such as area utilization, processing speed, energy efficiency, and security. In this paper, we present a comprehensive analysis of the QoS parameters of various SHA algorithms and discuss the trade-offs between performance and security when selecting SHA algorithms for resource-constrained IoT devices. The study focuses on the hardware implementation of SHA algorithms in Field-Programmable Gate Array (FPGA) devices, which are commonly used in IoT applications. The performances and resource utilization of different SHA algorithms are compared and analyzed. The comparative results show that SHA-2 provide a good balance between performance and security, but SHA-3 provide better security due to its resistance to attacks such as length extension and collision

LiteHash: Hash Functions for Resource-Constrained Hardware

The global paradigm shift towards edge computing has led to a growing demand for efficient integrity verification. Hash functions are one-way algorithms which act as a zero-knowledge proof of a datum’s contents. However, it is infeasible to compute hashes on devices with limited processing power and memory. Hence, we propose four novel LiteHash functions which are architecturally similar to SHA-512 yet simpler. By using various approximation techniques, our implementations reduce the computational costs of digesting a message into a hash. On validating our proposed designs using the NIST PRNG Test Suite, we observe SHA-512 equivalent cryptographic security while satisfying all desired hash function property requirements. We observe a minimum of 9.41% reduction in area, 20.47% reduction in power and 22.05% increase in throughput. Our designs offer a throughput of upto 2 Gbps while reducing area and power by a maximum of 16.86% and 32.48% respectively. LiteHash functions also support the computation of the entire SHA-2 family of hash functions (SHA-224/256/384/512) with minor architectural modifications.

Provably Secure and Area-Efficient Modular Addition over Boolean Shares

Several cryptographic schemes, including lattice-based cryptography and the SHA-2 family of hash functions, involve both integer arithmetic and Boolean logic. Each of these classes of operations, considered separately, can be efficiently implemented under the masking countermeasure when resistance against vertical attacks is required. However, protecting interleaved arithmetic and logic operations is much more expensive, requiring either additional masking conversions to switch between masking schemes, or implementing arithmetic functions as nonlinear operations over a Boolean masking. Both solutions can be achieved by providing masked arithmetic addition over Boolean shares, which is an operation with relatively long latency and usually high area utilization in hardware. A further complication arises when the arithmetic performed by the scheme is over a prime modulus, which is common in lattice-based cryptography. In this work, we propose a first-order masked implementation of arithmetic addition over Boolean shares occupying a very small area, while still having reasonable latency. Our proposal is specifically tuned for efficient addition and subtraction modulo an arbitrary integer, but it can also be configured at runtime for power-of-two arithmetic. To the best of our knowledge, we propose the first such construction whose security is formally proven in the glitch+transition-robust probing model.

Climate variability impacts on runoff projection in the 21st century based on the applicability assessment of multiple GCMs: A case study of the Lushi Basin, China

In this study, we initiatively employed the improved Secure Hash Algorithm (SHA) to evaluate and compare the competencies of multiple Coupled Model Intercomparison Project Phase Six (CMIP6) General Circulation Models (GCMs). The selected GCM outputs were bias-corrected by the non-parametric quantile mapping (QM) method. The calibrated and validated data were then used to run the XAJ (Xin’anjiang) model to assess long-term climate variation impacts on runoff under four Shared Socioeconomic Pathways (SSP1-2.6, SSP2-4.5, SSP3-7.0, and SSP5-8.5), where the results were compared with the baseline period (1976–2000). Overall, the CNRM-CM6-1-HR, FIO-ESM-2–0, INM-CM5-0 and NorESM2-MM models reconstructed better spatio-temporal evolutionary trends related to historical precipitation and evaporation, and were applied as selected GCMs for reliable runoff projection applications. The intensification amplitudes of precipitation and evaporation produced by selected GCMs gradually spread from SSP1-2.6 to SSP5-8.5 throughout the 21st century. Compared to the baseline period (257 m3/s), the extreme streamflow during the wet periods is likely to increase for SSP5-8.5 (288 ∼ 298 m3/s), SSP3-7.0 (276 ∼ 294 m3/s), and SSP2-4.5 (222 ∼ 280 m3/s), whereas SSP1-2.6 decreases to varying degrees (178 ∼ 255 m3/s). Meanwhile, during the dry periods, the extreme streamflow is projected to decrease by 28 ∼ 73 m3/s (SSP5-8.5), 32 ∼ 38 m3/s (SSP3-7.0), 8 ∼ 31 m3/s (SSP2-4.5), and 5 ∼ 33 m3/s (SSP1-2.6) from historical levels (62 m3/s). The overwhelming majority of increasing trends in the wet periods and vastly decreasing trends in the dry seasons indicate that the basin will face some floods and water shortage risks in the mid to late 21st century. The findings broaden the efficacious applications of SHA in the performance selection of GCMs and QM method in bias correction. The conclusions provide a reference for flood and drought mitigation planning and water resources policymaking in the Yellow River Basin.

Evaluations of Crypto-System AES Using Multiple Bloc Ciphering Mode

Cryptography, a scientific field that has existed even before the beginning of computer science. This article looks at the development symmetric crypto-system, which falls within the framework of image security, by Advanced Encryption Standard (AES- Advanced Encryption Standard) algorithms. AES algorithm is not integrity protected. Cryptanalysis could use modified encrypted image of each ciphered bloc for generating oracle and getting the key. A new crypto-system uses hash function named AES-GCM (Advanced Encryption Standard-) for solving this problem. Using Galois Counter Mode (GCM) combined with Secure Hash Algorithm 256 bits (SHA-256) or BLAKE2s hash function, the old mode of ciphering like: Cipher FeedBack (CFB), Output FeedBack (OFB), Cipher Block Chaining (CBC), Electronic Codebook Block (ECB) and CounTeR (CTR) mode encryption, will increase the security level at confidentiality and integrity. In this article, robustness of the crypto-system will be evaluated by multiple criteria, indeed the statistical analysis, sensitivity measurement and performance measurement. For the statistical analysis, the histogram is flat and the correlation between adjacent pixel is not linear for the encrypted image. The relation between clear image and encrypted image doesn’t exist. For the sensitivity analysis, Number of Pixel Changing Rate (NPCR) and Unified Averaged Changed Intensity (UACI) permit to avoid differential attack of the crypto-system. The two values are respectively near 99% and 30%. For performance measurement, the similarity of the decrypted image and original image will be tested. The Peak Signal to Noise Ratio (PSNR) and Mean Square Error (MSE) are equals of infinity and zero. The decrypted image and original image are the same. The integrity of the image on the crypto-system will be evaluated by modifying one bit of the encrypted image. The decryption process doesn’t give decrypted image and show that the tag value is incorrect.

A Lightweight Image Cryptosystem for Cloud-Assisted Internet of Things

Cloud computing and the increasing popularity of 5G have greatly increased the application of images on Internet of Things (IoT) devices. The storage of images on an untrusted cloud has high security and privacy risks. Several lightweight cryptosystems have been proposed in the literature as appropriate for resource-constrained IoT devices. These existing lightweight cryptosystems are, however, not only at the risk of compromising the integrity and security of the data but also, due to the use of substitution boxes (S-boxes), require more memory space for their implementation. In this paper, a secure lightweight cryptography algorithm, that eliminates the use of an S-box, has been proposed. An algorithm termed Enc, that accepts a block of size n divides the block into L n R bits of equal length and outputs the encrypted block as follows: E=L⨂R⨁R, where ⨂ and ⨁ are exclusive-or and concatenation operators, respectively, was created. A hash result, hasR=SHA256P⨁K, was obtained, where SHA256, P, and K are the Secure Hash Algorithm (SHA−256), the encryption key, and plain image, respectively. A seed, S, generated from enchash=Enchashenc,K, where hashenc is the first n bits of hasR, was used to generate a random image, Rim. An intermediate image, intimage=Rim⨂P, and cipher image, C=Encintimage,K, were obtained. The proposed scheme was evaluated for encryption quality, decryption quality, system sensitivity, and statistical analyses using various security metrics. The results of the evaluation showed that the proposed scheme has excellent encryption and decryption qualities that are very sensitive to changes in both key and plain images, and resistance to various statistical attacks alongside other security attacks. Based on the result of the security evaluation of the proposed cryptosystem termed Hash XOR Permutation (HXP), the study concluded that the security of the cryptography algorithm can still be maintained without the use of a substitution box.

Energy aware and secure routing for hierarchical cluster through trust evaluation

With the rapid growth of technology advancement in wireless communication have resulted in interconnection of large number of devices covering wide range of application services. Wireless sensor network (WSN) have become popular and provide various benefits, including low-power smart computation, compact size, self organizing and ability to route via routing protocols. WSN covers a wide range of application services, including home automation, smart cities, fire detection, unmanned aerial vehicle (UAV), and object tacking. Sensor nodes are tiny, battery operated, and suffer from fundamental restrictions such as available bandwidth, memory space, power restrictions, and limited resources. Due to their communication characteristics and working environment, WSN faces energy optimization and secure data communication challenges to increase network lifetime and defend against malicious nodes. To overcome energy scarcity and consumption issues, clustering methods have proven smart and effective approaches to reduce energy consumption and extend network life. Low energy adaptive clustering hierarchy (LEACH), well-known clustering method, enhances energy efficiency by selecting cluster head (CH) on a rotation basis by employing random integer technique. To extend network stability period, extensions of LEACH was proposed. LEACH and its extensions mainly focus on optimal selection of CH and fail to concentrate on secure communication. Integration of blockchain and real-time message content validation (RMVC) in LEACH was modelled to detect malicious node through secure hash algorithm. However, existing scheme had complex cryptographic functions and higher computation overhead. In this paper, we present energy aware and secure routing (EASR) for hierarchical cluster based WSN. Existing LEACH is modified and an improved threshold value is adapted to select secure optimal CH and trust based routing model which combines direct and indirect trust opinion values to resist routing attacks for establishing trustworthy and reliable routes towards base station.

Combination of AES (Advanced Encryption Standard) and SHA256 Algorithms for Data Security in Bill Payment Applications

In the era of information technology development, digital payments and e-payments are becoming a dominant trend, supported by the crucial role of payment gateways such as Midtrans. Midtrans uses APIs to facilitate various online transactions, including debit cards. In this research, two cryptographic algorithms will be combined, namely Advance Encryption Standard (AES) with 256 bits and Secure Hash Algorithm (SHA) with 256 bits. The importance of data security in e-payments is recognized, with the application of cryptographic algorithms to protect sensitive transaction information. Yayasan Antero Prosesi Edukasi (YAPE) as an educational marketing consultant faced the challenge of time-consuming and inefficient manual payments. In an effort towards efficiency and security, YAPE plans to develop an online payment application with Midtrans Payment Gateway and the use of AES-256 and SHA-256 cryptographic algorithms. This step is expected to help the foundation keep up with technological developments, provide ease of payment, and achieve computerized efficiency. The results showed that the use of a combination of AES 256 bit and SHA256 encryption significantly increased security, making hacking attempts ineffective because encrypted data could not be accessed, with quite complicated calculation stages.

SHA 512 Enhanced Secure Hash Decentralized Response System

Today a very huge lack of confidence about the current EVM/ballot response system like voting has made voting response collection in any democratic country very condemnatory. People have watched their fundamental rights which are being violated. On the other hand the other digital voting systems are also in danger due to a minimal of transparency. Most of the traditional response systems are not clear enough so as to meet today's requirements; this crucial reason makes it very sweaty for the government to come up with voters' trust. The motive behind the downfall of the traditional and current cyber voting system is that it can be easily compromised due to centralized network. The primary objective here is to counter the issues of the traditional digital voting and such response systems, which has any type of mistrust or inequality during the process of accepting responses through response systems like voting. Blockchain technology can be used in such response systems like voting to have a fair response system and reduce wrongdoing. The current physical response systems like voting have many downs in it as well as the digital voting systems are not up to the mark to be implemented on a huge scale. Such all problems raises the need for a solution to secure the democratic rights of the people. This article put-ups a framework based on up-to-date blockchain algorithm technology that provides high clarity and reliability of the system to construct a healthy relationship between response systems and election authorities. The insisted software provides a framework that can be implemented in real world to conduct voting like procedures digitally through blockchain rather than involving any physical polling stations and centralized ledger. Our proposed framework provides an extendible hashing, by using the latest consensus algorithms. The Secure Hash Algorithms applied in the voting system along with Chain Security makes the response systems more secure. Distributed ledger contracts also provide a protected connection between the user and the consensus network while running a transaction in the chain. The security of the blockchain based response system has also been discussed. In Addition to this, encryption of responses using cryptographic hash functions and prevention of exploitation attacks about 51% on the blockchain has also been elaborated. Also, the procedure for carrying out blockchain transactions during the process of response collection has been elaborated using Blockchain. Finally, the throughput performance evaluation of the proposed system shows that such a system can be deployed in a large-scale real time population.

Multi-Vt-Based Energy Efficiency Optimization for ASIC Designs of the Double Secure Hash Algorithm Toward a Sustainable Bitcoin Network

Multi-Vt-Based Energy Efficiency Optimization for ASIC Designs of the Double Secure Hash Algorithm Toward a Sustainable Bitcoin Network

Parallel Implementation of Lightweight Secure Hash Algorithm on CPU and GPU Environments

Currently, cryptographic hash functions are widely used in various applications, including message authentication codes, cryptographic random generators, digital signatures, key derivation functions, and post-quantum algorithms. Notably, they play a vital role in establishing secure communication between servers and clients. Specifically, servers often need to compute a large number of hash functions simultaneously to provide smooth services to connected clients. In this paper, we present highly optimized parallel implementations of Lightweight Secure Hash (LSH), a hash algorithm developed in Korea, on server sides. To optimize LSH performance, we leverage two parallel architectures: AVX-512 on high-end CPUs and NVIDIA GPUs. In essence, we introduce a word-level parallel processing design suitable for AVX-512 instruction sets and a data parallel processing design appropriate for the NVIDIA CUDA platform. In the former approach, we parallelize the core functions of LSH using AVX-512 registers and instructions. As a result, our first implementation achieves a performance improvement of up to 50.37% compared to the latest LSH AVX-2 implementation. In the latter approach, we optimize the core operation of LSH with CUDA PTX assembly and apply a coalesced memory access pattern. Furthermore, we determine the optimal number of blocks/threads configuration and CUDA streams for RTX 2080Ti and RTX 3090. Consequently, in the RTX 3090 architecture, our optimized CUDA implementation achieves about a 180.62% performance improvement compared with the initially ported LSH implementation to the CUDA platform. As far as we know, this is the first work on optimizing LSH with AVX-512 and NVIDIA GPU. The proposed implementation methodologies can be used alone or together in a server environment to achieve the maximum throughput of LSH computation.

Implementation of QR Code Attendance Security System Using RSA and Hash Algorithms

The quick response (QR) code-based attendance application contributes to reducing paper usage and attendance input errors. However, in its implementation process, the QR-code-based attendance at a Bandung school demonstrates weaknesses. Absent students can fake their attendance for themselves or friends. This type of attack is known as fake QR code generation. This research proposes a security authentication system using the Rivest–Shamir–Adleman (RSA) encryption algorithm and the secure hash algorithm 1 (SHA-1) to secure QR code-based attendance applications from fake QR code generation attacks. The RSA algorithm encrypts QR code data to maintain privacy, while the SHA-1 algorithm ensures data integrity. Based on this method, the mutual authentication process between the QR code data generated by the student and the attendance reading application by the teacher can be established. The results obtained from a series of tests showed that the security system in the student attendance recording application that had been implemented at Madrasah Aliyah (MA) Al-Mukhlishin could detect and prevent fake QR code generation attacks. The test was conducted by changing the impact of the key length on RSA-1024 bits and RSA-2048 bits. The results showed that in RSA-1024 bits, energy consumption of 0.14 J and time of 1.66 s is more efficient than that in RSA-2048 bits, with energy consumption of 0.19 J and time of 2.09 s. Interestingly, if a higher level of security is required, the key length should be increased at the expense of some energy and time efficiency.

Dynamic Voltage and Frequency Scaling as a Method for Reducing Energy Consumption in Ultra-Low-Power Embedded Systems

Dynamic voltage and frequency scaling (DVFS) is a technique used to optimize energy consumption in ultra-low-power embedded systems. To ensure sufficient computational capacity, the system must scale up its performance settings. The objective is to conserve energy in times of reduced computational demand and/or when battery power is used. Fast Fourier Transform (FFT), Cyclic Redundancy Check 32 (CRC32), Secure Hash Algorithm 256 (SHA256), and Message-Digest Algorithm 5 (MD5) are focused functions that demand computational power to achieve energy-efficient performance. Selected operations are analyzed from the energy consumption perspective. In this manner, the energy required to perform a specific function is observed, thereby mitigating the influence of the instruction set or system architecture. For stable operating voltage scaling, an exponential model for voltage calculation is presented. Statistical significance tests are conducted to validate and support the findings. Results show that the proposed optimization technique reduces energy consumption for ultra-low-power applications from 27.74% to up to 47.74%.