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

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

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish
Title of host publicationIEEE Region 10 International Conference on Electrical and Electronic Technology
EditorsD. Tien, Y.C. Liang, D. Tien, Y.C. Liang
Pages366-369
Number of pages4
Publication statusPublished - 2001
EventIEEE Region 10 International Conference on Electrical and Electronic Technology - Singapore, Singapore
Duration: Aug 19 2001Aug 22 2001

Other

OtherIEEE Region 10 International Conference on Electrical and Electronic Technology
CountrySingapore
CitySingapore
Period8/19/018/22/01

Fingerprint

Feedback
Program processors
Data storage equipment
Testing

Keywords

  • Feedback connections
  • LFSR
  • M-sequence
  • Primitive polynomial

ASJC Scopus subject areas

  • Engineering(all)

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 proceedingConference 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.
Ahmad A, Al-Busaidi S, Al-Mushrafi MJ. New algorithmic procedure to test m-sequence generating feedback connections of stream Cipher's LFSRs. In Tien D, Liang YC, Tien D, Liang YC, editors, IEEE Region 10 International Conference on Electrical and Electronic Technology. 2001. p. 366-369
Ahmad, A. ; Al-Busaidi, S. ; Al-Mushrafi, M. J. / New algorithmic procedure to test m-sequence generating feedback connections of stream Cipher's LFSRs. IEEE Region 10 International Conference on Electrical and Electronic Technology. editor / D. Tien ; Y.C. Liang ; D. Tien ; Y.C. Liang. 2001. pp. 366-369
@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",

}

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

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.

ER -