Fast Software Encryption 13th International Workshop, FSE 2006, Graz, Austria, March 15-17, 2006, Revised Selected Papers

Fast Software Encryption 13th International Workshop, FSE 2006, Graz, Austria, March 15-17, 2006, Revised Selected Papers / edited by Matt Robshaw.

Fast Software Encryption (FSE) 2006 is the 13th in a series of workshops on symmetric cryptography. It has been sponsored for the last ?ve years by the International Association for Cryptologic Research (IACR), and previous FSE workshops have been held around the world: 1993 Cambridge, UK 1994 Leuve...

Full description

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Robshaw, Matt (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2006.
Edition:1st ed. 2006.
Series:Lecture Notes in Computer Science, 4047
Springer eBook Collection.
Subjects:
Data encryption (Computer science).
Algorithms.
Coding theory.
Information theory.
Computer science—Mathematics.
Electronic resources (E-books)
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Table of Contents:
  • Stream Ciphers I
  • Cryptanalysis of Achterbahn
  • Cryptanalysis of Grain
  • Cryptanalysis of the Stream Cipher DECIM
  • Block Ciphers
  • On Feistel Structures Using a Diffusion Switching Mechanism
  • Pseudorandom Permutation Families over Abelian Groups
  • A Zero-Dimensional Gröbner Basis for AES-128
  • Hash Functions I
  • Cryptanalysis of the Full HAVAL with 4 and 5 Passes
  • Collisions and Near-Collisions for Reduced-Round Tiger
  • Analysis of Step-Reduced SHA-256
  • Analysis
  • Improved Linear Distinguishers for SNOW 2.0
  • Reducing the Space Complexity of BDD-Based Attacks on Keystream Generators
  • Breaking the ICE – Finding Multicollisions in Iterated Concatenated and Expanded (ICE) Hash Functions
  • Proposals
  • A New Dedicated 256-Bit Hash Function: FORK-256
  • Some Plausible Constructions of Double-Block-Length Hash Functions
  • Provably Secure MACs from Differentially-Uniform Permutations and AES-Based Implementations
  • Hash Functions II
  • Searching for Differential Paths in MD4
  • A Study of the MD5 Attacks: Insights and Improvements
  • The Impact of Carries on the Complexity of Collision Attacks on SHA-1
  • Modes and Models
  • A New Mode of Encryption Providing a Tweakable Strong Pseudo-random Permutation
  • New Blockcipher Modes of Operation with Beyond the Birthday Bound Security
  • The Ideal-Cipher Model, Revisited: An Uninstantiable Blockcipher-Based Hash Function
  • Implementation and Bounds
  • How Far Can We Go on the x64 Processors?
  • Computing the Algebraic Immunity Efficiently
  • Upper Bounds on Algebraic Immunity of Boolean Power Functions
  • Stream Ciphers II
  • Chosen-Ciphertext Attacks Against MOSQUITO
  • Distinguishing Attacks on the Stream Cipher Py
  • Resynchronization Attacks on WG and LEX.

Similar Items