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. |

| 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. |