نتایج جستجو برای: lfsr

تعداد نتایج: 528  

2005
Anne Canteaut

The recently developed algebraic attacks apply to all keystream generators whose internal state is updated by a linear transition function, including LFSR-based generators. Here, we describe this type of attacks and we present some open problems related to their complexity. We also investigate the design criteria which may guarantee a high resistance to algebraic attacks for keystream generator...

Journal: :International Journal on Advanced Science, Engineering and Information Technology 2011

1993
Hugo Krawczyk

The Shrinking Generator, presented at Crypto'93, is a LFSR-based pseudorandom generator suitable for the implementation of additive stream ciphers. It is particularly simple and has attractive security properties. (The reader is referred to [1] for the definition of the generator and its properties). Although the algorithm was originally intended for hardware implementation, here we will focus ...

Journal: :IEEE Trans. Information Theory 2009
Enes Pasalic

In this work, the performance of probabilistic algebraic attacks is compared to classical (fast) algebraic attacks in the context of their application to certain linear beedback shift register (LFSR)-based stream ciphers. Using some results from coding theory it is shown that in terms of time complexity classical deterministic algebraic attacks are in general a more efficient cryptanalytic tool...

2013
Navdeep Kaur Neeru Malhotra

In today’s Integrated Circuits (ICs), Built-In-Self Test (BIST) is becoming increasingly important as designs become more complicated. BIST is a design technique that allows a circuit to test itself Test pattern generator (TPG) using Linear Feedback Shift Resister (LFSR) is proposed which is more suitable for BIST architecture.In this paper we have design ALU (arithmetic and logic unit) in VHDL...

Journal: :J. Inf. Sci. Eng. 2002
Jun-Cheol Jeon Hyun-Sung Kim Hyoung-Mok Lee Kee-Young Yoo

This paper presents a new multiplication algorithm and, based on this algorithm, proposes a hardware architecture, called Modified Inner-Product Multiplier (MIPM), which computes AB multiplication based on a Linear Feedback Shift Register (LFSR). The algorithm is based on the property of the irreducible all one polynomial (AOP) over the finite field GF(2). The proposed architecture reduces the ...

1993
Srikanth Venkataraman Janusz Rajski Sybille Hellebrand

In this paper we describe an optimized BIST scheme based on reseeding of multiple polynomial Linear Feedback Shift Registers LFSRs The same LFSR that is used to gen erate pseudo random patterns is loaded with seeds from which it produces vectors that cover the testcubes of dif cult to test faults The scheme is compatible with scan design and achieves full coverage as it is based on random patte...

2013
Amandeep Singh

Error correcting codes are used for detection and correction of errors in digital communication system. Error correcting coding is based on appending of redundancy to the information message according to a prescribed algorithm. Reed Solomon codes are part of channel coding and withstand the effect of noise, interference and fading. Galois field arithmetic is used for encoding and decoding reed ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید