Hash-values

10/12/2019 SafeAssign Originality Report

https://ucumberlands.blackboard.com/webapps/mdb-sa-BB5a31b16bb2c48/originalityReportPrint?course_id=_110648_1&paperId=2217001070&&atte… 1/6

2326.202010 - FALL 2019 - CRYPTOGRAPHY (ISOL-535-22) - FULL TERM

How to use Hash Values Sai Krishna Kailasapu on Sat, Oct 12 2019, 5:41 PM

38% highest match Submission ID: e5f092a7-108c-4ee5-bd6f-2aaa1decf61a

Attachments (1)

hashvalues.docx

1

1 A HASH VALUE IS ANY VALUE THAT CAN BE UTILIZED TO DELINEATE OF

SELF-ASSERTIVE SIZE TO FIXED-SIZE VALUES. THE QUALITIES RETURNED

BY A HASH VALUE ARE CALLED HASH ESTEEMS, HASH CODES,

CONDENSATIONS, OR BASICALLY HASHES. 2 THE QUALITIES ARE

UTILIZED TO FILE A FIXED-SIZE TABLE CALLED A HASH TABLE. Utilization of a

hash value to file a hash table is called hashing or disperse value tending to.

Hash values and their related hash tables are utilized in information stockpiling and recovery

applications to get to information in a little and about steady time per recovery, and extra

room just partially more noteworthy than the all-out space required for the information or

records themselves. Hashing is a computationally and extra room productive type of

information get to which maintains a strategic distance from the non-straight access time of

requested and unordered records and organized trees, and the frequently exponential

stockpiling prerequisites of direct access of state spaces of enormous or variable-length keys.

The Use of hash values depends on factual properties of key and value communication: most

pessimistic scenario conduct is terribly awful with a vanishingly little likelihood, and normal

(http://safeassign.blackboard.com/)

hashvalues.docx Word Count: 885 Attachment ID: 2217001070

38%

xxxxxxxxxxxxxxxxx

10/12/2019 SafeAssign Originality Report

https://ucumberlands.blackboard.com/webapps/mdb-sa-BB5a31b16bb2c48/originalityReportPrint?course_id=_110648_1&paperId=2217001070&&atte… 2/6

case conduct can be almost ideal A hash value takes as info a key, which is related with a

datum or record and used to distinguish it to the information stockpiling and recovery

application. 2 THE KEYS MIGHT BE FIXED LENGTH, SIMILAR TO A WHOLE

NUMBER, OR VARIABLE LENGTH, SIMILAR TO A NAME. Now and again, the key is

simply the datum. 2 THE YIELD IS A HASH CODE USED TO FILE A HASH TABLE

HOLDING THE INFORMATION OR RECORDS, OR POINTERS TO THEM.

A HASH VALUE MIGHT BE CONSIDERED TO PERFORM THREE VALUES:

CONVERT VARIABLE LENGTH KEYS INTO FIXED LENGTH (MORE OFTEN

THAN NOT MACHINE WORD LENGTH OR LESS) VALUES, BY COLLAPSING

THEM BY WORDS OR DIFFERENT UNITS UTILIZING AN EQUALITY

PROTECTING AN ADMINISTRATOR LIKE ADD OR XOR.

Scramble the bits of the key with the goal that the subsequent qualities are consistently

circulated over the key space. Guide the key qualities into ones not exactly or equivalent to the

size of the table A decent hash value fulfills two fundamental properties: 1) it ought to be

extremely quick to register; 2) it ought to limit duplication of yield esteems (crashes). Hash

values depend on producing good likelihood conveyances for their viability, diminishing

access time to almost steady. High table stacking factors, obsessive key sets and inadequately

structured hash values can bring about access times moving toward direct in the quantity of

things in the table. 2 HASH VALUES CAN BE INTENDED TO GIVE THE MOST

PESSIMISTIC SCENARIO PERFORMANCE, GOOD EXECUTION UNDER HIGH

TABLE STACKING FACTORS, AND IN UNCOMMON CASES, IMPECCABLE

MAPPING OF KEYS INTO HASH CODES. Execution depends on equality saving piece

tasks (XOR and ADD), increase, or partition.

A vital aide to the hash value is a crash goals technique that utilizes an auxiliary information

structure like connected records, or precise examining of the table to locate a vacant space. A

hash is intended to go about as a "single direction value" A numerical activity that is anything

