scholarly journals Cryptographic hash functions for image processing

2021 ◽  
Author(s):  
Shafaq Iftikhar
Keyword(s):  
Image Processing ◽  
Hash Function ◽  
Hash Functions ◽  
High Sensitivity ◽  
High Complexity ◽  
Sole Purpose ◽  
High Security ◽  
Using Data ◽  
Cryptographic Hash Functions ◽  
Novel Algorithm

In this paper, a novel algorithm based on hash function for image cryptography is proposed. In this algorithm, the key idea is to encrypt half of the image using data from the second half of the image and then apply it to each other. This scheme can achieve high sensitivity, high complexity, and high security. The sole purpose is to improve the image entropy.

scholarly journals Cryptographic hash functions for image processing

2021 ◽  
Author(s):  
Shafaq Iftikhar
Keyword(s):  
Image Processing ◽  
Hash Function ◽  
Hash Functions ◽  
High Sensitivity ◽  
High Complexity ◽  
Sole Purpose ◽  
High Security ◽  
Using Data ◽  
Cryptographic Hash Functions ◽  
Novel Algorithm

In this paper, a novel algorithm based on hash function for image cryptography is proposed. In this algorithm, the key idea is to encrypt half of the image using data from the second half of the image and then apply it to each other. This scheme can achieve high sensitivity, high complexity, and high security. The sole purpose is to improve the image entropy.

scholarly journals Building a 256-bit hash function on a stronger MD variant

2014 ◽  
Vol 4 (2) ◽  
Author(s):  
Harshvardhan Tiwari ◽  
Krishna Asawa
Keyword(s):  
Hash Function ◽  
Design Principle ◽  
Hash Functions ◽  
High Sensitivity ◽  
Differential Attack ◽  
Compression Function ◽  
Single Output ◽  
Generic Attacks ◽  
Cryptographic Techniques ◽  
Cryptographic Hash Functions

AbstractCryptographic hash functions are important cryptographic techniques and are used widely in many cryptographic applications and protocols. All the MD4 design based hash functions such as MD5, SHA-1, RIPEMD-160 and FORK-256 are built on Merkle-Damgård iterative method. Recent differential and generic attacks against these popular hash functions have shown weaknesses of both specific hash functions and their underlying Merkle-Damgård construction. In this paper we propose a hash function follows design principle of NewFORK-256 and based on HAIFA construction. Its compression function takes three inputs and generates a single output of 256-bit length. An extra input to a compression function is a 64-bit counter (number of bits hashed so far). HAIFA construction shows strong resistance against major generic and other cryptanalytic attacks. The security of proposed hash function against generic attacks, differential attack, birthday attack and statistical attack was analyzed in detail. It is shown that the proposed hash function has high sensitivity to an input message and is secure against different cryptanalytic attacks.

scholarly journals Uniform logical cryptanalysis of CubeHash function

2010 ◽  
Vol 23 (3) ◽  
pp. 357-366
Author(s):  
Miodrag Milic ◽  
Vojin Senk
Keyword(s):  
Hash Function ◽  
Hash Functions ◽  
Promising Method ◽  
International Competition ◽  
Great Effort ◽  
Cryptographic Hash Function ◽  
The World ◽  
Cryptographic Hash Functions ◽  
Made In

In this paper we present results of uniform logical cryptanalysis method applied to cryptographic hash function CubeHash. During the last decade, some of the most popular cryptographic hash functions were broken. Therefore, in 2007, National Institute of Standards and Technology (NIST), announced an international competition for a new Hash Standard called SHA-3. Only 14 candidates passed first two selection rounds and CubeHash is one of them. A great effort is made in their analysis and comparison. Uniform logical cryptanalysis presents an interesting method for this purpose. Universal, adjustable to almost any cryptographic hash function, very fast and reliable, it presents a promising method in the world of cryptanalysis.

Hash Functions and Their Applications

2018 ◽  
pp. 66-77
Author(s):  
Kannan Balasubramanian
Keyword(s):  
Hash Function ◽  
Hash Functions ◽  
Digital Signatures ◽  
Message Authentication ◽  
Authenticated Encryption ◽  
Authentication Codes ◽  
Message Authentication Codes ◽  
Message Digest ◽  
Cryptographic Hash Functions

