Search results

{{wiktionary|hash}} '''Hash''', '''hashes''', '''hash mark''', or '''hashing''' may refer to: ...

{{short description|Fast 8-bit hash function}} '''Pearson hashing''' is a [[non-cryptographic hash function]] designed for fast execution on processors with 8-bit [[processor ...

* [[Fast syndrome-based hash]], cryptographic hash functions ...

{{Short description|Cryptographic hash function}} {{Infobox cryptographic hash function ...

{{Short description|Hash function phenomenon}} ...254px|John Smith and Sandra Dee share the same hash value of 02, causing a hash collision.]] ...

* [[RIPEMD]], a family of cryptographic hash functions ...

...gainst dictionary attacks. While other hashing functions, such as [[Secure Hash Algorithms|SHA]] and [[MD5]], are much faster and less expensive to compute ...age requirements at the cost of slightly longer lookup-times. ''See'' [[LM hash]] for an example of an [[Authentication protocol|authentication system]] co ...

...care/ |url-status=live }}</ref> This is especially true of [[cryptographic hash function]]s, which may be used to detect many data corruption errors and ve ...d as [[cryptographic primitive]]s in larger authentication algorithms. For cryptographic systems with these two specific design goals{{Clarify|reason=What two speci ...

...data integrity]] and authenticity of a message. An HMAC is a type of keyed hash function that can also be used in a key derivation scheme or a key stretchi ...he cryptographic strength of the underlying hash function, the size of its hash output, and the size and quality of the key.<ref name="BCK96" /> ...

The '''Yarrow algorithm''' is a family of [[cryptographic pseudorandom number generator]]s (CSPRNG) devised by [[John Kelsey (cryptan ...graphy |chapter=Yarrow-160: Notes on the Design and Analysis of the Yarrow Cryptographic Pseudorandom Number Generator |series=Lecture Notes in Computer Science |da ...

...ted [[public-key cryptography]] and invented [[cryptographic hash function|cryptographic hashing]], and has worked on [[molecular nanotechnology]] and [[cryonics]]. ...ed the [[Merkle–Damgård construction]], which underlies many cryptographic hash algorithms, and [[Merkle tree]]s, which are widely used in distributed syst ...

...odulus length <math>N</math>, only the leftmost <math>N</math> bits of the hash output are used. ...ving <math>k</math> deterministically from the private key and the message hash, as described by {{IETF RFC|6979}}. This ensures that <math>k</math> is dif ...

{{Short description|Protocol for agreeing on a cryptographic key}} ...reement protocol''' is a protocol whereby two (or more) parties generate a cryptographic [[Key (cryptography)|key]] as a function of information provided by each ho ...

* Cryptographic Hardware and Embedded Systems (CHES) ...now the Annual International Conference on the Theory and Applications of Cryptographic Techniques. Eurocrypt is one of the IACR flagship conferences, along with C ...

...[[algorithm]]s for [[cryptography]] that use the same [[Key (cryptography)|cryptographic keys]] for both the encryption of [[plaintext]] and the decryption of [[cip == Use as a cryptographic primitive == ...

...property of the hash function to break the protocol; they cannot treat the hash function as a black box (i.e., as a random oracle). ...sic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions |date=1965-04-01 |publisher=Raven Press |isbn=978-0-911216-01-1 |editor-las ...

...cipher|block ciphers]], but also to stream ciphers and cryptographic hash functions. In the broadest sense, it is the study of how differences in information i ..., who published a number of attacks against various block ciphers and hash functions, including a theoretical weakness in the [[Data Encryption Standard]] (DES) ...

...e. For [[cryptography]], this is very bad: we want typical instances of a cryptographic problem to be hard. Here methods like [[random self-reducibility]] can be ...ke [[hash table]]s have very poor worst-case behaviors, but a well written hash table of sufficient size will statistically never give the worst case; the ...

{{short description|Cryptographic hash function}} ...s|first1=Marc|author-link1=Marc Stevens (cryptology)|title=Attacks on Hash Functions and Applications|url=https://marc-stevens.nl/research/papers/PhD%20Thesis%2 ...

{{Infobox cryptographic hash function ...value. MD5 was designed by [[Ronald Rivest]] in 1991 to replace an earlier hash function [[MD4]],<ref name="Ron Barak">{{cite book|last=Ciampa|first=Mark|t ...