but difficult to perform, yet hard to invert. Like different types of encryption, it transforms

coherent information into a mixed figure. In any case, rather than enabling somebody to

unscramble that information with a particular key, as run of the mill encryption values do,

hashes aren't intended to be decoded. Rather, when you enter your secret key on a site, it

basically plays out a similar hash again and checks the outcomes against the hash it made of

10/12/2019 SafeAssign Originality Report

https://ucumberlands.blackboard.com/webapps/mdb-sa-BB5a31b16bb2c48/originalityReportPrint?course_id=_110648_1&paperId=2217001070&&atte… 3/6

your secret word when you picked it, confirming the secret phrase's legitimacy without putting

away the delicate secret word itself.

Hash-cracking plans have for quite a long time been secured a waiting game with the security

network's endeavors to make hashing increasingly secure. Changing from typical PC

processors or CPUs to designs processors or GPUs enabled secret word saltines to abuse those

chips' value to perform numerous basic errands in parallel, quickening their speculating as

much as a thousand-fold. Hash-wafers have grown alleged "rainbow tables," colossal

arrangements of pre-processed hashes for each conceivable secret key. What's more, present

day secret word saltines don't just conjecture passwords indiscriminately, however use

"lexicon assaults" to burn through genuine words, accumulations of known normal passwords

from past breaks, and to utilize factual investigations of those passwords to see designs that

permit new passwords as speculated quicker.

A hash for the most part takes an info, accomplishes something with it, and what turns out

resembles irregular information," says Jens "Particle" Steube, the maker of the well-known

hash-breaking programming Hashcat. "At the point when you input similar information once

more, the information that turns out will be actually the equivalent. Also, that is the means by

which a help realizes that the info was right.

2 REFERENCES CASTRO, ET.AL., 2005, "THE SEVERE TORRENTIAL SLIDE

MODEL IRREGULARITY TEST", MATHEMATICS AND COMPUTERS IN

SIMULATION 68 (2005) 1–7, ELSEVIER, KNUTH, D. 1973, THE ART OF

COMPUTER SCIENCE, VOL. 3, SORTING AND SEARCHING, P.527. ADDISON-

WESLEY, READING, MA., UNITED STATES MENEZES, ALFRED J. VAN

OORSCHOT, PAUL C. VANSTONE, SCOTT A (1996). HANDBOOK OF APPLIED

CRYPTOGRAPHY. CRC Press. 2 ISBN 978-0849385230.

Citations (2/2)

Matched Text

1 Another student's paper

2 https://en.wikipedia.org/wiki?curid=13790

10/12/2019 SafeAssign Originality Report

https://ucumberlands.blackboard.com/webapps/mdb-sa-BB5a31b16bb2c48/originalityReportPrint?course_id=_110648_1&paperId=2217001070&&atte… 4/6

Suspected Entry: 76% match

Uploaded - hashvalues.docx A HASH VALUE IS ANY VALUE THAT CAN BE UTILIZED TO DELINEATE OF SELF-ASSERTIVE SIZE TO FIXED-SIZE VALUES

Source - Another student's paper A hash capacity is any capacity that can be utilized to delineate of discretionary size to fixed-size values

Suspected Entry: 93% match

Uploaded - hashvalues.docx THE QUALITIES RETURNED BY A HASH VALUE ARE CALLED HASH ESTEEMS, HASH CODES, CONDENSATIONS, OR BASICALLY HASHES

Source - Another student's paper The qualities returned by a hash capacity are called hash esteems, hash codes, condensations, or basically hashes

Suspected Entry: 70% match

Uploaded - hashvalues.docx THE QUALITIES ARE UTILIZED TO FILE A FIXED- SIZE TABLE CALLED A HASH TABLE

Source - https://en.wikipedia.org/wiki?curid=13790 The values are used to index a fixed-size table called a hash table

Suspected Entry: 63% match

Uploaded - hashvalues.docx THE KEYS MIGHT BE FIXED LENGTH, SIMILAR TO A WHOLE NUMBER, OR VARIABLE LENGTH, SIMILAR TO A NAME

Source - https://en.wikipedia.org/wiki?curid=13790 The keys may be fixed length, like an integer, or variable length, like a name

Suspected Entry: 79% match

Uploaded - hashvalues.docx THE YIELD IS A HASH CODE USED TO FILE A HASH TABLE HOLDING THE INFORMATION OR RECORDS, OR POINTERS TO THEM

