Changes between Version 14 and Version 15 of HadoopA51


Ignore:
Timestamp:
Jan 19, 2010, 3:38:20 PM (14 years ago)
Author:
lgrijincu
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • HadoopA51

    v14 v15  
    4949[[Image(rainbow.svg)]]
    5050
    51 As it can be seen from the above image, the chain generation selects a set of random input values, applyes H (the crypto function, in our case A5/1) and then Ri. For each input secret value we only store the START and END secrets from the chain. Theoretically, chains can have any length we want (from 1-2 series of H and Ri applications to 2^15 - 2^20 applications). Practically smaller chains will lead to a need of bigger tables, while larger chains will increase the lookup time.
     51As it can be seen from the above image, the chain generation selects a set of random input values, applyes H (the crypto function, in our case A5/1) and then Ri. For each input secret value we only store the START and END secrets from the chain. Theoretically, chains can have any length we want (from 1-2 series of H and Ri applications to 2^15^-2^20^ applications). Practically smaller chains will lead to a need of bigger tables, while larger chains will increase the lookup time.
    5252
    5353=== Table lookup ===