ScratchData LogoScratchData
Back to _paperN1's profile

Hashing without the XOR

_P_paperN1•Created July 8, 2017
Hashing without the XOR
6
6
192 views
View on Scratch

Instructions

Press space to enter an input. This project demonstrates a hash algorithm that does not use the XOR, AND, or the OR Boolean operators, but instead uses two special functions: the block swap and the cube function. The block swap partitions any number string roughly into blocks with lengths of powers of two, and reverses the orders of the chunks, but not the individual digits themselves. The cube function takes a binary string, breaks into a number of parts so that each part has roughly the same amount of 0 digits, cubes each number as if they were decimal numbers, converts back to binary, and then takes out the middle desired digits to form an output binary string of the same length. See inside in the backdrop costumes for more information.

Description

Thanks to http://www.metamorphosite.com/one-way-hash-encryption-sha1-data-software for showing the entire algorithm of the SHA-1 hash algorithm in full detail, and inspiration for this algorithm here.

Project Details

Project ID168338627
CreatedJuly 8, 2017
Last ModifiedAugust 7, 2017
SharedJuly 10, 2017
Visibilityvisible
CommentsAllowed