Results 241 to 250 of about 129,653 (280)

Signature analysis with non-linear feedback shift registers

Proceedings. 'Meeting the Tests of Time'., International Test Conference, 2003
The use of nonlinear feedback shift registers (NLFSRs) in the design of signature analyzers (SAs) was investigated. It is shown that SAs with arbitrarily low values of error-escape probability and requiring less hardware than their linear feedback shift register (LFSR) counterparts are feasible and systematically realizable. >
P.N. Marinos, R. Raina
openaire   +1 more source

Reconfigurable Linear Feedback Shift Register

2022 4th International Conference on Smart Systems and Inventive Technology (ICSSIT), 2022
Kamma Madhulatha, Karasani Jyothika, Sirikonda Venkata Bala Harini, Geethu Remadevi Somanathan, Ramesh Bhakthavathchalu   +4 more
openaire   +1 more source

Gated-Clock Design of Linear-Feedback Shift Registers

IEEE Transactions on Circuits and Systems II: Express Briefs, 2008
In this paper, we will present a method to reduce the power consumption of the popular linear feedback shift register. The proposed scheme is based on the gated clock design approach and it can offer a significant power reduction, depending on technological characteristics of the employed gates. Moreover, the analytical condition that must be satisfied
W. Aloisi, R. Mita
openaire   +1 more source

3D - Playfair Cipher using Linear Feedback Shift Register

Confluence 2013: The Next Generation Information Technology Summit (4th International Conference), 2013
3D-Playfair cipheris the multiple letter encryption cipher. It is an enhancement of classical playfair cipher and it works on trigraphs (combination of three letters) rather than digraphs for additional security. 3D-Playfair cipher is dealing with 64 characters and supports all 26 alphabets {A-Z}, 10 digits {0-9} and 28 special characters { ! “ # $ % &
S. Singh, A. Kaur, R.K. Singh
openaire   +1 more source

Efficient Parallel Architecture for Linear Feedback Shift Registers

IEEE Transactions on Circuits and Systems II: Express Briefs, 2015
This brief presents a new parallel architecture for linear feedback shift registers (LFSRs), which can be used to achieve high-throughput Bose–Chaudhuri–Hocquenghem or cyclic redundancy check encoders for storage and communication systems. While previous parallel LFSR architectures have computed values by using the past input messages and the register ...
Jung, J, Yoo, H, Lee, Y, Park, IC
openaire   +2 more sources

Linear feedback shift register design using cyclic codes

IEEE Transactions on Computers, 1988
A design technique is given for linear-feedback shift registers (LFSR) that generate test patterns for pseudoexhaustive testing of networks with restricted output dependency. This technique is based on cyclic code theory. Examples indicate that LFSRs based on cyclic codes are easier to implement and have lower hardware overhead than LFSRs that use ...
L.-T. Wang, E.J. McCluskey
openaire   +1 more source

Efficient Software Implementation of Linear Feedback Shift Registers

2001
Linear Feedback Shift Registers (LFSRs) are used as pseudorandom keystream generators in cryptographic schemes. Hardware implementation of LFSRs are simple and fast but their software implementation is not quite efficient. Here we present a fast software implementation strategy for the LFSRs.
Sandeepan Chowdhury, Subhamoy Maitra
openaire   +1 more source

Sequential Behaviour of Linear Product Feedback Shift Registers

IETE Journal of Research, 1976
This paper is concerned with the sequential operation of linear product feedback shift registers (f.s.r.). Special reference is made to the polynomial representation of feedback logic in a linear f.s.r.; and the concept of generating function is shown to facilitate the evalution of its sequence structure.
openaire   +1 more source

Efficient Blind Signatures from Linear Feedback Shift Register

2007
Linear feedback shift register(LFSR) sequencces can be used to shorten the representation of the elements of a finite field. We employ n-stage LFSR sequence to construct an efficient blind signature scheme where main computation operations are performed in GF(q) and there do not need any exponentiation in its extension field GF(qn).
Xiangxue Li, Dong Zheng, Kefei Chen
openaire   +1 more source

Secrets of Linear Feedback Shift Registers

Mathematics Magazine, 2022
openaire   +1 more source