Academia.edu no longer supports Internet Explorer.
To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to upgrade your browser.
2013, International Journal of Computer Applications
Message Integrity and authenticity are the primary aim with the ever increasing network protocols' speed. Cryptographic Hash Functions are main building block of message integrity. Many types of hash functions are being used and developed. In this paper, we propose and describe a new keyed hash function. This newly designed function produces a hash code of 128 bits for an arbitrary length input. The function also uses a key during hashing, so any intruder that does not know key, cannot forge the hash code, and, thus it fulfills the purpose of security, authentication and integrity for a message in network. The paper discusses the algorithm for the function design, its security aspects and implementation details.
Message Integrity and authenticity are the primary aim with the ever increasing network protocols' speed. Cryptographic Hash Functions are main building block of message integrity. Many types of hash functions are being used and developed. In this paper, we propose and describe a new keyed hash function. This newly designed function produces a hash code of 128 bits for an arbitrary length input. The function also uses a key during hashing, so any intruder that does not know key, cannot forge the hash code, and, thus it fulfills the purpose of security, authentication and integrity for a message in network. The paper discusses the algorithm for the function design, its security aspects and implementation details.
Arxiv preprint arXiv:1003.5787, 2010
Cryptographic hash functions for calculating the message digest of a message has been in practical use as an effective measure to maintain message integrity since a few decades. This message digest is unique, irreversible and avoids all types of collisions for any given input string. The message digest calculated from this algorithm is propagated in the communication medium along with the original message from the sender side and on the receiver side integrity of the message can be verified by recalculating the message digest of the received message and comparing the two digest values. In this paper we have designed and developed a new algorithm for calculating the message digest of any message and implemented it using a high level programming language. An experimental analysis and comparison with the existing MD5 hashing algorithm, which is predominantly being used as a cryptographic hashing tool, shows this algorithm to provide more randomness and greater strength from intrusion attacks. In this algorithm the plaintext message string is converted into binary string and fragmented into blocks of 128 bits after being padded with user defined padding bits. Then using a pseudo random number generator a key is generated for each block and operated with the respective block by a bitwise operator. This process is iterated for the whole message and finally a fixed length message digest is obtained.
International Journal of Engineering and Technology, 2011
In today's word the authentication is very much required for the purpose of the transfer of the information from one place to another. Now a day's the use of E-mail become very popular because of their fast and easy to use in nature. This new technology has led to the problem of Authentication of the Message. To perform this activity we use the technique called MAC (Message Authentication Code). The message authentication code is the digest that is send along with the message to authenticate the origin of the message from where it is generated. The MAC (Message Authentication Code) is generated by the process of creating the message digest and also adding the encryption to it. However this is not very secure. In this paper we will encrypt the message digest and then again use the previously available cryptographic algorithm and again encrypt the Message. We this the idea of confusion and diffusion make are message more secure.
2018
In today’s Internet communication scenario to guarantee the security of data being transmitted and to believe on the integrity and authenticity of data, the hash function play very important role. It is one of the fundamental tools in security algorithms. There are studies that show the security flaws in widely used hash functions. Thus it is the need of the hour to have a new hash function design to enhance the security and authenticity of data, in turn network communication. In the proposed work we are presenting a new message digest scheme, based on an ASCII character and random numbers. The algorithm also uses secretly designed character filter to generate the final Hash key. Different hashing performances tests are evaluated like statistical property analysis, collision analysis, absolute difference, and uniqueness test by changing original message conditions. Results of these tests are promising. The mean changed probabilities are greater than 50%, low collision frequency, and...
2002
Abstract This report gives a survey on cryptographic hash functions. It gives an overview of different types of hash functions and reviews design principles. It also focuses on keyed hash functions and suggests some applications and constructions of keyed hash functions. We have used hash (keyed) function for authenticating messages encrypted using Rijndael [1] block cipher. Moreover, a parallel message digest has been implemented using VHDL.
The use of cryptography started from late 1970s and became more prominent in 1980s.Commercial use of cryptograghy started in late 1990s.Many organization started using cryptographic tools for information security but many security challenges were faced by the organizations.The cryptographic designs were having more security flaws.The use of cryptography functions started from MD5 and SHA-1.Now we are going to enter into digital era ,therefore it is very important to discuss the role of cryptographic functions in our day to day activities. Cryptographic functions are used for encryption, digital signatures, secure hashing, message (data) authentication codes, key management, entity authentication, password, and random number generation etc. This paper explains the history of the usage ,design,concept, and the applications of hash functions.
umdrive.memphis.edu
A cryptographic hash function is an important tool in cryptography for applications such as digital fingerprinting of messages, message authentication and key derivation [1]. Particular hash functions are distinguished by the nature of the preprocessing [2], compression function, and output transformation. The hash-value corresponding to a particular input is computed at some point in time. The integrity of this hash-value is protected in some manner. At a subsequent point in time, to verify that the input data have not been altered, the hash value is recomputed using the input at hand, and compared for equality with the original hash-value. In this paper, a new hash function or a message digest has been proposed as an authentication scheme.
Scientific Bulletin of Naval Academy, 2019
There are different methods by which a message hashing could be embedded in a communications network, therefore different approaches are described in this research to protect the hash value of a message. The structure of a cryptographically secure function (SHA-512) is presented along with the low-level algorithm sequence. Subsequently is detailed the Hash-based Message Authentication Code (HMAC) produced by concatenating a secret key and message, after which the composite message is hashed. However, the HMAC numerical structure and the specific operating algorithm are explained in detail to the logical gate level. Finally, several considerations regarding the low-level implementation of the code are concluded.
— " One way hash functions " plays an important role in data integrity, message authentication, and digital signature in modern information security. This paper proposed a fast one-way hash function to optimize the time delay with strong collision resistance, assures a good compression and one-way resistance. It is based on the standard secure hash function (SHA-1) algorithm. The analysis indicates that the proposed algorithm which we call OSHA is time efficient and proven for better compression function.
2021
Due to the rapid development of internet technologies, voluminous data is generated every minute from multifarious sources. Therefore, it becomes arduous for traditional tools to analyse and process such a huge amount of data. Cryptographic hashing is one of the best techniques to cope with big data in an effective way. It also plays a pivotal role in protecting integrity of message while in transmission. In this paper, a novel one-way cryptographic hashing algorithm has been proposed, this produces a digest of size 128 bits for any length of a message. This paper provides implementation results of basic properties of the hashing algorithm and these results prove that proposed algorithm is better than the existing ones in terms of execution time and security.
2006 International Conference on Advanced Computing and Communications, 2006
The focus of this work is to provide authentication and confidentiality of messages in a swift and cost effective manner to suit the fast growing Internet applications. A nested hash function with lower computational and storage demands is designed with a view to providing authentication as also to encrypt the message as well as the hash code using a fast stream cipher MAJE4 with a variable key size of 128-bit or 256-bit for achieving confidentiality. Both nested Hash function and MAJE4 stream cipher algorithm use primitive computational operators commonly found in microprocessors; this makes the method simple and fast to implement both in hardware and software. Since the memory requirement is less, it can be used for handheld devices for security purposes.
International Journal of Advanced Research in Computer Science, 2020
The term hash function has been used in computer science from quite some time and it refers to a function that compresses a string of arbitrary input to a string of fixed length. Cryptographic hash functions are one of the most important tools in the field of cryptography and are used to achieve a number of security goals like authenticity, digital signatures, pseudo number generation, digital steganography, digital time stamping etc. For the past few decades cryptographic hash function become the centre of attention in the cryptographic community. The security of hash function became an important topic as almost every day the world of hash function is facing a new attack. The present paper provides an extensive study on cryptographic hash functions with their applications, properties and detailed classification and also presents a detailed description of cryptographic hash algorithms. It also discusses a general classification of all kinds of possible attacks on hash function analyses some attacks on specific hash functions.
African Journal of Business Management, 2011
Hashing is a process of transforming a variable length data message into a fixed size message digest. Hashing algorithms are considered one-way functions, since the input cannot be determined from the message digests. As a security tool in data communication, hashing is used both for protecting data integrity and for authentication. This study introduces a newly developed hash function. In hashing function, the most important features required are that the function must hash a message of any size, a message with a fixed size, and minor changes formed in hashed message must also change the hash. Effects of possible deformations in the hash message will subsequently be discussed through some tests.
Computers & Security, 1989
This paper considers the use of hash fktions for message authentication. It is shown that a proposed method for using hash functions does not provide a secure non-repudiation service.
Wireless sensor networks (WSNs) are used in many applications to gather sensitive information which is then forwarded to an analysis center. Resource limitations have to be taken into account when designing a WSN infrastructure. Authentication in WSNs is critical, as they are often deployed unattended in hostile environments and must transmit information over unsecured mediums. However, the cost of performing cryptographic operations is an extremely limiting factor because sensor devices and related equipment are constrained by storage and computational ability. Hash functions are the most widespread among all Authentication primitives, and are currently used in multiple cryptographic schemes and in security protocols. This paper presents a new Secure Hash Algorithm called (2AMD-160) which uses a famous structure of hash algorithm given by the MIT Laboratory for Computer Science and RSA Data Security, Inc. To demonstrate the effectiveness of 2AMD-l60 in terms of security and execution time, we compare our approach with two methods namely, MD5 and SHAl hash function algorithms. Simulation results demonstrate that the execution time and the security achieved by the proposed method are more effective than the MD5 and SHAI.
International Journal of Scientific Research in Computer Science Applications and Management Studies, 2018
This Electronic commerce or e-commerce is currently one of the most significant aspects of the Internet to emerge. It covers a range of different types of businesses, Smart cards today perceive epidemic growth as a secure and favourable identification and authentication schemes with various applications like using control system, driving license, Epassports, E-commerce business etc., and the list is expanding. During recent years, cryptographic approaches have been applied to remove these problems. Among these approaches, Dynamic Id protocols have been played a vital role in providing secure communications. ID-based authentication scheme which can reduce all kinds of security flaws. The functionally, performance and security analysis show that current methodology is feasible in terms of computation cost, storage capacity and the scheme can resist server attack.
In today's scenario we totally depend on the internet for our everyday tasks. The amount of data transmitted through the internet is growing every day. The need of a hashing algorithm that can guarantee that the integrity and confidentiality of the data is maintained. The aim of the research project is to ensure secure transmission and reception of data with speed and reliability. This model uses the Secure Hash Algorithm (SHA) that creates and appends hashes of the data during transmission. This project aims to discuss the drawbacks and shortcomings of the now used hashing algorithms and come up with enhanced security features along with maintaining speed.
Computer as a Tool, …, 2005
A design approach to create small-sized highspeed implementations of the Keyed-Hash Message Authentication Code (HMAC) is presented. The proposed implementation can either operate in HMAC-MD5 and/or in HMAC-SHA1 mode. The proposed implementations do not introduce significant area penalty. However the achieved throughput presents an increase compared to commercially available IP cores that range from 30%-390%. The main contribution of the paper is the increase of the HMAC throughput to the required level to be used in modern telecommunication applications, such as VPN and the oncoming 802.11n.
IJCSMC, 2019
In Network Security and Cryptography, hash functions play a very important role. To check the Integrity, Authenticity of information or data transmitting between the Seder and receiver party hash algorithms are used. Digital signature also uses the hash algorithm. Hash function used for key generation in Symmetric and Asymmetric Key Cryptosystems. Different algorithms provide different level of security depending on how difficult is to break them. The most well-known hash algorithms are SHA-1, SHA-2, SHA-3, MD4, MD5 and Whirlpool etc. This paper discusses importance of hash functions, description about various well known hash functions, and comparative analysis of various hash algorithms.
2010
Recent cryptanalytic attacks have exposed the vulnerabilities of some widely used cryptographic hash functions like MD5 and SHA-1. Attacks in the line of differential attacks have been used to expose the weaknesses of several other hash functions like RIPEMD, HAVAL. In this paper we propose a new efficient hash algorithm that provides a near random hash output and overcomes some of the earlier weaknesses. Extensive simulations and comparisons with some existing hash functions have been done to prove the effectiveness of the BSA, which is an acronym for the name of the 3 authors.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.