The most recent results and some of the open key questions on the evolution of early-type galaxies are reviewed in the general cosmological context of massive galaxy formation.

Abstract Grain is one of the simplest ECRYPT Stream Cipher project Candidates which deals with key and IV of length 80 and 64 respectively. Using the linear sequential circuit approximation method, introduced by Golic in 1994, we derive a linear function of consecutive keystream bits which is held with correlation coefficient of about 2. Then using the concept of so-called generating function, ...

We analyse several well-known key establishment protocols for mobile communications. The protocols are examined with respect to their security and suitability in mobile environments. In a number of cases weaknesses are pointed out, and in many cases reenements are suggested, either to improve the eeciency or to allow simpliied security analysis.

The output of RC4 was analyzed using the ”book stack” test for randomness from [7]. It is experimentally shown that the keystream generated from RC4 can be distinguished from random with about 232 output bits.

Knudsen and Meier applied the χ-attack to RC6. This attack is one of the most effective attacks for RC6. The χ-attack can be used for both distinguishing attacks and for key recovery attacks. Up to the present, theoretical analysis of χ-attacks, especially the relation between a distinguishing attack and a key recovery attack, has not been discussed. In this paper, we investigate the theoretica...

We show that a distinguishing attack in the related key model on an EvenMansour block cipher can readily be converted into an extremely efficient key recovery attack. Concerned ciphers include in particular all iterated Even-Mansour schemes with independent keys. We apply this observation to the Caesar candidate Prøst-OTR and are able to recover the whole key with a number of requests linear in...

We present a distinguishing attack on NLS which is one of the stream ciphers submitted to the eSTREAM project. We build the distinguisher by using linear approximations of both the non-linear feedback shift register (NFSR) and the nonlinear filter function (NLF). Since the bias of the distinguisher depends on the Konst value, which is a key-dependent word, we estimate the average bias to be aro...

This paper analyses the stream cipher SSC2 [ZCC00]. We describe some weaknesses and attacks exploiting these weaknesses. The strongest attack needs about 2 words of known key stream and has a time complexity of about 2.

Rabbit stream cipher is one of the finalists of eSTREAM project which uses 128-bit secret keys. Prior to us, the attacks on Rabbit has been all focused on the bias analysis and the best result showed the distinguishing attack with complexity 2. Our analysis in this paper, is based on chosen IV analysis on reduced N-S round of Rabbit though using multi cube tester. For this purpose we show for a...