A data encryption technology which ensures secrecy of the data while being transferred over a long distance. It can provide about 80-85% data security as decoding of data involves inverting the feedback function or generating the binary sequence which will help in retrieving the data after some recombination operation.

Linear feedback shift registers (LFSRs) and nonlinear feedback shift registers (NLFSRs) are major components of stream ciphers. It has been shown that, under certain idealized assumptions, LFSRs and LFSR-based stream ciphers are susceptible to cryptanalysis using simple power analysis (SPA). In this paper, we show that simple power analysis can be practically applied to a CMOS digital hardware ...

Non-linear feedback shift registers are widely used in lightweight cryptographic primitives. For such constructions we propose a general analysis technique based on differential cryptanalysis. The essential idea is to identify conditions on the internal state to obtain a deterministic differential characteristic for a large number of rounds. Depending on whether these conditions involve public ...

In [3], we have introduced vectorial conception of FCSR’s in Fibonacci mode. This conception allows us to easily analyze FCSR’s over binary finite fields F2n for n ≥ 2. In [4], we describe and study the corresponding Galois mode and use it to design a new stream cipher. In this paper, we introduce the Ring mode for vectorial FCSR, explain the analysis of such Feedback registers and illustrate w...

To estimate the pose of a C-Arm during interventions therapy we have developed a small sized X-Ray Target including a special set of beads with known locations in 3D space. Since the patient needs to remain in the X-Ray path for all feasible poses of the C-Arm during the intervention, we cannot construct a single marker which is entirely visible in all images. Therefore finding 2D-3D point corr...

Linear Consistency Test (LCT) is a well-known algebraic method of cryptanalysis of stream ciphers. In this paper, we use LCT in an attack on a noised irregularly clocked linear feedback shift register (LFSR). We show that it is possible to reconstruct the initial states of both the clocked and the clocking LFSR in this scheme by using an essentially algebraic attack method, such as LCT, as a bu...

This paper investigates the generation of a binary Modified Jacobi sequence by means of an additive combination of constituent binary Legendre sequences which are clocked at different rates. These multi-rate combinations demonstrate that sequences of large linear complexity can be generated without resorting to linear feedback shift registers (LFSRs) of large length. Results on the linear compl...

The Berlekamp-Massey algorithm takes a sequence of elements from a field and finds the shortest linear recurrence (or linear feedback shift register) that can generate the sequence. In this paper we extend the algorithm to the case when the elements of the sequence are integers modulo m, where m is an arbitrary integer with known prime decomposition.