Mask generation function: Difference between revisions

Revision as of 15:11, 18 February 2017

Revision as of 18:29, 18 February 2017

Line 15:

of a mask generation function should be pseudorandom, that is, if the

seed to the function is unknown, it should be infeasible to

distinguish the output from a truly random string."<ref name="rsa">{{cite web |url=https://www.ietf.org/rfc/rfc2437.txt |title=RFC 2437 PKCS #1 |author=RSA Laboratories}}</ref>

== Applications ==

Line 23:

=== Padding Schemes ===

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>{{cite web |urlname=https://www.ietf.org/rfc/rfc2437.txt |title=RFC 2437 PKCS #1 |author=RSA Laboratories}}<"rsa"/ref>

=== Keyed Encryption ===

Line 46:

=== MGF1 ===

MGF1 is a Mask Generation Function defined in the Public Key Cryptography Standard #1 published by RSA Labroatories.<ref>{{cite web |urlname=https://www.ietf.org/rfc/rfc2437.txt |title=RFC 2437 PKCS #1 |author=RSA Laboratories}}<"rsa"/ref> The algorithm is described as follows:

<pre>