Cryptographic Hash Functions are used to achieve a number of Security goals like Message Authentication, Message Integrity, and are also used to implement Digital Signatures (Non-repudiation), and Entity Authentication. This chapter discusses the construction of hash functions and the various attacks on the Hash functions. The Message Authentication Codes are similar to the Hash functions except that they require a key for producing the message digest or hash. Authenticated Encryption is a scheme that combines hashing and Encryption. The Various types of hash functions like one-way hash function, Collision Resistant hash function and Universal hash functions are also discussed in this chapter.

scholarly journals A Survey: Cryptographic Hash Functions for Digital Stamping

2019 ◽  
Vol 54 (6) ◽  
Author(s):  
Israa Ezzat Salem ◽  
Adil M. Salman ◽  
Maad M. Mijwil
Keyword(s):  
Computer Science ◽  
Digital Signature ◽  
Data Security ◽  
Hash Function ◽  
Hash Functions ◽  
Mathematical Science ◽  
Integrity Verification ◽  
General Overview ◽  
Rootkit Detection ◽  
Cryptographic Hash Functions

The current study aims to examine a general overview of the application of hash functions in cryptography and study the relationships between cryptographic hash functions and uses of the digital signature. Functions of the cryptographic hash are an important tool applied in several sections of data security, and application of hash function is common and used for various purposes such as File Integrity Verification, Key Derivation, Time stamping, Password Hashing, Rootkit Detection and Digital Signature. Digital Signature is a code that is linked electronically with the document including the sender's identity. Therefore, the digital signature is of high value in verifying digital messages or documents. Cryptographic hash functions do not present without mathematics. The success of computer science is attributed to mathematics; in other words, it is because of mathematical science, that computer science was understood and could be explained to all. The study aims to teach the reader hash functions and its applications such as digital signature and to show in details some hash functions and their designing.

scholarly journals Privacy and Robust Hashes

2020 ◽  
pp. 111-140
Author(s):  
Martin Steinebach ◽  
Sebastian Lutz ◽  
Huajian Liu
Keyword(s):  
Distance Function ◽  
Data Protection ◽  
Hash Function ◽  
Hash Functions ◽  
Minimal Change ◽  
The Other ◽  
Similarity Measurement ◽  
Image Content ◽  
Exact Agreement ◽  
Cryptographic Hash Functions

Within a forensic examination of a computer for illegal image content, robust hashing can be used to detect images even after they have been altered. Here the perceptible properties of an image are used to create the hash values.Whether an image has the same content is determined by a distance function. Cryptographic hash functions, on the other hand, create a unique bit-sensitive value. With these, no similarity measurement is possible, since only with exact agreement a picture is found. A minimal change in the image results in a completely different cryptographic hash value. However, the robust hashes have an big disadvantage: hash values can reveal something about the structure of the picture. This results in a data protection leak. The advantage of a cryptographic hash function is in turn that its values do not allow any conclusions about the structure of an image. The aim of this work is to develop a procedure for which combines the advantages of both hashing functions.

scholarly journals Performance and Limitation Review of Secure Hash Function Algorithm

2019 ◽  
Vol 7 (6) ◽  
pp. 48-51
Author(s):  
Iti Malviya ◽  
Tejasvini Chetty
Keyword(s):  
Information Security ◽  
Digital Signature ◽  
Arbitrary Number ◽  
Hash Function ◽  
Hash Functions ◽  
Cryptographic Hash Functions ◽  
The Web

A cryptographic hash work is a phenomenal class of hash work that has certain properties which make it fitting for use in cryptography. It is a numerical figuring that maps information of emotional size to a bit string of a settled size (a hash) and is expected to be a confined limit, that is, a limit which is infeasible to adjust. Hash Functions are significant instrument in information security over the web. The hash functions that are utilized in different security related applications are called cryptographic hash functions. This property is additionally valuable in numerous different applications, for example, production of digital signature and arbitrary number age and so on. The vast majority of the hash functions depend on Merkle-Damgard development, for example, MD-2, MD-4, MD-5, SHA-1, SHA-2, SHA-3 and so on, which are not hundred percent safe from assaults. The paper talks about a portion of the secure hash function, that are conceivable on this development, and accordingly on these hash functions additionally face same attacks.

