Search results
Jump to navigation
Jump to search
Page title matches
- ...An overview of hash function security/[[cryptanalysis]] can be found at [[hash function security summary]]. Basic general information about the [[cryptographic hash function]]s: year, designer, references, etc. ...16 KB (1,865 words) - 21:08, 6 August 2024
Page text matches
- {{Infobox cryptographic hash function | name = Toeplitz Hash ...2 KB (319 words) - 03:43, 6 January 2024
- '''Static hashing''' is a form of [[Hash function|hashing]] where lookups are performed on a finalized dictionary se ...f hashing in which any set of <math>n</math> elements can be stored in a [[hash table]] of equal size and can have lookups done in constant time. It was sp ...3 KB (482 words) - 01:07, 19 November 2023
- {{Infobox cryptographic hash function ...irst3=Vincent|title=Selected Areas in Cryptography |chapter=Breaking a New Hash Function Design Strategy Called SMASH |series=Lecture Notes in Computer Sci ...2 KB (331 words) - 16:47, 22 August 2023
- ...any length and process it to produce output of any length. Mask generation functions are completely deterministic: for any given input and any desired output le ...t octet strings, but such bounds are generally very large. Mask generation functions are deterministic; the octet string output is completely determined by the ...7 KB (996 words) - 21:03, 8 April 2024
- ...it down to a fixed bit-length (either 224, 256, 384 or 512 bits). The hash functions for the different output lengths are called Fugue-224, Fugue-256, Fugue-384 ...t is also claimed to be competitive with the NIST hash function [[SHA hash functions|SHA-256]] in both software and hardware efficiency, achieving up to 36.2 [[ ...3 KB (537 words) - 08:19, 26 January 2025
- ...ll set to 0. Similar to Bloom filter, there must also be ''k'' different [[hash function]]s defined, each of which [[Map (mathematics)|maps]] or hashes som ...dding an element. To ''add'' an element, feed it to each of the ''k'' hash functions to get ''k'' array positions and ''increment'' the counters 1 at all these ...6 KB (883 words) - 13:03, 26 February 2024
- ...ews/2020/stateful-hash-based-signature-schemes-sp-800-208 | title=Stateful Hash-Based Signature Schemes: SP 800-208 | CSRC | date=30 October 2020 }}</ ...st1=Moni |last2=Yung |first2=Moti |date=1989 |title=Universal One-Way Hash Functions and their Cryptographic Applications |url=https://www.wisdom.weizmann.ac.il ...8 KB (1,383 words) - 21:07, 21 February 2025
- ...ing problem provides a better attack on cryptographic primitives such as [[hash function]]s. ...> be finite sets, and <math>f: A \to C</math>, <math>g: B \to C</math> two functions. A pair <math>(x,y) \in A \times B</math> is called a ''claw'' if <math>f(x ...4 KB (581 words) - 08:17, 25 May 2023
- ...description|Programming technique for resolving duplicate hash values in a hash table data structure}} ...a programming technique for resolving [[hash collision|collisions]] in a [[hash table]] [[data structure]].<ref name="inventor">Fredman, M. L., Komlós, J., ...13 KB (1,970 words) - 19:23, 23 December 2024
- {{Short description|Cryptographic hash function}} {{Infobox cryptographic hash function ...11 KB (1,708 words) - 18:39, 7 January 2025
- ...An overview of hash function security/[[cryptanalysis]] can be found at [[hash function security summary]]. Basic general information about the [[cryptographic hash function]]s: year, designer, references, etc. ...16 KB (1,865 words) - 21:08, 6 August 2024
- ...=Illustration of the sponge construction |The sponge construction for hash functions. ''P<sub>i</sub>'' are blocks of the input string, ''Z<sub>i</sub>'' are ha ...or implement many [[cryptographic primitive]]s, including [[cryptographic hash]]es, [[message authentication codes]], [[mask generation function]]s, [[str ...7 KB (988 words) - 02:38, 6 February 2025
- In contrast to static functions, [[Approximate Membership Query Filter|AMQ-filters]] support (probabilistic ===Perfect hash functions=== ...10 KB (1,571 words) - 15:40, 29 July 2024
- ...</code> is returned. To reduce the false positive rate, the number of hash functions and <math>m</math> can be increased. ...table the remainder is stored. Additional three bits for every slot in the hash table are used to resolve soft collisions (same quotient but different rema ...11 KB (1,710 words) - 16:12, 8 October 2024
- {{Short description|Cryptographic hash function}} {{Infobox cryptographic hash function ...13 KB (1,961 words) - 23:56, 19 October 2024
- ...it easy to reuse Ascon in multiple ways (as a cipher, [[cryptographic hash|hash]], or a [[Message authentication code|MAC]]).{{sfn|Dobraunig|Eichlseder|Men * Ascon-Hash cryptographic hash; ...8 KB (1,197 words) - 10:53, 27 November 2024
- ...rver keeps a short-lived secret <math>K_{s}</math> for computing the first hash value that is returned to the client as part of a puzzle message. A puzzle ...r. The puzzle message contains the length of the tour <math>L</math> and a hash value <math>h_0</math>. The server computes <math>h_0</math> using the foll ...10 KB (1,646 words) - 22:41, 18 January 2024
- {{Short description|Family of hash functions}} ...fs between the degree of independence and the efficiency of evaluating the hash function are well studied, and many ''k''-independent families have been pr ...15 KB (2,115 words) - 15:49, 17 October 2024
- {{Short description|Cryptographic hash function}} {{Infobox cryptographic hash function ...14 KB (2,067 words) - 04:37, 24 August 2024
- Assume that we are given a [[hash function]] <math>\mathrm{hash}(x)</math> that maps input <math>x</math> to integers in the range <math>[0 ...ash function is uniformly distributed, then the probability of observing a hash output ending with <math>2^k</math> (a one, followed by <math>k</math> zero ...8 KB (1,164 words) - 07:31, 22 February 2025