Comments on "a family of keystream generators with large linear complexity"

نویسنده

  • Amparo Fúster-Sabater
چکیده

In thus work, a new class of keystream generators with a large hnear complexity has been derived The design crlterla are esslly compatible with those given m the hterature to prevent correlation attacks @ 2001 Elsevler Science Ltd All rights reserved Keywords-Cryptography, Information theory, Linear complexity, Pseudorandom sequence generators, Shift register

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

LILI Keystream Generator

A family of keystream generators, called the LILI keystream generators, is proposed for use in stream cipher applications and the security of these generators is investigated with respect to currently known attacks. The design is simple and scalable, based on two binary linear feedback shift registers combined in a simple way, using both irregular clocking and nonlinear functions. The design pr...

متن کامل

Open Problems Related to Algebraic Attacks on Stream Ciphers

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...

متن کامل

- 1 - Balanced Shrinking Generators

The shrinking generator is a keystream generator which is good for stream ciphers in wireless mobile communications, because it has simple structure and generates a keystream faster than other generators. Nevertheless, it has a serious disadvantage that its keystream is not balanced if they use primitive polynomials as their feedback polynomials. In this paper, we present a method to construct ...

متن کامل

Global Linear Complexity Analysis of Filter Keystream Generators

An efficient algorithm for computing lower bounds on the global linear complexity of nonlinearly filtered PN-sequences is presented. The technique here developed is based exclusively on the realization of bit wise logic operations, which makes it appropriate for both software simulation and hardware implementation. The present algorithm can be applied to any arbitrary nonlinear function with a ...

متن کامل

Investigation of FCSR-based Pseudorandom Sequence Generators for Stream Ciphers

In this paper, feedback with carry shift registers (FCSRs) are analyzed with main focus on the general case of FCSRs with arbitrary connection integer and on maximum-period FCSRs. Moreover, a keystream generator that employs the structure of the linear feedback shift register (LFSR)-based Geffegenerator is studied in connection with FCSRs as a special nonlinear combining generator. The consider...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Appl. Math. Lett.

دوره 14  شماره 

صفحات  -

تاریخ انتشار 2001