E. li Biham Livres

The content covers a range of cryptographic topics, including block cipher cryptanalysis, with improved methods for analyzing IDEA and AES-192, as well as related-key attacks on SHACAL-1. It delves into stream cipher cryptanalysis, examining Achterbahn-Version 2 and ABC v2, and discusses the design of the LEX stream cipher. Security analyses of XEX and LRW modes are also presented, alongside the extended hidden number problem and its cryptanalytic applications. The text addresses advancements in cache attacks on AES and introduces blind differential cryptanalysis for enhanced power attacks. Efficient implementations of multivariate quadratic systems and techniques to optimize crypto-coprocessors using Montgomery multiplication are highlighted. The document further explores scalar multiplication applications in curve-based cryptosystems and presents various attacks on stream ciphers, including linear approximations and correlation attacks. It also touches on public-key cryptography intersections with stream cipher analysis, redundant ?-adic expansions, pairing calculations on supersingular curves, and message authentication on 64-bit architectures. Finally, it discusses the security of timed efficient stream loss-tolerant authentication schemes and the construction of ideal hash functions from weak compression functions.

The book covers a comprehensive range of topics in cryptanalysis and secure multi-party computation. It begins with an exploration of the EMD mode of operation and the optimality of various distinguishers. A toolbox for cryptanalysis is introduced, featuring linear and affine equivalence algorithms. The discussion on secure multi-party computation includes two-threshold broadcast and the limitations of universally composable two-party computation without setup assumptions. Fair secure two-party computation is also examined. In the realm of zero-knowledge protocols, the text delves into resettable zero-knowledge in the weak public-key model, simulatable commitments, and enhancing zero-knowledge protocols using signatures. Foundations of complexity-theoretic security are discussed, alongside efficient proofs of plaintext knowledge and their applications. Public key encryption is addressed through various schemes, including those based on polynomial reconstruction and CCA2-security under general assumptions. The book also introduces new primitives like CAPTCHA for security and examines cryptanalysis techniques for stream ciphers and elliptic curve cryptography. Digital signatures are analyzed, including a scheme as secure as the Diffie-Hellman problem and aggregate signatures from bilinear maps. The importance of provable security is emphasized, alongside discussions on key exchange frameworks and information-theoretic cryptog

This volume constitutes the strictly refereed post-workshop proceedings of the Fourth International Workshop on Fast Software Encryption, FSE'97, held in Haifa, Israel, in January 1997. The 23 full papers presented were carefully selected from 44 submissions and revised for inclusion in the book. Also contained is a summary of a panel discussion. The papers are organized in sections on cryptanalysis, blockciphers, stream ciphers, message authentication codes, modes of operation, and fast software encryption. Particular emphasis is placed on applicability and implementation issues of fast cryptography.