<--- Back to Details
First PageDocument Content
Randomness / Hashing / Information theory / Computational complexity theory / Cryptographic hash functions / Randomness extractor / Leftover hash lemma / Random oracle / Random number generation / Cryptography / Applied mathematics / Theoretical computer science
Date: 2005-03-19 16:27:05
Randomness
Hashing
Information theory
Computational complexity theory
Cryptographic hash functions
Randomness extractor
Leftover hash lemma
Random oracle
Random number generation
Cryptography
Applied mathematics
Theoretical computer science

Add to Reading List

Source URL: eprint.iacr.org

Download Document from Source Website

File Size: 423,37 KB

Share Document on Facebook

Similar Documents

Cryptography / Block ciphers / Data Encryption Standard / Finite fields / Feistel cipher / ARIA / Advanced Encryption Standard / Differential cryptanalysis / ICE / Interpolation attack / Stream cipher / XTR

MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity Martin Albrecht1 , Lorenzo Grassi3 , Christian Rechberger2,3 , Arnab Roy2 , and Tyge Tiessen2 1

DocID: 1xUN2 - View Document

Information retrieval / Hashing / Information science / Search algorithms / Locality-sensitive hashing / Hash function / Hash table / Cryptographic hash function / Hash list / MinHash / RabinKarp algorithm

Introduction to Locality-Sensitive Hashing Tyler NeylonFormats: html | pdf | kindle pdf] Locality-sensitive hashing (LSH) is a set of techniques that

DocID: 1xTR9 - View Document

Computing / Software engineering / Computer programming / Object-oriented programming languages / Abstract data types / Object / Java / Iterator / Scala / Abstraction / Java collections framework / Object-oriented programming

Proceedings: Equality and Hashing for (Almost) Free: Generating Implementations from Abstraction Functions

DocID: 1xTdH - View Document