Essays about: "Hashing"
Showing result 1 - 5 of 28 essays containing the word Hashing.
-
1. Time-based Key for Coverless Audio Steganography: A Proposed Behavioral Method to Increase Capacity
University essay from Blekinge Tekniska Högskola/Institutionen för datavetenskapAbstract : Background. Coverless steganography is a relatively unexplored area of steganography where the message is not embedded into a cover media. Instead the message is derived from one or several properties already existing in the carrier media. This renders steganalysis methods used for traditional steganography useless. READ MORE
-
2. Time evaluation of lookups with Robin Hood Hashing and Linear Probing
University essay from Umeå universitet/Institutionen för datavetenskapAbstract : Hash tables are used to store data in a way that is quickly retrieved from an array using the identifier of the data. When inserting data into a hash table it will sometimes attempt to place the data on a position in the array where there already exists data which means these collisions need to be handled. READ MORE
-
3. Subtree Hashing of Tests in Build Systems : Rust Tricorder
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : Software applications are built by teams of developers that constantly iterate over the codebase. Software projects rely on a build system, which handles the management of dependencies, compilation, testing, and deployment of the software. READ MORE
-
4. GDPR, Blockchain & Personal data - The rights of the individual v. the integrity of Blockchain
University essay from Göteborgs universitet/Juridiska institutionenAbstract : The technology of Blockchain is something new and innovative. It was introduced by a group which goes under the pseudonym Satoshi Nakamoto through the publishing of the paper “Bitcoin: A peer-to-peer electronic cash system”. READ MORE
-
5. A hashing algorithm based on a one-way function in the symmetric group Sn
University essay from Linnéuniversitetet/Institutionen för matematik (MA)Abstract : We have found an operation between permutations in the symmetric group Sn upon which we have experimentally derived results that can be linked to desirable properties in cryptography, mainly in the domain of one-way functions. From it, we have implemented a beta version of an algorithm for a hashing function by exploiting the operation’s low computational cost for speed and its properties for security. READ MORE