@inproceedings{c83c8318687b4396ad489f9eb32e3fea,
title = "New algorithmic procedure to test m-sequence generating feedback connections of stream Cipher's LFSRs",
abstract = "This paper presents a new algorithmic procedure for testing the feedback connections of an LFSR to check whether the design may generate maximal length sequences (m-sequence) or not. Since for an n-bit LFSR the algorithm only requires an (n-1) - bit register operation through out its entire implementation thus, it requires minimal CPU time as well as memory space. Therefore, the attribute of the developed algorithm is two folded. The first, it is the fastest available algorithm and secondly, it is not posing the restriction on the length of the LFSRs like other existing methods. The simulation result of the algorithm is compared with the results of existing algorithms and found much faster than the other existing algorithms. The implementation procedure of the algorithm is demonstrated through an elaborative example.",
keywords = "Feedback connections, LFSR, M-sequence, Primitive polynomial",
author = "A. Ahmad and S. Al-Busaidi and Al-Mushrafi, {M. J.}",
year = "2001",
language = "English",
isbn = "0780371011",
series = "IEEE Region 10 International Conference on Electrical and Electronic Technology",
pages = "366--369",
editor = "D. Tien and Y.C. Liang and D. Tien and Y.C. Liang",
booktitle = "IEEE Region 10 International Conference on Electrical and Electronic Technology",
note = "IEEE Region 10 International Conference on Electrical and Electronic Technology ; Conference date: 19-08-2001 Through 22-08-2001",
}