hash-function
51N-hash — est une fonction de hachage cryptographique basée sur le chiffrement de bloc FEAL et proposée par Shoji Miyaguchi et al. en 1990. Elle n est plus considérée comme une fonction cryptographiquement sûre. N Hash produit une empreinte de 128 bits. Le …
52FFT-hash — est une fonction de hachage cryptographique conçue par Claus Peter Schnorr (en) en 1991 et présentée la même année à la conférence Crypto. La fonction produit une empreinte de 128 bits grâce à deux tours. Chacun des stages est une… …
53Fowler Noll Vo hash — Fowler/Noll/Vo is a non cryptographic hash function created by Glenn Fowler, Landon Curt Noll, and Phong Vo.HistoryThe first version of FNV was FNV 0. The problem with FNV 0 was that it used an offset basis (see below) of 0, meaning that wherever …
54Bent function — The 2 ary bent functions with Hamming weight 1 Their nonlinearity is …
55Random function — A random function is a function chosen at random from a finite family of functions. Typically, the family consists of the set of all maps from the domain to the image set. Thus, a random function can be considered to map each input independently… …
56Tabla hash — Una tabla hash o mapa hash es una estructura de datos que asocia llaves o claves con valores. La operación principal que soporta de manera eficiente es la búsqueda: permite el acceso a los elementos (teléfono y dirección, por ejemplo) almacenados …
57Distributed hash table — A distributed hash table (DHT) is a class of a decentralized distributed system that provides a lookup service similar to a hash table; (key, value) pairs are stored in a DHT, and any participating node can efficiently retrieve the value… …
58T-function — In cryptography, a T function is a bijective mapping that updates every bit of the state in a way that can be described as x i = x i + f(x 0, cdots, x {i 1}), or in simple words an update function in which each bit of the state is updated by a… …
59Full Domain Hash — In cryptography, the Full Domain Hash (FDH) is an RSA based signature scheme that follows the hash and sign paradigm. It is provably secure (i.e, is existentially unforgeable under adaptive chosen message attacks) in the random oracle model. FDH… …
60Ultra exponential function — Articleissues OR=January 2008 other=This article uses nonstandard notations, which are confusing and superfluous.In mathematics the ultra exponential function is a special case of the iterated exponential function more commonly known as tetration …
