Xor Filters: Faster and Smaller Than Bloom Filters – Daniel Lemire's blog
In software, you frequently need to check whether some objects is in a set. For example, you might have a list of forbidden Web addresses. As someone enters a new Web address, you may want to check whether it is part of your black list. Or maybe you have a large list of already used passwords and you want to check whether the proposed new password is part of this list of compromised passwords. The
MetroHash: Faster, Better Hash Functions · J. Andrew Rogers
MetroHash: Faster, Better Hash Functions 27 May 2015 MetroHash is a set of state-of-the-art hash functions for non-cryptographic use cases. They are notable for being algorithmically generated in addition to their exceptional performance. Get the source here. The set of published hash functions may expand in the future. Fastest general-purpose algorithms for bulk hashing Fastest general-purpose al
pHash.org: Home of pHash, the open source perceptual hash library
What is a perceptual hash? A perceptual hash is a fingerprint of a multimedia file derived from various features from its content. Unlike cryptographic hash functions which rely on the avalanche effect of small changes in input leading to drastic changes in the output, perceptual hashes are "close" to one another if the features are similar. Relevance of Perceptual Hashing Perceptual hashes must b
hashcat - advanced password recovery
Signing key on PGP keyservers: RSA, 2048-bit. Key ID: 2048R/8A16544F. Fingerprint: A708 3322 9D04 0B41 99CC 0052 3C17 DA8B 8A16 544F Check out our GitHub Repository for the latest development version GPU Driver requirements: AMD GPUs on Linux require "AMDGPU" (21.50 or later) and "ROCm" (5.0 or later) AMD GPUs on Windows require "AMD Adrenalin Edition" (Adrenalin 22.5.1 exactly) Intel CPUs require
Passlib 1.7.1 documentation — Passlib v1.7.1 Documentation
Welcome¶ Passlib is a password hashing library for Python 2 & 3, which provides cross-platform implementations of over 30 password hashing algorithms, as well as a framework for managing existing password hashes. It’s designed to be useful for a wide range of tasks, from verifying a hash found in /etc/shadow, to providing full-strength password hashing for multi-user application. As a quick sample
List of Rainbow Tables
This page lists the rainbow tables we generated and verified to work. Hash cracking with rainbow tables on YouTube: NTLM MD5 SHA1 Rainbow Table Performance Two figures below are based on log files of 380 tests. Each test uses hashes of randomly generated plaintexts. "Hash Cracking Performance" equals to "Key Space of Rainbow Table" divide by "Hash Cracking Time". Rainbow Table Specification Algori
Jean-Philippe Aumasson
Cryptographer, co-founder & chief security officer @ Taurus. Books Serious Cryptography (No Starch Press, 2017) Translations' covers 🚧 Second edition: to appear in 2024 (No Starch Press) 🚧 French translation: to appear in 2024 (Dunod) Petit Pingouin (self-published, 2021) Crypto Dictionary (No Starch Press, 2020) The Hash Function BLAKE (Springer, 2014) Crypto projects Hash functions BLAKE, BLAK
GitHub - zacharyvoase/humanhash: Human-readable digests.
Caveats Don't store the humanhash output, as its statistical uniqueness is only around 1 in 4.3 billion. Its intended use is as a human-readable (and, most importantly, memorable) representation of a longer digest, unique enough for display in a user interface, where a user may need to remember or verbally communicate the identity of a hash, without having to remember a 40-character hexadecimal se
SHA-1 Cryptographic Hash Algorithm implemented in JavaScript | Movable Type Scripts
A cryptographic hash (sometimes called ‘digest’) is a kind of ‘signature’ for a text or a data file. SHA1 generates an almost-unique 160-bit (20-byte) signature for a text. There is a good description on Wikipedia; see below for the source code. Enter any message to check its SHA-1 hash Message abc Hash Note SHA-1 hash of ‘abc’ should be: a9993e364706816aba3e25717850c26c9cd0d89d A hash is not
SHA-256 Cryptographic Hash Algorithm implemented in JavaScript | Movable Type Scripts
A cryptographic hash (sometimes called ‘digest’) is a kind of ‘signature’ for a text or a data file. SHA-256 generates an almost-unique 256-bit (32-byte) signature for a text. See below for the source code. Enter any message to check its SHA-256 hash Message abc Hash Note SHA-256 hash of ‘abc’ should be: ba7816bf8f01cfea414140de5dae2223b00361a396177a9cb410ff61f20015ad A hash is not ‘encrypt
GitHub - google/cityhash: Automatically exported from code.google.com/p/cityhash
CityHash, a family of hash functions for strings. Introduction ============ CityHash provides hash functions for strings. The functions mix the input bits thoroughly but are not suitable for cryptography. See "Hash Quality," below, for details on how CityHash was tested and so on. We provide reference implementations in C++, with a friendly MIT license. CityHash32() returns a 32-bit hash. CityHash
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
MurmurHash3 - smhasher - MurmurHash3 information and brief performance results - Project Hosting on Google Code
http://www.kt.rim.or.jp/~kbk/zakkicho/09/zakkicho0906b.html