SHA-1 Hash Function Research Articles

Reinforcing RC5: Dynamic S-Box Generation and Magic Square-Based Key Expansion

The ever-increasing and ever-demanding growth of the field of cryptanalysis imposesa continuous requirement foralgorithm modifications. This paperintroduces modifications in widely-used RC5 block cipher to cater to the increasing security demands, i.e. dynamic S-box generation and magic square-based key expansion. The main purpose is to improve the complexity and linearity of the algorithm as a result making it resistantto newly-devised attacks. A small (3 × 3) magic square is taken for generating dynamic S-boxes and constants to add unpredictable randomness during the key expansion phase. SHA-256 hash function is used for S-boxes generation meanwhile properties of magic square are exploited for constants derivation purpose. Proposed changes resulted in improved security against differential, linear,and algebraic attacks respectively meanwhile efficiency is still sustained so that this modified version can be well-suited for recentapplications that necessitate strong encryption services.

Improved homomorphic evaluation for hash function based on TFHE

Homomorphic evaluation of hash functions offers a solution to the challenge of data integrity authentication in the context of homomorphic encryption. The earliest attempt to achieve homomorphic evaluation of SHA-256 hash function was proposed by Mella and Susella (in: Cryptography and coding—14th IMA international conference, IMACC 2013. Lecture notes in computer science, vol 8308. Springer, Heidelberg, pp 28–44, 2013. https://doi.org/10.1007/978-3-642-45239-0_3.) based on the BGV scheme. Unfortunately, their implementation faced significant limitations due to the exceedingly high multiplicative depth, rendering it impractical. Recently, a homomorphic implementation of SHA-256 based on the TFHE scheme (Homomorphic evaluation of SHA-256. https://github.com/zama-ai/tfhe-rs/tree/main/tfhe/examples/sha256_bool) brings it from theory to reality, however, its current efficiency remains insufficient. In this paper, we revisit the homomorphic evaluation of the SHA-256 hash function in the context of TFHE, further reducing the reliance on gate bootstrapping and enhancing evaluation latency. Specifically, we primarily utilize ternary gates to reduce the number of gate bootstrappings required for logic functions in message expansion and addition of modulo 232\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$2^{32}$$\\end{document} in iterative compression. Furthermore, we demonstrate that our optimization techniques are applicable to the Chinese commercial cryptographic hash SM3. Finally, we give specific comparative implementations based on the TFHE-rs library. Experiments demonstrate that our optimization techniques lead to an improvement of approximately 35–50% compared with the state-of-the-art result under different cores.

An enterprise composite blockchain construction method for business environment.

In order to foster a modern economic system and facilitate high-quality economic development, it is crucial to establish a conducive business environment. Undoubtedly, the evaluation of the business environment for enterprises constitutes a prominent area of research. Nevertheless, ensuring the authenticity and security of the raw data sources provided by participating enterprises poses a challenge, thereby compromising the accuracy of the evaluation. To tackle this issue, an enterprise composite blockchain construction method for business environment is proposed in this paper, which stores the raw data of enterprises by the means of hybrid on-chain and off-chain. Initially, the enhanced hash function SHA256 is introduced to encrypt the raw data of enterprises. The encrypted data is subsequently stored in an off-chain Level DB database, which is based on non-volatile memory. This approach effectively alleviates the burden on communication and storage. Secondly, a composite storage strategy on-chain is adopted: the key values from the Level DB are stored in the DAG-based Conflux public blockchain, while the enterprise state data is stored in the consortium blockchain, so as to provide trusted evidence of business environment evaluation data. Finally, it is demonstrated through a large number of experimental comparisons that the enterprise composite blockchain construction method proposed in this paper exhibits better read and write performance, lower storage efficiency and storage overhead, and outperforms both the before-improved Level DB database and existing blockchain storage models.

IMAGE ENCRYPTION TECHNIQUE BASED ON A BINARY COMBINATION OF MULTIPLE CHAOTIC MAPS AND DNA SEQUENCE OPERATIONS

The huge advance of digital communication and networks has led to enormous storage and transmission of information over public networks. Nevertheless, the assurance of information security remains incomplete across these unsecured networks. Digital images are the primary means for sharing information over open networks. Consequently, the confidentiality of digital images during storage and transmission has become a crucial concern, particularly when sharing sensitive information. Image encryption has emerged as a solution to this problem. This paper presents an image encryption technique based on multiple one-dimensional chaotic maps and DNA coding. The method employs three one-dimensional chaotic maps, including the Logistic map, Tent map, and piecewise map, multiple times to produce 18 random sequences with different initial values and parameters. SHA-512 hash function is used to indicate the initial values of chaotic maps. For encrypting images, the binary elements from various sequences of chaotic maps are amalgamated to alter the pixel intensities of the image in the diffusion process. Dynamic DNA coding is performed through a random selection of DNA rules and operations (XOR, XNOR, and Addition) to each pixel in the image. The technique is enforced using circular rotations which are applied randomly to each key. The proposed technique is evaluated using many standard images. Different performance metrics have been measured. The empirical findings illustrate the security and resilience of the suggested method and its ability to resist statistical and differential attacks.

SHA-256 Hash Function on Intel DE10 Lite FPGA

Abstract: The SHA-256 hash function is a standardized and trusted algorithm that takes a set of data and produces a unique, deterministic, and irreversible representation called a hash or digest. A component of other protocols, SHA-256 protects password storage, secures and verifies Bitcoin transactions, and authenticates internet communication. We did a thorough analysis of the hash function and a preexisting Verilog implementation at the algorithmic, architectural, and circuit levels to identify and address the bottlenecks. We propose a new SHA-256 hardware architecture that utilizes binary tree structured adder trees to speed up hash computation. The proposed design targets Intel DE10-Lite FPGA and achieves 23% increase in computation speed. In applications, this can offer faster online communication or a more secure Bitcoin network.

Comparative Study of Keccak SHA-3 Implementations

This paper conducts an extensive comparative study of state-of-the-art solutions for implementing the SHA-3 hash function. SHA-3, a pivotal component in modern cryptography, has spawned numerous implementations across diverse platforms and technologies. This research aims to provide valuable insights into selecting and optimizing Keccak SHA-3 implementations. Our study encompasses an in-depth analysis of hardware, software, and software–hardware (hybrid) solutions. We assess the strengths, weaknesses, and performance metrics of each approach. Critical factors, including computational efficiency, scalability, and flexibility, are evaluated across different use cases. We investigate how each implementation performs in terms of speed and resource utilization. This research aims to improve the knowledge of cryptographic systems, aiding in the informed design and deployment of efficient cryptographic solutions. By providing a comprehensive overview of SHA-3 implementations, this study offers a clear understanding of the available options and equips professionals and researchers with the necessary insights to make informed decisions in their cryptographic endeavors.

On a Symmetric Image Cryptosystem Based on a Novel One-Dimensional Chaotic System and Banyan Network

In this paper, a Banyan network with high parallelism and nonlinearity is used for the first time in image encryption to ensure high complexity and randomness in a cipher image. To begin, we propose a new 1-D chaotic system (1-DSCM) which improves the chaotic behavior and control parameters’ structure of the sin map. Then, based on 1-DSCM, a Banyan network, and SHA-256 hash function, a novel image encryption algorithm is conducted. Firstly, a parameter is calculated using SHA-256 hash function and then employed to preprocess the plaintext image to guarantee high plaintext sensitivity. Secondly, a row–column permutation operation is performed to gain the scrambled image. Finally, based on the characteristic of DNA encoding, a novel DNA mapping is constructed using an N=4 Banyan network and is used to diffuse the scrambled image. Simulation results show that the 1-DSCM has excellent performance in chaotic behavior and that our encryption algorithm exhibits strong robustness against various attacks and is suitable for use in modern cryptosystems.

Dynamic DNA cryptography-based image encryption scheme using multiple chaotic maps and SHA-256 hash function

In today's world, a substantial number of digital images are conserved and transmitted through diverse online platforms on a daily basis. Preserving the confidentiality of images is a paramount issue in the current digital environment. To safeguard the privacy of digital images on internet platforms, a robust, effective, and reliable encryption technique is required. This paper proposes a robust and efficient image encryption scheme based on a dynamic DNA encoding and DNA operations associated with chaotic maps with simple structures and highly chaotic behavior, such as the Logistic map, the Henon map, and the Lorenz system, to provide substantial security for digital images. Furthermore, the SHA-256 hash technique and zigzag traversal are used in the algorithm to reinforce the system. This paper defines an improved DNA encoding scheme that can encode four bits at once instead of two bits. Besides, unique and randomized keys are generated for each encryption and decryption session. The proposed scheme exhibits several admirable characteristics, including low processing cost, high randomness, large key space, flexible parameter space, high sensitivity to both keys and plaintext, and fast execution speed. As a result, the proposed scheme effectively safeguards sensitive digital images from a broad range of cryptographic attacks. Numerous evaluation results have demonstrated that the proposed algorithm is more secure and efficient than state-of-the-art methods against a huge assortment of cryptographic attacks.

Bio-Metric Based Colour-Image-Encryption using Multi-Chaotic Dynamical Systems and SHA-256 Hash Algorithm

ABSTRACT This paper proposes a user-biometric-based image encryption using chaotic dynamical systems, SHA-256 hash function, and zigzag transformation. Three chaotic systems, namely, the Henon map, logistic map, and Lorenz system, are used to apply the chaotic properties to the encryption system. The hash value of the user biometric image is used to generate the initial value of the Henon map. The initial values for the logistic map and Lorenz system are generated from the hash value of the plain image. SHA-256 hash algorithm generates the hash values of the biometric and plain images. The plain image is scrambled using the two-dimensional chaotic values generated by the Henon map first. Next, the first scrambled image’s pixels are XORed with the one-dimensional chaotic values generated from the logistic map and produce the second scrambled image. Finally, take the second scrambled image’s pixels, and XOR them with the three-dimensional chaotic values generated from the Lorenz system and create the final encrypted image. The robustness and flexibility of the encryption system are analyzed using various security and performance analyses. The experiment results are compared with the existing algorithms to prove the efficiency of the proposed algorithm.

Peer-to-Peer User Identity Verification Time Optimization in IoT Blockchain Network.

Blockchain introduces challenges related to the reliability of user identity and identity management systems; this includes detecting unfalsified identities linked to IoT applications. This study focuses on optimizing user identity verification time by employing an efficient encryption algorithm for the user signature in a peer-to-peer decentralized IoT blockchain network. To achieve this, a user signature-based identity management framework is examined by using various encryption techniques and contrasting various hash functions built on top of the Modified Merkle Hash Tree (MMHT) data structure algorithm. The paper presents the execution of varying dataset sizes based on transactions between nodes to test the scalability of the proposed design for secure blockchain communication. The results show that the MMHT data structure algorithm using SHA3 and AES-128 encryption algorithm gives the lowest execution time, offering a minimum of 36% gain in time optimization compared to other algorithms. This work shows that using the AES-128 encryption algorithm with the MMHT algorithm and SHA3 hash function not only identifies malicious codes but also improves user integrity check performance in a blockchain network, while ensuring network scalability. Therefore, this study presents the performance evaluation of a blockchain network considering its distinct types, properties, components, and algorithms' taxonomy.

Cryptanalysis the SHA-256 Hash Function using Rainbow Tables

The research of the strength of a hashed message is of great importance in modern authentication systems. The hashing process is inextricably linked with the password system, since passwords are usually stored in the system not in clear text, but as hashes. The SHA-256 hash function was chosen to model the attack with rainbow tables. An algorithm for constructing a rainbow table for the SHA-256 hash function in the Java language is proposed. The conditions under which the use of rainbow tables will be effective are determined. This article aims to practically show the process of generating a password and rainbow tables to organize an attack on the SHA-256 hash function. As research shows, rainbow tables can reveal a three-character password in 3 seconds. As the password bit increases, the decryption time increases in direct proportion.

Comparative Analysis between Elgamal and NTRU Algorithms and their implementation of Digital Signature for Electronic Certificat

The emergence of electronic certificates, which are official documents in the form of digital files transmitted via the internet, facilitates the exchange of information. However, internet use has risks, such as data theft for fabricating and modifying information. This problem can be solved by applying a digital signature. This problem can be solved by applying a digital signature. The main concern in this research is how to perform a comparative analysis between asymmetric cryptographic Elgamal and NTRU (Nth-Degree Truncated Polynomial Ring) algorithms and their implementation of a digital signature as an effort to improve information security in electronic certificates. The stages of the research method are divided into the key generation process, signing, and verification. In the signing and verification process, the SHA-512 hash function is also used for hashing messages to be encrypted-decrypted and QR Code as the signature. Comparison of performance of NTRU with Elgamal algorithms required running at a pdf extension with security levels 80,128,192, 256 bits will be obtained from the templates.office.com website. The results obtained that the El Gamal algorithm is better than the NTRU algorithm, but at a higher security level, the NTRU algorithm is better than the Elgamal algorithm. In the verification experiment that has been carried out, it can be concluded that by using SHA-512 as a hash function, the N parameter used for NTRU must be greater than or equal to 512 to avoid error results from verification.

Simulation Analysis and Comparison of New Hybrid TLI-µTESLA and Variant TESLA Protocols Using SHA-2 and SHA-3 Hash Functions

The evolution of 5G and 6G networks has enhanced the ability of massive IoT devices to provide real-time monitoring and interaction with the surrounding environment. Despite recent advances, the necessary security services, such as immediate and continuous authentication, high scalability, and cybersecurity handling of IoT cannot be achieved in a single broadcast authentication protocol. This paper presents a new hybrid protocol called Hybrid Two-level µ-timed-efficient stream loss-tolerant authentication (Hybrid TLI-µTESLA) protocol, which maximizes the benefits of the previous TESLA protocol variants, including scalability support and immediate authentication of Multilevel-µTESLA protocol and continuous authentication with minimal computation overhead of enhanced Inf-TESLA protocol. The inclusion of three different keychains and checking criteria of the packets in the Hybrid TLI-µTESLA protocol enabled resistance against Masquerading, Modification, Man-in-the-Middle, Brute-force, and DoS attacks. A solution for the authentication problem in the first and last packets of the high-level and low-level keychains of the Multilevel-µTESLA protocol was also proposed. The simulation analysis was performed using Java, where we compared the Hybrid TLI-µTESLA protocol with other variants for time complexity and computation overhead at the sender and receiver sides. We also conducted a comparative analysis between two hash functions, SHA-2 and SHA-3, and assessed the feasibility of the proposed protocol in the forthcoming 6G technology. The results demonstrated the superiority of the proposed protocol over other variants in terms of immediate and continuous authentication, scalability, cybersecurity, lifetime, network performance, and compatibility with 5G and 6G IoT generations.

Secure Sensitive Data Sharing Using RSA and ElGamal Cryptographic Algorithms with Hash Functions

With the explosion of connected devices linked to one another, the amount of transmitted data grows day by day, posing new problems in terms of information security, such as unauthorized access to users’ credentials and sensitive information. Therefore, this study employed RSA and ElGamal cryptographic algorithms with the application of SHA-256 for digital signature formulation to enhance security and validate the sharing of sensitive information. Security is increasingly becoming a complex task to achieve. The goal of this study is to be able to authenticate shared data with the application of the SHA-256 function to the cryptographic algorithms. The methodology employed involved the use of C# programming language for the implementation of the RSA and ElGamal cryptographic algorithms using the SHA-256 hash function for digital signature. The experimental result shows that the RSA algorithm performs better than the ElGamal during the encryption and signature verification processes, while ElGamal performs better than RSA during the decryption and signature generation process.

Finding Collisions against 4-Round SHA-3-384 in Practical Time

The Keccak sponge function family, designed by Bertoni et al. in 2007, was selected by the U.S. National Institute of Standards and Technology (NIST) in 2012 as the next generation of Secure Hash Algorithm (SHA-3). Due to its theoretical and practical importance, cryptanalysis of SHA-3 has attracted a lot of attention. Currently, the most powerful collision attack on SHA-3 is Jian Guo et al.’s linearisation technique. However, this technique is infeasible for variants with asmaller input space, such as SHA-3-384.In this work we improve upon previous results by utilising three ideas which were not used in previous works on collision attacks against SHA-3. First, we use 2-block messages instead of 1-block messages, to reduce constraints and increase flexibility in our solutions. Second, we reduce the connectivity problem into a satisfiability (SAT) problem, instead of applying the linearisation technique. Finally, we propose an efficient deduce-and-sieve algorithm on the basis of two new non-random propertiesof the Keccak non-linear layer.The resulting collision-finding algorithm on 4-round SHA-3-384 has a practical time complexity of 259.64 (and a memory complexity of 245.94). This greatly improves upon the best known collision attack so far: Dinur et al. achieved an impractical 2147 time complexity. Our attack does not threaten the security margin of the SHA-3 hash function. However, the tools developed in this paper could be used to analyse other cryptographic primitives as well as to develop new and faster SAT solvers.

Authenticated Wireless Links between a Drone and Sensors Using a Blockchain: Case of Smart Farming

Agriculture is confronted with several significant difficulties, such as rising air temperatures and population growth, causing the implementation of smart farming operations as an optimum solution. This research aims to contribute to the growing knowledge of the potential role of blockchain technology in promoting the concept of smart farming by enhancing the efficiency of farming operations by boosting agricultural production, lowering environmental impact, and automating the work of farmers. It proposes a secure blockchain-based framework to establish trust among smart farming users. The framework utilizes asymmetric key exchange mechanism using an ECC authentication algorithm and SHA-256 hash function cryptography to secure communication between sensors and drones in the farm field. The SHA-256 hashing function ensures data integrity as attempts to tamper with data result in a different hash value, breaking the chain of blocks. To demonstrate the feasibility of the proposed framework, a proof-of-concept implementation was developed on the Ethereum blockchain, in which smart contracts were used to model the framework operations. The proof of concept’s performance was examined using Hyperledger Caliper for latency, throughput, and transaction success rate. The findings clearly indicate that blockchain technology can provide an efficient and scalable mechanism to advance smart farming and address some of the barriers that inhibit smart farming, particularly regarding to data integrity and availability.

Integration of IMEI, RSA, and Signature to Secure Communication in Mobile Applications

The mobile instant messaging applications have become a famous wireless service in the world allowing a user to communicate with anyone in anywhere. Consequently, the manipulation of the user data creates a pressing need for securing the information and the associated technologies. The protection of these communications has become a paramount objective. The concept of cryptography has become a basic concept in communication and the exchange of messages within companies. This paper presents a hybrid security system allowing messages to be exchanged within a company in a secure manner. Our goal is to provide end-to-end encryption through the combination of asymmetric cryptography, signature, and integration of IMEI parameter. The confidentiality of the messages is ensured by the RSA algorithm, while the integrity of these messages and the sender authentication are ensured by the digital signature, that is carried out with the SHA-2 hash function.

Comparison of Hash Functions for Network Traffic Acquisition Using a Hardware-Accelerated Probe

In this article we address the problem of efficient and secure monitoring of computer network traffic. We proposed, implemented, and tested a hardware-accelerated implementation of a network probe, using the DE5-Net FPGA development platform. We showed that even when using a cryptographic SHA-3 hash function, the probe uses less than 17% of the available FPGA resources, offering a throughput of over 20 Gbit/s. We have also researched the problem of choosing an optimal hash function to be used in a network probe for addressing network flows in a flow cache. In our work we compared five 32-bit hash functions, including two cryptographic ones: SHA-1 and SHA-3. We ran a series of experiments with various hash functions, using traffic replayed from the CICIDS 2017 dataset. We showed that SHA-1 and SHA-3 provide flow distributions as uniform as the ones offered by the modified Vermont hash function proposed in 2008 (i.e., with low means and standard deviations of the bucket occupation), yet assuring higher security against potential attacks on a network probe.

Analisa Dan Perbandingan Algoritma Whirpool Dan Sha-512 Dalam Penyandian Data Gambar

Image file is a form of collaboration which is located between points, lines, fields and also colors which will be very useful for imaging something, digital images are representations of light intensity functions in discrete form on a two-dimensional plane. An image file can be said to be original or original if the image does not experience the slightest change in any structure of an image. Manipulation of a file often occurs and is carried out by irresponsible people to provide benefits for that person, it is necessary to have a technique used to maintain the originality of a file or detect the authenticity of the image file, a technique can be used, namely Cryptography techniques. Cryptography is a science that studies how to keep data or messages safe when sent, from sender to recipient without experiencing any interference from irresponsible parties. A hash function is a one-way function that converts a set of strings into a set of strings whose size is smaller than the original size. The hash function has many uses, such as to maintain data integrity, delivery time efficiency, and to minimize the length of diverse data. The real-world applications of hash functions vary, such as being used to check the originality of data, to store keywords in databases, and much more. In this study, 2 existing hash functions will be discussed, namely the SHA-512 hash function, and the whirlpool hash function. SHA-512 is a variant of SHA-2 designed by the National Security Agency (NSA), while the Whirlpool hash algorithm was developed by 2 people, Vincent Rijmen and Paulo S.L.M. Barreto. These two hash functions are hash functions that are considered to have high security. In these two hash algorithms, there is still no collision in the hash value. This study will discuss the differences and similarities of the two algorithms

Chaos-Based Fast Image Encryption Scheme with Double Zigzag Permutation and Secure SHA256

Encryption is generally used to protect the content of images. This paper proposes a simple chaos-based color image encryption algorithm with permutation and diffusion stages dependent on the plain image to increase plain text sensitivity by collaboratively leveraging a sampled random noise signal, SHA-256, Henon chaotic map, double zigzag scanning and Lorenz system. Specifically, a hash value of the plain image and a sampled true random noise signal are generated using SHA-256 hash function and considered as an initial one-time key, which is then used to locate values from the sampled true random noise signal array to define the initial values and parameters for chaotic Henon map and Lorenz system. The Henon chaotic map creates an output that defines the starting point for double zigzag pixel scanning in the permutation stage, whereas the Lorenz system generates three sequences to diffuse the image’s three components; red, green, and blue using the XOR operation in order to get an encrypted image. Finally, statistical analysis results are offered to evaluate the complexity and ascertain security functionality for the proposed algorithm. Results show that the proposed image encryption algorithm is superior in comparison to other existing algorithms.