Open danielmarschall opened 6 months ago
I found one first source, which is linked in this stack overflow discussion (std6.pdf). See p. 21 and following in the PDF. https://crypto.stackexchange.com/questions/67280/formal-description-of-kdf1-and-kdf2
But: it doesn't specify what to do if the input length is 0. Quote: A key derivation function is a function KDF(x, l) that takes as input an octet string x and an integer l >= 0, and outputs an octet string of length l. The string x is of arbitrary length, although an implementation may define a (very large) maximum length for x and maximum size for l, and fail if these bounds are exceeded.
Further ressearch shows, that the real specification ight be in IEEE P1363, which is a withdrawn standard from IEEE for which the specification is behind a pay wall.
In my app, I noticed a "Range Check Exception" when the user didn't enter a password (which I clearly forgot to check), and therefore the, empty password was tried to be processed through KDF. The reason for the Range Check Exception is that
Data[0]
is accessed, which does not exist ifData
is empty.(This is just an example. Not only KDFx is affected. Other methods are affected too.)
It is dangerous that a method can fail this way, especially because "range check" can be disabled in the compiler settings for performance reasons.
In my opinion we should do the following: Find out (from official sources / reference implementation) what KDF123x/PBKDF/MGF1 is supposed to do if the input is 0 bytes. Is it supposed to fail, or is it supposed to return a key "X"?
(edit: typo. of course I meant "instead of risking")