Investigation of some quite interesting divisibility situations in a signature analyzer implementation

Authors:
Afaq Ahmad
Affiliations:
Department of Electrical and Computer Engineering, College of Engineering, Sultan Qaboos University, Oman
Venue:
WSEAS Transactions on Circuits and Systems
Year:
2011

Citing 9
Cited 0

Shift Register Sequences

Shift Register Sequences
Are Primitive Polynomials Always Best in Signature Analysis?

IEEE Design & Test
Development of a Strong Stream Ciphering Technique Using Non-Linear Fuzzy Logic Selector

PWC '02 Proceedings of the IFIP TC6/WG6.8 Working Conference on Personal Wireless Communications
Design and study of a strong crypto-system model for e-Commerce

ICCC '02 Proceedings of the 15th international conference on Computer communication
Digital Signatures: A Tutorial Survey

Computer
Applying the RSA Digital Signature to Electronic Mail

Computer
Investigating some special sequence lengths generated in an external exclusive-NOR type LFSR

Computers and Electrical Engineering
Built-In Self-Test Techniques

IEEE Design & Test
Selection of polynomials for cyclic redundancy check for the use of high speed embedded: an algorithmic procedure

WSEAS Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

When designing error detecting and correcting systems, cryptographic apparatus, scramblers and other secure, safe and authenticated communication and digital system response data compression devices, the division of polynomials are frequently involved. Commonly, the process of division is implemented by using hardware known as Linear Feedback Shift Registers (LFSRs). In digital system testing the technique of Built-In Self Test (BIST) uses this LFSR based division process for response data compression and is popularly known as Signature Analyzer (SA). This paper presents a simulation experiment on the effectiveness study of the SA schemes. The finding of the results of the simulation study reveals that in SA implementation; in general the uses of primitive characteristic polynomials are the best. However, the study further investigates that the use of some critical primitive characteristic polynomials may reverse the effectiveness of the SA schemes i.e. lead to observe maximum aliasing errors.