The practical application of the Requirement 9 for the search for M-NLFSR is influenced by a number of factors due to which its use at large values of L is inefficient. The main factors are: 1. Large amount of memory for the patterns being tested. With each additional value of the period T being tested, both the number of sequences to be tested and the number of patterns for each sequence increase. Moreover, the amount of patterns for each sequence and the number of sequences increases with increasing L according to the power law. Even at L ≥ 20, the memory allocated for pattern testing reaches several GB, which is unacceptable when using personal computers. 2. At T ≥ 20, the time spent checking all the patterns being tested is many times greater than the time spent checking the generated sequence itself. Moreover, the testing time is proportional to the number of tested patterns, and, as noted above, the number of patterns increases with increasing L according to the power law. Consider the modification of the algorithm for checking the NLFSR for compliance with Requirement 9, devoid of these shortcomings, as well as sharing with other previously mentioned Requirements.
Method of Synthesis M-NLFSR. Hardware and Software Search M-NLFSR Second Order. List M-NLFSR
Kuznetsov
;
2022-01-01
Abstract
The practical application of the Requirement 9 for the search for M-NLFSR is influenced by a number of factors due to which its use at large values of L is inefficient. The main factors are: 1. Large amount of memory for the patterns being tested. With each additional value of the period T being tested, both the number of sequences to be tested and the number of patterns for each sequence increase. Moreover, the amount of patterns for each sequence and the number of sequences increases with increasing L according to the power law. Even at L ≥ 20, the memory allocated for pattern testing reaches several GB, which is unacceptable when using personal computers. 2. At T ≥ 20, the time spent checking all the patterns being tested is many times greater than the time spent checking the generated sequence itself. Moreover, the testing time is proportional to the number of tested patterns, and, as noted above, the number of patterns increases with increasing L according to the power law. Consider the modification of the algorithm for checking the NLFSR for compliance with Requirement 9, devoid of these shortcomings, as well as sharing with other previously mentioned Requirements.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
