Here is the synopsis of our sample research paper on Computer Hashing. Have the paper e-mailed to you 24/7/365.
Essay / Research Paper Abstract
A 5 page paper discussing this programming and functional technique that has existed for many years, dating at least from the 1980s and before. In the early days, it provided an alternative to the sort function within database applications. Today, it still functions similarly but rather than becoming anachronistic among programmers, it has gained renewed life in security application. One of the most common uses for hashing today is in conjunction with the use of electronic signatures. Bibliography lists 8 sources.
Page Count:
5 pages (~225 words per page)
File: CC6_KSitHashing.rtf
Buy This Term Paper »
Unformatted sample text from the term paper:
functional technique that has existed for many years, dating at least from the 1980s and before. In the early days, it provided an alternative to the sort function within
database applications. Today, it still functions similarly but rather than becoming anachronistic among programmers, it has gained renewed life in security application. One of the most common uses
for hashing today is in conjunction with the use of electronic signatures. Hasings continued relevance to todays technological environment is evidenced by the
fact that Federal Information Processing Standards (FIPS) recently released four updated algorithms for hashing use. Glossary of Terms and Acronyms "Bit. A
binary digit having a value of 0 or 1. "Byte. A group of eight bits.
"FIPS. Federal Information Processing Standard. "Word. A group of either 32 bits (4 bytes) or 64 bits (8 bytes), depending on
the secure hash algorithm" (Secure Hash Standard, 2002). Hex digit. Representation of a 4-bit string.
Integer. Represented as a word or pair of words. Early Use As stated above, hashing in its early days was used primarily
in database applications. In 1994, Graefe, Linville and Shapiro described hashing as consisting of efficient "algorithms for processing large volumes of data are very important both for relational and
new object-oriented database systems. Many query-processing operations can be implemented using sort- or hash-based algorithms, e.g., intersection, join, and duplicate elimination" (p. 934). Only sort-based algorithms were used in
...