Ring Generators—New Devices for Embedded Test Applications

Mrugalski, Grzegorz; Rajski, J.; Tyszer, Jerzy

doi:10.1109/tcad.2004.831584

Cited by 93 publications

(40 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This possibility was first observed in [10] for LFSRs. However, the solution proposed in [10] is specific to LFSRs and cannot be applied systematically to FCSRs. The number # adders of 2-bit adders required in the different representations of an n-bit FCSR is shown in Table 1.…”

Section: Fig 5 a Naive Addermentioning

confidence: 79%

See 1 more Smart Citation

A New Approach for FCSRs

Arnault

Berger

Lauradoux

et al. 2009

Selected Areas in Cryptography

View full text Add to dashboard Cite

Abstract. The Feedback with Carry Shift Registers (FCSRs) have been proposed as an alternative to Linear Feedback Shift Registers (LFSRs) for the design of stream ciphers. FCSRs have good statistical properties and they provide a built-in non-linearity. However, two attacks have shown that the current representations of FCSRs can introduce weaknesses in the cipher. We propose a new "ring" representation of FCSRs based upon matrix definition which generalizes the Galois and Fibonacci representations. Our approach preserves the statistical properties and circumvents the weaknesses of the Fibonacci and Galois representations. Moreover, the ring representation leads to automata with a quicker diffusion characteristic and better implementation results. As an application, we describe a new version of F-FCSR stream ciphers.

show abstract

Section: Fig 5 a Naive Addermentioning

confidence: 79%

“…A ring FCSR can be viewed as a generalization of the Fibonacci and Galois representations. Similar structure has been widely studied for the LFSR case as in [8,9,10], and is a building block of the stream cipher Pomaranch where LFSRs are used [11]. However, we present here for the first time this structure in the FCSR case.…”

Section: Introductionmentioning

confidence: 97%

A New Approach for FCSRs

Arnault

Berger

Lauradoux

et al. 2009

Selected Areas in Cryptography

View full text Add to dashboard Cite

show abstract

“…The Galois LFSR generating the same sets of output sequences as a given Fibonacci LFSR can be obtained by reversing the order of the feedback taps and adjusting the initial state. Several transformations aiming to optimize the traditional LFSRs with respect to different parameters were presented, including [15][16][17][18][19]. For NLFSRs, however, the Galois configuration is not unique.…”

Section: Previous Workmentioning

confidence: 99%

An Equivalence-Preserving Transformation of Shift Registers

Dubrova

2014

Sequences and Their Applications - SETA 2014

View full text Add to dashboard Cite

Abstract. The Fibonacci-to-Galois transformation is useful for reducing the propagation delay of feedback shift register-based stream ciphers and hash functions. In this paper, we extend it to handle Galois-to-Galois case as well as feedforward connections. This makes possible transforming Trivium stream cipher and increasing its keystream data rate by 27% without any penalty in area. The presented transformation might open new possibilities for cryptanalysis of Trivium, since it induces a class of stream ciphers which generate the same set of keystreams as Trivium, but have a different structure.

show abstract

“…LFSR reseeding exploits the low fill rate of test cubes. In [19], ring generators were proposed as an alternative to classical LFSRs and in [20], embedded deterministic test was presented. Other well known techniques have been presented in [21]- [28].…”

Section: T He Main Objective Of Test Data Compression (Tdc)mentioning

confidence: 99%

High-Quality Statistical Test Compression With Narrow ATE Interface

Tenentes

Kavousianos

2013

IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.

View full text Add to dashboard Cite

Abstract-In this paper, we present a novel compression method and a low-cost decompression architecture that combine the advantages of both symbol-based and linear-based techniques and offer a very attractive unified solution that removes the barriers of existing test data compression techniques. Besides the traditional goals of high compression and short test application time, the proposed method also offers low shift switching activity and high unmodeled defect coverage at the same time. In addition, it favors multi-site testing as requires a very low pincount interface to the automatic test equipment. Finally, contrary to existing techniques, it provides an integrated solution for testing multi-core system on chips (SoCs) as it is suitable for cores of both known and unknown structures that usually coexist in SoCs.Index Terms-Defect-oriented testing, design for testability, dft, IP cores, low-power scan-based testing, multi-core SoC, selective Huffman, test data compression, unmodeled defect coverage.

show abstract

Ring Generators—New Devices for Embedded Test Applications

Cited by 93 publications

References 17 publications

A New Approach for FCSRs

A New Approach for FCSRs

An Equivalence-Preserving Transformation of Shift Registers

High-Quality Statistical Test Compression With Narrow ATE Interface

Contact Info

Product

Resources

About