• Stefan Berger's avatar
    crypto: ecdsa - Extend res.x mod n calculation for NIST P521 · 48e8d3a5
    Stefan Berger authored
    res.x has been calculated by ecc_point_mult_shamir, which uses
    'mod curve_prime' on res.x and therefore p > res.x with 'p' being the
    curve_prime. Further, it is true that for the NIST curves p > n with 'n'
    being the 'curve_order' and therefore the following may be true as well:
    p > res.x >= n.
    
    If res.x >= n then res.x mod n can be calculated by iteratively sub-
    tracting n from res.x until res.x < n. For NIST P192/256/384 this can be
    done in a single subtraction. This can also be done in a single
    subtraction for NIST P521.
    
    The mathematical reason why a single subtraction is sufficient is due to
    the values of 'p' and 'n' of the NIST curves where the following holds
    true:
    
       note: max(res.x) = p - 1
    
       max(res.x) - n < n
           p - 1  - n < n
           p - 1      < 2n  => holds true for the NIST curves
    Tested-by: default avatarLukas Wunner <lukas@wunner.de>
    Reviewed-by: default avatarJarkko Sakkinen <jarkko@kernel.org>
    Signed-off-by: default avatarStefan Berger <stefanb@linux.ibm.com>
    Signed-off-by: default avatarHerbert Xu <herbert@gondor.apana.org.au>
    48e8d3a5
ecdsa.c 9.32 KB