New algorithmic procedure to test m-sequence generating feedback connections of stream Cipher's LFSRs

A. Ahmad; S. Al-Busaidi; M. J. Al-Mushrafi

New algorithmic procedure to test m-sequence generating feedback connections of stream Cipher's LFSRs

A. Ahmad, S. Al-Busaidi, M. J. Al-Mushrafi

Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

7 Citations (Scopus)

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.

Original language	English
Title of host publication	IEEE Region 10 International Conference on Electrical and Electronic Technology
Editors	D. Tien, Y.C. Liang, D. Tien, Y.C. Liang
Pages	366-369
Number of pages	4
Publication status	Published - 2001
Event	IEEE Region 10 International Conference on Electrical and Electronic Technology - Singapore, Singapore Duration: Aug 19 2001 → Aug 22 2001

Other

Other	IEEE Region 10 International Conference on Electrical and Electronic Technology
Country	Singapore
City	Singapore
Period	8/19/01 → 8/22/01

Keywords

Feedback connections
LFSR
M-sequence
Primitive polynomial

ASJC Scopus subject areas

Engineering(all)

Access to Document

Fingerprint Dive into the research topics of 'New algorithmic procedure to test m-sequence generating feedback connections of stream Cipher's LFSRs'. Together they form a unique fingerprint.

Cite this

Ahmad, A., Al-Busaidi, S., & Al-Mushrafi, M. J. (2001). New algorithmic procedure to test m-sequence generating feedback connections of stream Cipher's LFSRs. In D. Tien, Y. C. Liang, D. Tien, & Y. C. Liang (Eds.), IEEE Region 10 International Conference on Electrical and Electronic Technology (pp. 366-369)

New algorithmic procedure to test m-sequence generating feedback connections of stream Cipher's LFSRs. / Ahmad, A.; Al-Busaidi, S.; Al-Mushrafi, M. J.

IEEE Region 10 International Conference on Electrical and Electronic Technology. ed. / D. Tien; Y.C. Liang; D. Tien; Y.C. Liang. 2001. p. 366-369.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Ahmad, A, Al-Busaidi, S & Al-Mushrafi, MJ 2001, New algorithmic procedure to test m-sequence generating feedback connections of stream Cipher's LFSRs. in D Tien, YC Liang, D Tien & YC Liang (eds), IEEE Region 10 International Conference on Electrical and Electronic Technology. pp. 366-369, IEEE Region 10 International Conference on Electrical and Electronic Technology, Singapore, Singapore, 8/19/01.

@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",

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",

}

TY - GEN

T1 - New algorithmic procedure to test m-sequence generating feedback connections of stream Cipher's LFSRs

AU - Ahmad, A.

AU - Al-Busaidi, S.

AU - Al-Mushrafi, M. J.

PY - 2001

Y1 - 2001

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

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

KW - Feedback connections

KW - LFSR

KW - M-sequence

KW - Primitive polynomial

UR - http://www.scopus.com/inward/record.url?scp=0035785506&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035785506&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0035785506

SN - 0780371011

SP - 366

EP - 369

BT - IEEE Region 10 International Conference on Electrical and Electronic Technology

A2 - Tien, D.

A2 - Liang, Y.C.

A2 - Tien, D.

A2 - Liang, Y.C.

T2 - IEEE Region 10 International Conference on Electrical and Electronic Technology

Y2 - 19 August 2001 through 22 August 2001

ER -