Bounds and analysis of aliasing errors in linear feedback shift registers

Williams, T.W.; Daehn, Wilfried; Gruetzner, M.; Starke, C.W.

doi:10.1109/43.3132

Cited by 107 publications

(23 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Linear Feedback Shift Register (LFSR) is one of the commonly used in stream cipher technologies, whose feedback function is a simple XOR of certain bits in the register [10]. An n-bit LFSR can generate 2^n-1 bit long pseudo-random sequence before repeating.…”

Section: A Algorithm Descriptionmentioning

confidence: 99%

A noniterative reconstruction algorithm for LFSR PRNG

Wang

et al. 2012

Proceedings of 2012 2nd International Conference on Computer Science and Network Technology

View full text Add to dashboard Cite

Pseudo Random Number Generator (PRNG) is widely used in computer software design. The famous Domain Name System (DNS) software--BIND uses Linear Feedback Shift Register (LFSR) based PRNG algorithm to produce randomness of its transaction IDs. In recent years, DNS cache poisoning attack occurs frequently, which exploits BIND PRNG weakness, aiming at forging BIND with fake responses. In this paper, we present detailed analysis of the LFSR PRNG algorithm of BIND 9.2.4, which shows that its PRNG can be reconstructed. An effective noniterative reconstruction algorithm is proposed to fully reconstruct the internal states of the LFSRS. The algorithm is independent of the initial state of LFSR and of specific hardware platform. The experiment shows that our algorithm is more efficient than existing algorithm.

show abstract

Section: A Algorithm Descriptionmentioning

confidence: 99%

A noniterative reconstruction algorithm for LFSR PRNG

Wang

et al. 2012

Proceedings of 2012 2nd International Conference on Computer Science and Network Technology

View full text Add to dashboard Cite

show abstract

“…however, many approaches have been suggested to analyze and improve the basic signature analysis schemes. The use of primitive polynomials in SA with some restrictions 7,15,17,[20][21][22] along with obtaining multiple signatures with the use of different feedback connections in LFSRs of PRTSG as well as of SA 1,[3][4][5]18,19 can prove a better solution for minimizing the fault-masks.…”

Section: Introductionmentioning

confidence: 99%

“…however, these schemes usually give a number that is only an estimate and sometimes too large. To overcome these problems, a 'divide-and-conquer' approach for testing of large sizes of circuits has been proposed [7][8][9][10][11][12][13][14][15] . The philosophy behind the divide-and-conquer approach of testing is to apply either the exhaustive test-stimuli or maximal length PRTSs to the different segmented units of the Digital Circuit Under Test (DCUT).…”

Section: Introductionmentioning

confidence: 99%

What Causes to Tune a Condition of Exactly Identical Fault-Masks Behaviors in an LFSR based BIST Methodology

Ahmad

Al‐Abri

Busaidi

et al. 2017

Orient. J. Comp. Sci. and Technol

View full text Add to dashboard Cite

The authors show that in a Built-In Self-Test (BIST) technique, based on linear-feedback shift registers, when the feedback connections in pseudo-random test-sequence generator and signature analyzer are images of each other and corresponds to primitive characteristic polynomial then behaviors of faults masking remains identical. The simulation results of single stuck-at faults show how the use of such feedback connections in pseudo-random test-sequence generator and signature analyzer yields to mask the same faults.

show abstract

“…It can also be thought as a model of the "expected behavior" of the CUT, over all possible t,est, sequences. Wit,li such a model, single-output faiilt8y circuit,s can be cl~aract~er-ized by a single proba.bility p of an error occurring at the primary output [2,5]. The occurreiice of aliasing errors is measurecl by the aliasing error probabi1it.y (.4EP), a fuiictioii of the test length, the input error probability p , and the feedback polynomial of the register.…”

Section: Circuitsmentioning

confidence: 99%

“…A second criterion, proposed first, by Williams et al [2], consists of looking a t the eigeiivalues of the hlarkov chain that describes the probabilistic behavior of the register. The rationale behind this criterion is as follows.…”

Section: Circuitsmentioning

confidence: 99%

Aliasing minimization in signature analysis testing

Olivo

Damiani

Riccò

Proceedings ETC 93 Third European Test Conference

View full text Add to dashboard Cite

the problem of compacting tlie output data of large Th,is paper reconsiders the problem of the design of optimal Signature Registers f o r BIST applications, at the light of recent results. Daflerent strategies should in padicular be considered in. designing multiple-input an.d single-input registers. For multiple-input registers, aliasing minimization cannot be the only guiding criterion: it is iii fact shown that the perfonnan.ce of a register with regards t o a1iasiii.g depen.ds strongly on. the nature of the circuit under test and on ihe effects of the fault at its outputs. It is therefore preferable to choose a register that performs satisfactorily regardless of th.e circuid tested and of the tesi length chosen, i.e. a maximally reliable register. Registers based o n primitive feedback polynomials are idenhfied in this paper as the most reliable, in t e r m s of asyntptotic as well as transient behavior of the aliasing probability. T h e specific case of single-input shift-registers can be dealt with differently, as all single-oulput circirils are bound to provide esseiifinlly f h e same type of error distribution. I n ihis case registers can be found that can outperfonti prinailiae p o l y , o m inls. Regislers based o n Fire codes [with feedback polynoniinls of type (zo + l)&(z)) represen,l one such. class.Eventually, the impact of the testability of a circuit on aliasing is investigated. Better testability results in a more predictable behavior of aliasing, so that in practice the well-known asymptotic va/,ue 2 -k represents a n excellent approxim nt ion of th,e alias in g probability.

show abstract

Bounds and analysis of aliasing errors in linear feedback shift registers

Cited by 107 publications

References 7 publications

A noniterative reconstruction algorithm for LFSR PRNG

A noniterative reconstruction algorithm for LFSR PRNG

What Causes to Tune a Condition of Exactly Identical Fault-Masks Behaviors in an LFSR based BIST Methodology

Aliasing minimization in signature analysis testing

Contact Info

Product

Resources

About