Exam SY0-601 topic 1 question 15 discussion

A 100% sure

Hashing is a cryptographic process that takes an input (such as a user password) and transforms it into a fixed-size, unique string of characters, known as the hash value or hash code. The hashing algorithm performs a one-way function, meaning it is not possible to reverse the process and retrieve the original password from the hash value alone. The resulting hash value is unique to the input, meaning different passwords will result in different hash values. By storing only the hash values of passwords instead of the passwords themselves, the administrator ensures that even if the database is compromised, the actual passwords are not exposed to attackers. When a user attempts to log in, the password they provide is hashed and compared to the stored hash value. If the hash values match, the password is considered correct, and access is granted.

The administrator is being advised to perform a mathematical operation on the passwords that will convert them into unique strings. Therefore, the correct option is: A. Perform a mathematical operation on the passwords that will convert them into unique strings. Hashing is a process that takes a password as input, performs a mathematical operation on it, and generates a fixed-length string of characters as output, called a hash. The hash can be stored in a database and used to authenticate the user. When the user enters their password, the same mathematical operation is performed on it, and the resulting hash is compared to the stored hash. If the two hashes match, the user is authenticated. The use of hashing is a widely accepted method for securing passwords.

The administrator is being advised to hash the passwords. Hashing is a process of applying a mathematical algorithm to a password, resulting in a unique string of characters known as a hash value or hash code. The hash value is typically of fixed length, regardless of the input password's length. When passwords are hashed, they are transformed into irreversible representations. Hash functions are designed in such a way that it is computationally infeasible to reverse-engineer the original password from the hash value. This ensures that even if the hashed passwords are compromised, the actual passwords remain protected. Hashing is a widely used technique to securely store passwords. Instead of storing the passwords themselves, the system stores the hash values. During the authentication process, the user's entered password is hashed and compared to the stored hash value. If the hashes match, the password is considered correct.

its just asking for a definition of hashing

This is the most meaningful answer here.

A. is the definition of hashing

A. Hashing pushes the data through a one way algorithm resulting in a string that you can use to compare against the original value. All other answers don't really make any sense.

Basically a cryptography method.

ITS A FO SHO

It is A Option be will be salting.

This question wants to test if you know that definition of a hash function which is described in OPTION A.

A - What's Hashing About? By dictionary definition, hashing refers to "chopping something into small pieces" to make it look like a "confused mess". That definition closely applies to what hashing represents in computing. In cryptography, a hash function is a mathematical algorithm that maps data of any size to a bit string of a fixed size. We can refer to the function input as message or simply as input. The fixed-size string function output is known as the hash or the message digest. As stated by OWASP, hash functions used in cryptography have the following key properties:

Guys, don't invent the wheel again. The question is stating what the told the guy to do! That us hashing. And the answer A is the definition of hash. You can find on google

A - Common uses of hashing algorithms are to store computer passwords and to ensure message integrity. The idea is that hashing can produce a unique value that corresponds to the data entered, but the hash value is also reproducible by anyone else running the same algorithm against the data.

B here for me seems the one that fits best.