Source - https://en.wikipedia.org/wiki?curid=13790 The output is a hash code used to index a hash table holding the data or records, or pointers to them

Suspected Entry: 63% match

Uploaded - hashvalues.docx Source - https://en.wikipedia.org/wiki?curid=13790

10/12/2019 SafeAssign Originality Report

https://ucumberlands.blackboard.com/webapps/mdb-sa-BB5a31b16bb2c48/originalityReportPrint?course_id=_110648_1&paperId=2217001070&&atte… 5/6

A HASH VALUE MIGHT BE CONSIDERED TO PERFORM THREE VALUES

A hash function may be considered to perform three functions

Suspected Entry: 72% match

Uploaded - hashvalues.docx CONVERT VARIABLE LENGTH KEYS INTO FIXED LENGTH (MORE OFTEN THAN NOT MACHINE WORD LENGTH OR LESS) VALUES, BY COLLAPSING THEM BY WORDS OR DIFFERENT UNITS UTILIZING AN EQUALITY PROTECTING AN ADMINISTRATOR LIKE ADD OR XOR

Source - https://en.wikipedia.org/wiki?curid=13790 Convert variable length keys into fixed length (usually machine word length or less) values, by folding them by words or other units using a parity-preserving operator like ADD or XOR

Suspected Entry: 64% match

Uploaded - hashvalues.docx HASH VALUES CAN BE INTENDED TO GIVE THE MOST PESSIMISTIC SCENARIO PERFORMANCE, GOOD EXECUTION UNDER HIGH TABLE STACKING FACTORS, AND IN UNCOMMON CASES, IMPECCABLE MAPPING OF KEYS INTO HASH CODES

Source - https://en.wikipedia.org/wiki?curid=13790 Hash functions can be designed to give best worst- case performance,[Notes 1]good performance under high table loading factors, and in special cases, perfect (collisionless) mapping of keys into hash codes

Suspected Entry: 72% match

Uploaded - hashvalues.docx REFERENCES CASTRO, ET.AL., 2005, "THE SEVERE TORRENTIAL SLIDE MODEL IRREGULARITY TEST", MATHEMATICS AND COMPUTERS IN SIMULATION 68 (2005) 1–7, ELSEVIER, KNUTH, D

Source - https://en.wikipedia.org/wiki?curid=13790 ^ Castro, et.al., 2005, "The strict avalanche criterion randomness test", Mathematics and Computers in Simulation 68 (2005) 1–7,Elsevier,

Suspected Entry: 100% match

Uploaded - hashvalues.docx 1973, THE ART OF COMPUTER SCIENCE, VOL

Source - https://en.wikipedia.org/wiki?curid=13790 1973, The Art of Computer Science, Vol

Suspected Entry: 100% match

Uploaded - hashvalues.docx Source - https://en.wikipedia.org/wiki?curid=13790

10/12/2019 SafeAssign Originality Report

https://ucumberlands.blackboard.com/webapps/mdb-sa-BB5a31b16bb2c48/originalityReportPrint?course_id=_110648_1&paperId=2217001070&&atte… 6/6

3, SORTING AND SEARCHING, P.527 3, Sorting and Searching, p.527

Suspected Entry: 77% match

Uploaded - hashvalues.docx ADDISON-WESLEY, READING, MA., UNITED STATES MENEZES, ALFRED J

Source - https://en.wikipedia.org/wiki?curid=13790 Addison-Wesley, Reading, MA., United States

Suspected Entry: 100% match

Uploaded - hashvalues.docx VAN OORSCHOT, PAUL C

Source - https://en.wikipedia.org/wiki?curid=13790 van Oorschot, Paul C

Suspected Entry: 100% match

Uploaded - hashvalues.docx VANSTONE, SCOTT A (1996)

Source - https://en.wikipedia.org/wiki?curid=13790 Vanstone, Scott A (1996)

Suspected Entry: 100% match

Uploaded - hashvalues.docx HANDBOOK OF APPLIED CRYPTOGRAPHY

Source - https://en.wikipedia.org/wiki?curid=13790 Handbook of Applied Cryptography

Suspected Entry: 100% match

Uploaded - hashvalues.docx ISBN 978-0849385230

Source - https://en.wikipedia.org/wiki?curid=13790 ISBN 978-0849385230