Results 151 to 160 of about 7,549 (186)
Some of the next articles are maybe not open access.
Comparison of binary and LFSR counters and efficient LFSR decoding algorithm
2011 IEEE 54th International Midwest Symposium on Circuits and Systems (MWSCAS), 2011This paper provides a direct comparison between a fast binary counter, built using a hierarchical Manchester carry chain, and a counter built using a linear feedback shift register (LFSR). The comparison is focused on speed, power and area consumption. We demonstrate the use of LFSRs as an alternative to conventional binary event counters.
Avinash Ajane +3 more
openaire +1 more source
Proceedings 10th Asian Test Symposium, 2002
Develops a low-power multiphase clock generator, employ static demultiplexers and proposes a hybrid design to reduce the power. The power model is based on the weighted transition count (WTC). The internal gates of a latch consume 2 transitions per cycle when the data changes.
null Tsung-Chu Huang, null Kuen-Jong Lee
openaire +1 more source
Develops a low-power multiphase clock generator, employ static demultiplexers and proposes a hybrid design to reduce the power. The power model is based on the weighted transition count (WTC). The internal gates of a latch consume 2 transitions per cycle when the data changes.
null Tsung-Chu Huang, null Kuen-Jong Lee
openaire +1 more source
A low power reconfigurable LFSR
2016 18th Mediterranean Electrotechnical Conference (MELECON), 2016Low power has become an essential design imperative in the era of nanotechnology. In this paper, we propose a new design of energy efficient reconfigurable Linear Feedback Shift Registers(LFSRs). The reconfigurable LFSR design allows an increase in the randomness at the output.
Lama Shaer +4 more
openaire +1 more source
Parallel computation of LFSR signatures
Proceedings of 1993 IEEE 2nd Asian Test Symposium (ATS), 2002Off-line determination of signatures (both good circuit and faulty circuits) for built-in self-test applications is a compute-intensive process that involves cycle-by-cycle simulation of the signature analyzer. In this paper, we present a parallel algorithm that can speed up the computation of (single input and multiple input) LFSR signatures by almost
B. Narendran, M. Franklin, K.K. Saluja
openaire +1 more source
2020 6th International Conference on Advanced Computing and Communication Systems (ICACCS), 2020
A new design of the Linear-feedback shift register (LFSR) using the conditional discharge flip-flop (CDFF) and the Gate-Diffusion-Input (GDI) technique is proposed. This method results in efficient result parameters such as low power, reduced area and minimum usage of transistor than conventional techniques.
S. Kiruthiga +3 more
openaire +1 more source
A new design of the Linear-feedback shift register (LFSR) using the conditional discharge flip-flop (CDFF) and the Gate-Diffusion-Input (GDI) technique is proposed. This method results in efficient result parameters such as low power, reduced area and minimum usage of transistor than conventional techniques.
S. Kiruthiga +3 more
openaire +1 more source
2010 10th IEEE International Conference on Computer and Information Technology, 2010
This paper scrutinizes the structure of jump-controlled LFSRs for resistance against generalized correlation attack based upon Constrained Levenshtein Distance(CLD) measure. It proves that for a given number of cipher text bits, CLD computation is independent of Jump index.
Mujahid Mohsin +2 more
openaire +1 more source
This paper scrutinizes the structure of jump-controlled LFSRs for resistance against generalized correlation attack based upon Constrained Levenshtein Distance(CLD) measure. It proves that for a given number of cipher text bits, CLD computation is independent of Jump index.
Mujahid Mohsin +2 more
openaire +1 more source
Fibonacci LFSR vs. Galois LFSR: Which is More Vulnerable to Power Attacks?
2014Linear Feedback Shift Registers (LFSRs) with primitive connection polynomials as feedback functions are used as primary components of many stream ciphers and other cryptosystems. The motivation of our work is to demonstrate that though hardware implementation of Galois LFSR offers higher throughput than its Fibonacci counterpart, the former could be ...
Abhishek Chakraborty +2 more
openaire +1 more source
LFSR Reseeding with Irreducible Polynomials
13th IEEE International On-Line Testing Symposium (IOLTS 2007), 2007We propose an innovative scheme for LFSR re- seeding based on the efficient generation of the seeds of any non-primitive irreducible polynomial. The scheme has very small hardware overhead irrespective of the number of seeds and guarantees that the generation of the pattern subsequence from each seed is disjoint.
Snehal Udar, Dimitri Kagaris
openaire +1 more source
Breaking LFSR Using Genetic Algorithm
2013In this paper it is shown how to find LFSR using genetic algorithm. LSFRs are part of many cryptographic structures and pseudorandom number generators. Applying genetic algorithms to Linear Feedback Shift Registers (LFSR) cryptanalysis is not quite obvious. Genetic algorithms being one of heuristic techniques give approximate solution. The solution
Iwona Polak, Mariusz Boryczka
openaire +1 more source
Ciphertext Only Attack on LFSR Based Encryption Scheme
Calcutta Statistical Association Bulletin, 1999Here a security attack on LFSR based stream cipher systems is described. The attack depends on some weakness of the memory less Boolean combining function used in the system and breaks the key using only the ciphertext. Siegenthaler used a correlation measure to define certain statistical test for finding out feasible keys.
Maitra, S., Roy, B. K., Sarkar, P.
openaire +2 more sources