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

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

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 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

Publication series

NameIEEE Region 10 International Conference on Electrical and Electronic Technology

Other

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

Keywords

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

ASJC Scopus subject areas

  • General Engineering

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