0
Want this question answered?
Be notified when an answer is posted
Add your answer:
Earn +20 pts
What is the best way of referring to the output of a secure hash function?
The output from a hash function is referred to as the hash value, hash code, hash sum, checksum or just plain "hash" as in "the hash of the file is...". Generally a hash function is presumed to be secure or it wouldn't be used. If a hash is not secure it could be referred to as "worthless" or "false sense of security".
What is hash key?
hash key is an element in the hash table. it is the data that you will combine (mathematical) with hash function to produce the hash.
What is a hash function?
hash function is technique used in message authentication it is attached to the message for security purpose
Insert value into hash table?
Insertion in hash tables is based on a 'key' value which is calculated on the basis of a hash function. This hash function generates the key based on what type of data it is fed. For example hash function for an integer input might look like this : int hash(int val) { return (val%101); } where return value of hash function would become a key. Complete implementation can be found at: http://simplestcodings.blogspot.com/2010/07/hash-table.html
Advantages of Secure hash algorithm?
because it is more secure than any other algorithm.
What is double hashing in data structure?
if collision is occurred in hash function then we can solve this problem by using double hash function
What is a decryption of the hash string 108933322ed670db49b0141d10f6dbbe?
To decode a hash string you first need to know what hash function was used to encode it.
What is the standard for encryption currently recommended by NIST?
The secure hash standard
What code should you write in c plus plus that if the user enters a particular word then it further proceeds?
You're talking about password entry. For that you will need a one-way cryptographic hashing function. The hashing function converts a user's name and password into a hash value which can be openly stored on disk. Being a one-way function, even if an intruder knows the hash values, it is not possible for them to determine which user name and password combination was used to generate which hash value other than by brute force. The most widely used cryptographic hash functions are SHA-1 (Secure Hash algorithm 1) and MD5 (named after the Merkle-Damgård construction upon which it is based). However, SHA-1 implementations are being dropped due to well-funded intrusions which suggest it is no longer secure. It has since been replaced by SHA-2 and SHA-3.
Define hashing and describe briefly including types of hashing and where it is used and advantages and disadvantages of hashing?
Hashing is performed on arbitrary data by a hash function. A hash function is any function that can convert data to either a number or an alphanumeric code. There are possibly as many types of hashing as there are data. How precisely the hash function works depends on what data it is meant to generate a hash code from. Hashing is used for a variety of things. For example, a hash table is a data structure used for storing data in memory. Instead of iterating through the structure to find a specific item, we associate a key (hash code) to a particular item (data). A hash code can be generated from a file or disk image. If the data does not match the code, then the data is assumed to be corrupted. Hashing has the advantage of taking a larger amount of data and representing it as a smaller amount of data (hash code). The code generated is unique to the data it came from. Generating a hash code can take time however, depending on the function and the data. Some hash functions include Bernstein hash, Fowler-Noll-Vo hash, Jenkins hash, MurmurHash, Pearson hashing and Zobrist hashing.
What is the most insecure hash for storing passwords?
Of the conman ones in use today MD5 is the least secure.
What is the major advantage of a hash table?
The major advantage of a hash table is its speed. Because the hash function is to take a range of key values and transform them into index values in such a way that the key values are distributed randomly across all the indices of a hash table.
