Results 131 to 140 of about 653 (181)
Some of the next articles are maybe not open access.
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
A Distinguisher for RNGs with LFSR Post-processing
2021Random number generator (RNG) is a fundamental element in modern cryptography. If the quality of the outputs generated by RNGs is not as well as expected, the cryptographic applications which use the random number service are vulnerable to security threats.
Xinying Wu, Yuan Ma, Tianyu Chen, Na Lv
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
High-speed generation of LFSR signatures
Proceedings of the Ninth Asian Test Symposium, 2002We investigate techniques for speeding up the compaction simulation of a single-input signature register based on its equivalent multiple-input implementation. Our approach is to systematically decompose the original input sequence into a set of subsequences based on the theory of finite field.
Ming-Der Shieh +2 more
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
Implementation of LFSR on ASIC
2012 Annual IEEE India Conference (INDICON), 2012The intension of this work is to design ASIC (Application Specific Integrated Circuit) for LFSRs (Linear feedback shift register) used in cryptography systems.(Stream ciphering). Presently FPGAs (Field Programmable Gate Array) and Processors are used for this purpose which have speed limitations.
openaire +1 more source
On linear dependencies in subspaces of LFSR-generated sequences
IEEE Transactions on Computers, 1996Summary: The probability of linear dependency in subsequences generated by linear feedback shift registers is examined. It is shown that this probability for a short subsequence, e.g., a sequence defined by the length of a scan chain, can be much higher than that for an entire \(m\)-sequence.
Janusz Rajski, Jerzy Tyszer
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
Decoding a Perturbed Sequence Generated by an LFSR
2017Given a sequence of bits produced by a linear feedback shift register (LFSR), the Berlekamp-Massey algorithm finds a register of minimal length able to generate the sequence. The situation is different when the sequence is perturbed; for instance, when it is sent through a transmission channel. LFSRs can be described as autonomous systems.
Sara D. Cardell +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 0001 +2 more
openaire +1 more source