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

ingrate

Integer Decomposition for Fast Scalar Multiplication on Elliptic Curvest linearly independent vectors. Once a pair of such vectors exists, their decomposition method improves the efficiency of the scalar multiplication roughly about 50%. In this paper, we state and prove a necessary condition for the existence of a pair of desired vectors and we also present an algorithm to find them.

Admonish

Encryption-Scheme Security in the Presence of Key-Dependent Messagesacle model. By developing and achieving stronger notions of encryption-scheme security it is hoped that protocols which are proven secure under “formal” models of security can, in time, be safely realized by generically instantiating their primitives.

轻弹

Square-like Attacks on Reduced Rounds of IDEAuires only 103 chosen plaintexts. We have reduced the number of required plaintexts significantly up to 4 rounds. We also present some interesting properties of the reduced round variants of the cipher which have not been published before. The properties and the attacks bring a different approach to analyse the cipher.

保留

A New Cryptanalytic Attack for PN-generators Filtered by a Boolean Functionw error probability. The latter is such that ending the algorithm by an exhaustive search among sequences of limited length is hardly needed. Therefore, the overall complexity of our scheme remains very small and the algorithm appears as an excellent candidate for cryptanalysis of filtered PN-generators.

gangrene

EXUDE

Multiples of Primitive Polynomials and Their Products over GF(2) the products of primitive polynomials. We here make a detailed analysis on .-nomial multiples of products of primitive polynomials. We present new enumeration results for these multiples and provide some estimation on their degree distribution.

报复

White-Box Cryptography and an AES Implementation the containing application. We partially justify our aes implementation, and motivate its design, by showing how removal of parts of the recommended implementation allows specified attacks, including one utilizing a pattern in the aes . table.

乳汁

lobster

On Propagation Characteristics of Resilient Functionsessary condition for construction of functions with good autocorrelation properties. We conclude by a study of the main constructions of resilient functions. We notably show how to avoid linear structures when a linear concatenation is used and when the recursive construction introduced in [.] is chosen.

禁令

Modifications of ECDSAcate signatures. The second variant is also secure against existential forgery but we argue that it is likely to possess only four natural duplicate signatures. Our variants of ECDSA are analogous to the variants of DSA as proposed by Brickell .. However, we show that the ECDSA variants have better