High Speed FPGA Implementation of Cryptographic KECCAK Hash Function Crypto-Processor

2016 ◽  
Vol 25 (04) ◽  
pp. 1650026 ◽  
Author(s):  
Fatma Kahri ◽  
Hassen Mestiri ◽  
Belgacem Bouallegue ◽  
Mohsen Machhout
Keyword(s):  
Hash Function ◽  
High Speed ◽  
Hash Functions ◽  
Message Authentication ◽  
Authentication Codes ◽  
Trade Off ◽  
Security Applications ◽  
Hash Algorithm ◽  
The Us ◽  
Cryptographic Hash Functions

Cryptographic hash functions are at the heart of many information security applications like message authentication codes (MACs), digital signatures and other forms of authentication. One of the methods to ensure information integrity is the use of hash functions, which generates a stream of bytes (hash) that must be unique. But most functions can no longer prevent malicious attacks and ensure that the information have just a hash. Because of the weakening of the widely used SHA-1 hash algorithm and concerns over the similarly-structured algorithms of the SHA-2 family, the US National Institute of Standards and Technology (NIST) has initiated the SHA-3 contest in order to select a suitable drop-in replacement. KECCAK hash function has been submitted to SHA-3 competition and it belongs to the final five candidate functions. In this paper, we present the implementation details of the hash function’s KECCAK algorithm, moreover, the proposed KECCAK design has been implemented on XILINX FPGAs. Its area, frequency, throughput and efficiency have been derived and compared and it is shown that the proposed design allows a trade-off between the maximum frequency and the area implementation.

scholarly journals Theoretical and Experimental Analysis of Cryptographic Hash Functions

2019 ◽  
Vol 1 ◽  
pp. 125-133 ◽  
Author(s):  
Jacek Tchórzewski ◽  
Agnieszka Jakóbik
Keyword(s):  
Statistical Analysis ◽  
Experimental Analysis ◽  
Hash Function ◽  
Function Theory ◽  
Hash Functions ◽  
Security Level ◽  
Cryptographic Hash Function ◽  
Definition Of ◽  
Cryptographic Hash Functions

The paper presents a theoretical introduction to the cryptographic hash function theory and a statistical experimental analysis of selected hash functions. The definition of hash functions, differences between them, their strengths and weaknesses are explained as well. Different hash function types, classes and parameters are described. The features of hash functions are analyzed by performing statistical analysis. Experimental analysis is performed for three certified hash functions: SHA1-160, SHA2-512 and SHA3-512. Such an analysis helps understand the behavior of cryptographic hash functions and may be very helpful for comparing the security level of the hashing method selected. The tests may serve as a basis for examination of each newly proposed hash function. Additionally, the analysis may be harness as a method for comparing future proposals with the existing functions.

Performance and Security Tradeoffs in Cryptographic Hash Functions

2020 ◽  
Vol 12 (4) ◽  
pp. 37-51
Author(s):  
Sultan Almuhammadi ◽  
Omar Mohammed Bawazeer
Keyword(s):  
Sensitivity Analysis ◽  
Mobile Devices ◽  
Digital Signature ◽  
Hash Function ◽  
Hash Functions ◽  
Paper Study ◽  
Computational Power ◽  
Collision Resistance ◽  
Block Sizes ◽  
Cryptographic Hash Functions

A cryptographic hash function is an important component used in many applications, such as blockchain, authentication, data integrity, and digital signature. With the rapid increase in usage of mobile devices, more attention goes towards the tradeoffs between performance and security of cryptographic hash functions on mobile devices due to their limited computational power. The researchers in this paper study the most common cryptographic hash functions and highlights the tradeoffs between their performance and security. The hash functions considered in this study are MD4, MD5, Whirlpool, and the hash functions in the SHA family. The security of these hash functions is compared based on recent attacks in terms of collision resistance, preimage attacks, and sensitivity analysis. While the performance is tested on different input block sizes, useful observations and recommendations are made based on the results of this study.

Sign in / Sign up

Export Citation Format

Share Document