• Robert Relyea's avatar
    Bug 1651411 New tlsfuzzer code can still detect timing issues in RSA operations. · 3a48c7de
    Robert Relyea authored
    This patch defeats Bleichenbacher by not trying to hide the size of the
    decrypted text, but to hide if the text succeeded for failed. This is done
    by generating a fake returned text that's based on the key and the cipher text,
    so the fake data is always the same for the same key and cipher text. Both the
    length and the plain text are generated with a prf.
    
    Here's the proposed spec the patch codes to:
    
        1. Use SHA-256 to hash the private exponent encoded as a big-endian integer to a string the same length as the public modulus. Keep this value secret. (this is just an optimisation so that the implementation doesn't have to serialise the key over and over again)
        2. Check the length of input according to step one of https://tools.ietf.org/html/rfc8017#section-7.2.2
        3. When provided with a ciphertext, use SHA-256 HMAC(key=hash_from_step1, text=ciphertext) to generate the key derivation key
        4. Use SHA-256 HMAC with key derivation key as the key and a two-byte big-endian iterator concatenated with byte string "length" with the big-endian representation of 2048 (0x0800) as the bit length of the generated string.
          - Iterate this PRF 8 times to generate a 256 byte string
        5. initialise the length of synthetic message to 0
        6. split the PRF output into 2 byte strings, convert into big-endian integers, zero-out high-order bits so that they have the same bit length as the octet length of the maximum acceptable message size (k-11), select the last integer that is no larger than (k-11) or remain at 0 if no integer is smaller than (k-11); this selection needs to be performed using a side-channel free operators
        7. Use SHA-256 HMAC with key derivation key as the key and a two-byte big-endian iterator concatenated with byte string "message" with the big-endian representation of k*8
          - use this PRF to generate k bytes of output (right-truncate last HMAC call if the number of generated bytes is not a multiple of SHA-256 output size)
        8. perform the RSA decryption as described in step 2 of section 7.2.2 of rfc8017
        9. Verify the EM message padding as described in step 3 of section 7.2.2 of rfc8017, but instead of outputting "decryption error", return the last l bytes of the "message" PRF, when l is the selected synthetic message length using the "length" PRF, make this decision and copy using side-channel free operation
    
    Differential Revision: https://phabricator.services.mozilla.com/D99843
    3a48c7de
manifest.mn 1.14 KB