On the diagnostic properties of linear feedback shift registers

Rajski, J.; Tyszer, Jerzy

doi:10.1109/43.88927

Cited by 26 publications

(7 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These findings are consistent with our earlier results presented in [33], and thus a formula derived in [33] for the size of a MISR that assures the required quality of diagnosis (represented by the diagnostic resolution) can be reliably adopted for the proposed TSV test environment. For example, in order to uniquely diagnose all targeted single failures affecting 1,000,000 TSVs, one would need to handle 8,000,000 faults by employing 2log 2 8,000,000 ≈ 46-bit test response compactor [33] such as a MISR.…”

Section: Resultssupporting

confidence: 92%

Fault diagnosis of TSV-based interconnects in 3-D stacked designs

Rajski

Tyszer

2013

2013 IEEE International Test Conference (ITC)

Self Cite

View full text Add to dashboard Cite

Through-silicon vias (TSVs) are crucial elements of 3-D bonded integrated circuits. Since they connect different layers of 3-D stacks, their proper operation is an essential prerequisite for the system function. This paper describes a procedure for deriving fault diagnosis test sequences to identify single and multiple defective TSVs. Additional experimental results obtained for pseudorandom patterns illustrate feasibility and robustness of the proposed test schemes in terms of their detection and diagnostic capabilities and are reported herein.

show abstract

Section: Resultssupporting

confidence: 92%

Fault diagnosis of TSV-based interconnects in 3-D stacked designs

Rajski

Tyszer

2013

2013 IEEE International Test Conference (ITC)

Self Cite

View full text Add to dashboard Cite

show abstract

“…Length of unique random number is totally depending on the total count of required unique random number (U), which can be calculated by the given formula-2 L >= U > 2 L-1 (3) B. Algorithm These are the following steps to produce unique random numbers- (Keyword, N, OS[N] [2], U, URnum [U], R, L, i, j, k, m, x, y, z, w, flag) This algorithm is used for generating U count of unique random numbers by using user's Keyword. URnum is a linear array of U length for storing U cout of unique random number where OS is a 2-D array which stores output symbols of LFSR.…”

Section: ) Length (L) Of Unique Random Numbermentioning

confidence: 99%

Linear Feedback Shift Register Based Unique Random Number Generator

Verma

Singh

Ambedkar³

2014

IJCSI

View full text Add to dashboard Cite

Linear Feedback Shift Register based Unique Random Number Generator is an enhancement of Random Number generator with the additional property that any number generated by a unique random number generator can’t be duplicated. As per users demand for not duplicated random numbers in some applications like transferring a random number over the network on the behalf of actual character of the message for security point of view, existence of unique random number generators are very essential. In this paper LFSR [1] (Linear Feedback Shift Register) is used to implement the proposed concept of unique random number generator. Using LFSR is a faster approach for generating random sequences because it requires only X-OR operations and shift registers that’s why its implementation is very easy in software as well as in hardware [2, 3]. We can easily modify the LFSR and produce different random sequences. So it is the best option for using LFSR in unique random number generator.

show abstract

“…A Linear Feedback Shift Register is a shift register whose input state is a linear function of its previous state [9,10]. The only linear functions of single bits are XOR and inverse-XOR; thus it is a shift register whose input bit is driven by the exclusive-or (XOR) of some bits of the overall shift register value [11].…”

Section: Linear Feedback Shift Registermentioning

confidence: 99%

6 X 6 Playfair Cipher using LFSR based Unique Random Number Generator

Kaur¹,

Verma²,

Singh³

2012

IJCA

View full text Add to dashboard Cite

Playfair cipher is the well-known multiple letter encryption cipher. Here the digraphs in the plaintext are treated as single units and converted into corresponding cipher text digraphs. However because of the drawbacks inherent in the 5 X 5 Playfair cipher which adversely affects the security we proposed a 6 X 6 Playfair cipher and then coupled it with Linear Feedback Shift Register based Unique Random Number Generator [1]. 6 X 6 Playfair cipher supports all 26 alphabets (A-Z) and 10 digits (0-9) which eliminate the limitation of 5 X 5 Playfair in which "i" and "j" both character could not appear at the same time [2,3]. LFSR not only enhances the security up to a considerable level by generating random sequences but also provides a much faster rate of encryption and decryption [1], that's why LFSR based Unique Random Number Generator is chosen for the consideration. This paper deals in with the security issues of the new proposed system. Various types of cryptography attacks have been taken under consideration for original Playfair cipher but not vulnerable for this proposed cipher.

show abstract

On the diagnostic properties of linear feedback shift registers

Cited by 26 publications

References 12 publications

Fault diagnosis of TSV-based interconnects in 3-D stacked designs

Fault diagnosis of TSV-based interconnects in 3-D stacked designs

Linear Feedback Shift Register Based Unique Random Number Generator

6 X 6 Playfair Cipher using LFSR based Unique Random Number Generator

Contact Info

Product

Resources

About