Results 131 to 140 of about 611 (160)

Fibonacci LFSR vs. Galois LFSR: Which is More Vulnerable to Power Attacks?

2014
Linear 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, Bodhisatwa Mazumdar, Debdeep Mukhopadhyay   +2 more
openaire   +1 more source

LFSR Reseeding with Irreducible Polynomials

13th IEEE International On-Line Testing Symposium (IOLTS 2007), 2007
We 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

2013
In 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, 1999
Here 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

Fault-cover enhancements through LFSR modifications

International Journal of Electronics, 1989
The problem of aliasing has been considered for the testing of circuits employing signature analysis as a means of response evaluation. Various alternative schemes for increasing fault-coverage have been proposed. These schemes are based upon modifications of the linear feedback shift register in various ways.
N. K. NANDA, NAVEEN KUMAR
openaire   +1 more source

Implementation of LFSR on ASIC

2012 Annual IEEE India Conference (INDICON), 2012
The 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

Performance analysis of wave-pipelined LFSR

IEEE International Symposium on Communications and Information Technology, 2004. ISCIT 2004., 2005
Since a wave-pipelined circuit does not use a register, it is superior to a conventional pipelined circuit in view of speed and power dissipation. Although wave-pipelining is very promising technology for mobile computers, the usage of this technology was restricted to a part of those processors, that is, combinational circuits. Thus, we have exploited
T. Sato, R. Sakuma, D. Miyamori, M. Fukase   +3 more
openaire   +1 more source

Breaking LFSR using ant colony optimization

2018 International Conference on Advanced Communication Technologies and Networking (CommNet), 2018
Ant Colony Optimization is a search meta-heuristic inspired by the behavior of real ant colonies and shown their effectiveness, robustness to solve a wide variety of complex problems. In this paper, we present a novel Ant Colony Optimization (ACO) based attack for cryptanalysis of Linear Feedback Shift Registers (LFSR). A known plaintext attack is used
Hicham Grari, Ahmed Azouaoui, Khalid Zine-Dine   +2 more
openaire   +1 more source

LFSR identification using Groebner bases

2016 Twenty Second National Conference on Communication (NCC), 2016
Given the output of an unknown linear feedback shift register (LFSR), the Berlekamp-Massey algorithm can be used to recover the characteristic polynomial of the LFSR. We propose a method to recover the characteristic polynomial and initial state of an LFSR from a noisy version of its output sequence using Groebner bases.
openaire   +1 more source

Euclid's algorithm and LFSR synthesis

2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060), 2002
We consider two methods of Euclid's algorithm to solve the linear feedback shift register (LFSR) synthesis problem. One of the methods is identically equivalent to the celebrated Berlekamp-Massey (B-M) algorithm. The other method is distinctly Euclidean.
openaire   +1 more source