Revision as of 13:08, 26 November 2019 edit Frap (talk \| contribs) Extended confirmed users, File movers, Pending changes reviewers, Rollbackers 35,592 edits →Example code ← Previous edit		Revision as of 18:49, 2 December 2019 edit undo 2620:15c:201:2:6881:dea7:f153:4de6 (talk) →Applications: Remove section on Salsa20 which is just mistaken. Salsa20 is a PRF, secure if the key is unknown. An MGF has to have good properties even when the key is known. Tag: section blanking Next edit →
Line 16: Mask generation functions were first proposed as part of the specification for padding in the [[Optimal_asymmetric_encryption_padding\|RSA-OAEP]] algorithm. The OAEP algorithm required a cryptographic hash function that could generate an output equal in size to a "data block" whose length was proportional to arbitrarily sized input message.<ref name="rsa"/> ~~=== Keyed encryption ===~~ The [[Salsa20]] stream cipher may be viewed as a mask generation function as its [[keystream]] is produced by hashing the key and nonce with a counter, to yield an arbitrarily long output.<ref>{{cite web \|url=https://cr.yp.to/snuffle/salsafamily-20071225.pdf \| title=The Salsa20 family of stream ciphers \|author=Daniel J. Bernstein}}</ref> ~~<blockquote>~~ Salsa20 generates the stream in 64-byte (512-bit) blocks. Each block is an independent hash of the key, the nonce, and a 64-bit block number; there is no chaining from one block to the next. The Salsa20 output stream can therefore be accessed randomly, and any number of blocks can be computed in parallel. ~~</blockquote>~~ === Random number generators ===

Mask generation function: Difference between revisions