HomeSort by relevance Sort by last modified time
    Searched refs:RSA_LEN (Results 1 - 2 of 2) sorted by null

  /device/google/contexthub/lib/include/nanohub/
rsa.h 22 #define RSA_LEN 2048
23 #define RSA_LIMBS ((RSA_LEN + 31)/ 32)
38 //calculate a ^ 65537 mod c, where a and c are each exactly RSA_LEN bits long, result is only valid as long as state is. state needs no init, set state to 0 at start, call till it is zero on return
42 //calculate a ^ b mod c, where a and c are each exactly RSA_LEN bits long, result is only valid as long as state is. state needs no init
  /device/google/contexthub/lib/nanohub/
rsa.c 24 //num %= denum where num is RSA_LEN * 2 and denum is RSA_LEN and tmp is RSA_LEN + limb_sz
25 //will need to be called till it returns true (up to RSA_LEN * 2 + 2 times)
142 * we break up each mul and mod itself into more steps. mul needs RSA_LIMBS steps, and mod needs up to RSA_LEN * 2 + 2 steps
143 * so if we allocate RSA_LEN * 3 step values to mod, each mul-mod pair will use <= RSA_LEN * 4 step values
144 * and the whole opetaion will need <= RSA_LEN * 4 * 34 step values, which fits into a uint32. cool. In fact
146 * output stepP is zero. We'll call each of the RSA_LEN * 4 pieces a gigastep, and have 17 of them as seen above. Each
180 gigastep = (step - 1) / (RSA_LEN * 4)
    [all...]

Completed in 876 milliseconds