Titlebook: Selected Areas in Cryptography; 9th Annual Internati Kaisa Nyberg,Howard Heys Conference proceedings 2003 Springer-Verlag Berlin Heidelberg

Chagrin

Two Alerts for Design of Certain Stream Ciphers: Trapped LFSR and Weak Resilient Function over GF(q)(ii) a weakness of the construction of the resilient functions over GF(.) proposed at CRYPTO’96. Two corresponding methods for cryptanalysis are proposed. It is shown that although certain keystream generators over GF(.) are resistant against correlation and linear complexity based attacks, they are

FECT

意外的成功

A New Cryptanalytic Attack for PN-generators Filtered by a Boolean Function function and the LFSR structure so as to introduce a new iterative decoding technique. The results we obtained prove to be very good: indeed, even in the case of systems for which classical iterative algorithms appear powerless, our scheme enables us to recover the LFSR initial state with a very lo

CALL

权宜之计

Luby-Racko. Ciphers: Why XOR Is Not So Exclusivenary operation in an arbitrary finite group. We obtain various interesting results in this context: - First, we analyze the security of three-round Feistel ladders over arbitrary groups. We examine various Luby-Racko. ciphers known to be insecure when XOR is used. In some cases, we can break these c

闪光你我

New Results on Unconditionally Secure Distributed Oblivious Transfer and a Receiver is interested in one of them. During a set up phase, the Sender gives information about the secrets to . servers. Afterwards, in a recovering phase, the receiver can compute the secret she wishes by interacting with . of them. More precisely, from the answers received she computes th

emission

On the Security of CTR + CBC-MAC the security of CCM in terms of the security of the underlying block cipher. The conclusion is that CCM provides a level of privacy and authenticity that is in line with other proposed modes such as OCB.

Commonplace

Higher Order Differential Attack of ,(II)per, we present a new attack of . using 16-th order Differential and show that 11 round variant without FL function is attackable. Moreover, we show that 11 round variant with FL function is attackable, if we use chosen ciphertexts for this attack.

使服水土

Full-Round Differential Attack on the Original Version of the Hash Function Proposed at PKC’98valanche Criterion). This paper improves their attack and shows that we can find a collision pair from the original version of the hash function with probability 2-37.13 through the improved method. Furthermore we point out a weakness of the function comes from shift values dependent on message.

致敬

Francesco Sica,Mathieu Ciet,Jean-Jacques Quisquater