Hash algorithm in cryptography research paper
Best insight from top research papers
Hash algorithms are a key component of cryptography research papers. One paper proposes a new hash algorithm called HBC-256, which is based on a symmetric block cipher and designed for computational speed and protection against preimage attacks . Another paper focuses on a hash function mixed chaotic system with a key, which effectively resists forging and peer key attacks with minimal computation required . A third paper presents a reconfigurable hardware architecture for common hash algorithms, supporting multiple algorithms and word widths without wasting resources . Hash-based signatures are also explored in a fourth paper, analyzing existing algorithms and their security, key sizes, and computational complexity . Finally, a fifth paper discusses the use of irreducible polynomials in the implementation of hash algorithms for quantum key distribution networks, achieving high computing rates and enhanced security .
Answers from top 5 papers
More filters
| Papers (5) | Insight |
|---|---|
| The paper discusses a high-speed variable polynomial Toeplitz hash algorithm based on FPGA for authentication protocols in the Quantum Key Distribution (QKD) network. It proposes a method to implement variational irreducible polynomials on FPGA, achieving an operational rate of 6.8 Gbps. However, it does not specifically mention the name of the hash algorithm used. | |
| The paper discusses a hash function mixed chaotic system with a key and proposes an improved dynamic model to enhance the speed and security of the algorithm. | |
23 Dec 2020 | The provided paper does not mention any specific hash algorithm used in cryptography research. |
| The provided paper is about a reconfigurable hardware architecture for hash algorithms. It does not specifically mention cryptography research papers. | |
| The paper proposes a new hash algorithm called HBC-256 (Hash based on Block Cipher) based on a symmetric block cipher. |
Related Questions
Hash method in Lightweight cryptography4 answersIn lightweight cryptography, various hash methods are utilized to ensure secure data transmission in resource-constrained devices like those in the Internet of Things (IoT). One approach involves the implementation of new Mersenne number transform (NMNT)-based algorithms such as NMNT, ONMNT, and O2NMNT, which offer strong diffusion performance and simple arithmetic operations for cryptographic applications. Additionally, the use of a sponge-based hashing algorithm, like DeeR-Hash, provides high security with low energy consumption, making it suitable for devices in IoT environments. Furthermore, the integration of Elliptic Curve Cryptography (ECC) and Secure Hash Algorithm (SHA-256) using Crow Search Algorithm (CSA) in the ECCCSASHA256 model presents a lightweight cryptography scheme for secure data transmission in IoT devices, enhancing encryption and decryption performance compared to traditional schemes.
Hash-based signature revisited4 answersHash-based signature schemes have gained significant attention in recent years due to the development of quantum attacks on classical digital signature schemes. These schemes provide asymmetric authentication without relying on large integer mathematics and are resistant to side-channel attacks. They can be implemented in a compact and relatively simple manner. Additionally, hash-based signatures remain secure even in the presence of a quantum computer. The research progress in hash-based signature schemes includes the exploration of one-time signature and few-time signature components. Different categories of hash-based signatures, such as limited number and stateful schemes, unlimited number and stateful schemes, and unlimited number and stateless schemes, have been analyzed in terms of their design, security, and performance efficiency. Potential development directions for hash-based signatures are also discussed.
Hashing algorithms in cryptography4 answersHashing algorithms play a crucial role in cryptography by providing secure and efficient methods for data protection and information security. Various algorithms have been proposed and studied in the field, including homomorphic hashing based on elliptic curve cryptography (ECC), genetic algorithms and evolutionary methods, VLSI based cryptographic hash algorithms such as Blake, MD5, and SHA, parallel algorithms for tree-based hash functions, and the design and security analysis of block ciphers and cryptographic hash functions. These algorithms aim to enhance security, improve efficiency, and address the challenges posed by evolving technologies and increasing data volumes. The research in this area focuses on developing new encryption features, evaluating algorithm performance, and exploring the potential of parallelism and genetic algorithms for cryptographic applications.
Hash algorithms openstack swift5 answersHash algorithms play a crucial role in OpenStack Swift, a popular cloud storage service. In the context of OpenStack Swift, hash algorithms are used for various purposes such as authentication, authorization, object verification, and data integrity. Several papers discuss the use of hash algorithms in OpenStack Swift. Albaroodi et al. propose a cloud-based security model for OpenStack Swift that incorporates cryptographic algorithms and a hash function for secure access and authentication. Gugnani et al. propose two designs to improve the performance and scalability of Swift, including the use of efficient hashing algorithms for object verification. Ruan et al. propose a lightweight object sync protocol called LightSync, which reduces the sync overhead by using novel hashing techniques. Titcheu Chekam et al. also propose LightSync to address the sync bottleneck problem in OpenStack Swift, reducing the network overhead through innovative hashing approaches. Overall, these papers highlight the importance of hash algorithms in enhancing the security, performance, and scalability of OpenStack Swift.
Hash Functions based DNA Cryptography5 answersHash functions based on DNA cryptography have been proposed in several papers. Alawida et al. proposed a hash function based on a chaotic sponge construction and DNA sequence, which showed near-ideal diffusion, confusion, collision resistance, and distribution properties. Gagniuc and Ionescu-Tirgoviste presented the GHDNA hash function, which converts DNA data into a unique integer value for bioinformatic analysis. De Goër de Herve et al. adapted a perceptual hash function for DNA sequences, allowing for efficient storage and retrieval of massive DNA sequences. Soni and Prajapati discussed DNA cryptography as a new emerging technique for data security, utilizing the computational abilities of DNA. Safdari explored the use of genetic algorithms to construct universal hash functions for efficient hashing of changing input distributions.
Hash algorithm attacks review5 answersCryptographic hash functions have been extensively studied due to their importance in achieving security goals in various applications. These functions compress input strings to fixed-length strings and are used for authenticity, digital signatures, pseudo number generation, and more. However, the security of hash functions has become a major concern as new attacks are constantly emerging. Standard hash function algorithms like MD5, SHA-1, SHA-2, SHA-3, and RIPEMD have been proposed, but they suffer from collision attacks and time inefficiency. Other hash function algorithms have also been explored, but they still exhibit weaknesses against collision attacks. It is important to develop secure hash functions that are resistant to attacks and can be used in various security applications.