Fast and dependency-free cryptographic hashing library for node.js and browsers (supports MD5, SHA1, SHA256, SHA512, RIPEMD, HMAC)
-
Updated
May 30, 2022 - JavaScript
Fast and dependency-free cryptographic hashing library for node.js and browsers (supports MD5, SHA1, SHA256, SHA512, RIPEMD, HMAC)
🐤 floppsy - SMHasher-passing 200Mb/s hash using floating-point ops
Block chain project in node.js. This is a simple clone of Bitcoin network in with some new features.
An optimized JavaScript implementation of the MurmurHash3 algorithm.
🤹 HRW / Rendezvous hashing in JS
An elegant pairing function which uniquely encodes two natural numbers into a single natural number
🔨 A deep study about algorithms and data structures with help of Javascript
Quickly generate key pair hex/hash values via a simple NodeJS command line tool.
Plugin to replace webpack's default chunkhash hashes by SHA hashes
Cipher Encryption/Decryption This project is a simple implementation of the cipher encryption and decryption algorithm using JavaScript, HTML, and CSS. The cipher is a substitution cipher that replaces each letter in the plaintext with a letter a certain number of positions down the alphabet.
A JS CRC32 and CRC16 checksum implementation that matches C and PHP
LMS is a full-featured, multipurpose, premium Learning Management System built with react js, HTML5, and CSS. It has a huge collection of reusable UI components and is integrated with the latest CSS libraries. It can be used for all types of Web applications like custom admin panel, app backend, CMS or CRM.
whirlpool 512 bit hash in javascript for electron and the browser
This is the project of the WEBTECH course.
Content server with file upload, automatic hashing and hash based naming scheme.
TypeScript implementation of MurmurHash3 32-bit for fast, high-performance hashing with a good balance of speed and quality.
In this merkle tree file, we put the remix addresses for solidity projects.
To learn About Authentication levels
The idea of the program is similar to double hashing techniques but little different .In double hashing the function is using two hashes at the same time which makes a problem too complex .the function i am using is f(i) = i1 +i2+.... which is working in the fixed data size and easier to understand.
Add a description, image, and links to the hashing-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the hashing-algorithm topic, visit your repo's landing page and select "manage topics."