All categories

3 years ago

The principal object of a hash function is __________ .

Computers and Technology

1 answer:

abruzzese [7]3 years ago

8 0

Answer:

a. data integrity

Explanation:

In Computer science, a hash function can be defined as any function which is used to map data by accepting a block of data with variable length size or arbitrary size as input to produce a fixed size hash values or codes.

Generally, when a block of data (input) of arbitrary size is hashed, the resulting hash values or codes is usually smaller than the input data. Thus, hash functions are considered to be a compression of data and as a result, sometimes called compression functions. Basically, the block size of a hash function typically ranges from 128 bits to 512 bits.

Some of the properties of a hash function are;

1. Pre-image resistance: this makes it practically impossible to reverse a fixed-size hash values to its initial arbitrary size. This property helps to maintain and enhance data integrity by making it difficult or impossible for an attacker to find the input data from a hash value.

2. Second pre-image resistance: this property makes it near impossible or very difficult to determine or decode another input data from a given set of input and hash values. Also, this helps to enhance data integrity.

3. Collision resistance: this is to make possible for all hash values to have a unique value. This simply means that, with this property it would be difficult for different input data to have the same hash value. Thus, it helps to create integrity in data management.

Hence, with the aforementioned properties, the principal object of a hash function is data integrity.

Hash functions in the computer world includes;

1. Message Digest (MD): it is a 128 bit hash function and comprises of the following; MD2, MD4, MD5, and MD6.

2. Secure Hash Function (SHA): it comprises of the following; SHA-0, SHA-1,SHA-2, and SHA-3.

3. Whirlpool: it comprises of the following; Whirlpool-0, Whirlpool-T, and Whirlpool. It is primarily a 512 bit hash function.

4. RACE Integrity Primitives Evaluation Message Digest (RIPEMD): it comprises of the following versions; RIPEMD, RIPEMD-128, and RIPEMD-160.

You might be interested in

A cloud data storage company develops a proprietary system of hardware and software, trains its systems analysts on the technolo

cupoosta [38]

Answer:

Creating Strategic Fit

Explanation:

Strategic fit expresses the degree to which an organization is matching its resources and capabilities with the opportunities in the external environment. The matching takes place through strategy and it is therefore vital that the company has the actual resources and capabilities to execute and support the strategy. Strategic fit can be used actively to evaluate the current strategic situation of a company as well as opportunities such as M&A and divestitures of organizational divisions.

7 0

3 years ago

Which Boolean operator enables you to exclude a search term?

Lisa [10]

It is letter D. but i might be incorrect, please contact your teacher for further information. sorry if I got your answer wrong... :(

4 0

3 years ago

Read 2 more answers

Consider the following code segment, which is intended to set the Boolean variable inRange to true if the integer value num is g

Natasha_Volkova [10]

Answer:

Option d num = 50, min = 50, max = 50

Explanation:

Given the code segment:

boolean isBigger;
boolean isSmaller;
boolean inRange;
if (num < max)
{
isSmaller = true;
}
else {
isSmaller = false;
}
if (num > min)
{
isBigger = true;
}
else {
isBigger = false;
}
if (isBigger == isSmaller) {
inRange = true;
} else {
inRange = false;
}

If we have num = 50, min = 50 , max = 50, the condition num < max will be evaluated to false and therefore isSmaller is set to false.

The condition num > min will be evaluated to false as well and therefore isBigger is set to false.

Since isSmaller and isBigger are both false and therefore isBigger == isSmaller will be evaluated to true and set the inRange = true. This has violated the statement that if the integer value num is greater than min value and less than max value, then only set inRange to true. This is because num = 50 is neither greater than min nor less than max, it is supposedly not in range according to the original intention of the code design.

8 0

3 years ago

Develop a CPP program to test is an array conforms heap ordered binary tree. This program read data from cin (console) and gives

mafiozo [28]

Answer:

Following are the code to this question:

#include<iostream>//import header file

using namespace std;

int main()//defining main method

{

int ar[7];//defining 1_D array that stores value

int i,x=0,l1=1,j; //defining integer variable

for(i=0;i<7;i++)//defining for loop for input value from user ends

{

cout<<"Enter a Number: ";//print message

cin>>ar[i];//input value in array

if(l1<=2 && i>0)//using if block that checks the array values

{

x++;//increment the value of x by 1

}

if(l1>2 && i>0)//using if block that checks the array values

{

l1=l1-2;//using l1 variable that decrases the l1 value by 2

}

j=i-x;//using j variable that holds the index of the root of the subtree

if(i>0 && ar[j]>ar[i])// use if block that checks heap condition

{

l1++; //increment the value of l1 variable

}

if(i>0 && ar[j]<ar[i])// using the if block that violate the heap rule

{

cout<<ar[i]<<" "<<"Violate the heap";//print message with value

break;//using break keyword

}

return 0;

}

Output:

Enter a Number: -15

Enter a Number: -5

-5 Violate the heap

Enter a Number: 45

Enter a Number: 0

Enter a Number: 55

55 Violate the heap

Explanation:

In the above-given C++ language code, an array "ar" and other integer variables " i,x,l1, j" is declared, in which "i" variable used in the loop for input values from the user end.
In this loop two, if block is defined, that checks the array values and in the first, if the block it will increment the value of x, and in the second if the block, it will decrease the l1 value by 2.
In the next step, j variable is used that is the index of the root of the subtree. In the next step, another if block is used, that checks heap condition, that increment the value of l1 variable. In the, if block it violate the heap rule and print its values.

5 0

3 years ago

Whats a field in databases?

SVETLANKA909090 [29]

A field is a single attribute of an entity, object or event.

3 0

3 years ago