Results 131 to 140 of about 699 (182)
Some of the next articles are maybe not open access.
Proceedings of the 17th IEEE Instrumentation and Measurement Technology Conference [Cat. No. 00CH37066], 2002
This paper presents the preliminary results for a novel mixed-mode scheme to generate test patterns for random pattern resistant faults. It is based on a programmable method in contrast to the hardware implementation used so far. It not only guarantees the full test coverage in the combinational stuck-at faults, but also can be extended to the ...
D. Kay, S. Mourad
openaire +1 more source
This paper presents the preliminary results for a novel mixed-mode scheme to generate test patterns for random pattern resistant faults. It is based on a programmable method in contrast to the hardware implementation used so far. It not only guarantees the full test coverage in the combinational stuck-at faults, but also can be extended to the ...
D. Kay, S. Mourad
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
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 +2 more sources
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 +2 more sources
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
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
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 +2 more sources
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 +2 more sources
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
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
Application of LFSR with NTRU Algorithm
2007The paper deals with stream cipher based on Linear Feedback Shift Registers (LFSR). A scheme is purposed where n-Linear Feedback Shift Registers are used for the encryption and decryption. Both the public key cryptography and the concept of linear feedback shift registers are used in this scheme.
P. R. Suri, Priti Puri
openaire +1 more source