By Sebastiaan Indesteege, Florian Mendel, Bart Preneel, Martin Schläffer (auth.), Michael J. Jacobson Jr., Vincent Rijmen, Reihaneh Safavi-Naini (eds.)

This quantity constitutes the chosen papers of the sixteenth Annual foreign Workshop on chosen parts in Cryptography, SAC 2009, held in Calgary, Alberta, Canada, in August 13-14 2009.

From a complete of ninety nine technical papers, 27 papers have been approved for presentation on the workshop. They conceal the subsequent issues: hash capabilities, on block and circulation ciphers, public key schemes, implementation, and privacy-enhancing cryptographic systems.

Show description

Read Online or Download Selected Areas in Cryptography: 16th Annual International Workshop, SAC 2009, Calgary, Alberta, Canada, August 13-14, 2009, Revised Selected Papers PDF

Best international books

Mobile Information Systems II: IFIP International Working Conference on Mobile Information Systems, MOBIS 2005, Leeds, UK, December 6-7, 2005 (IFIP International Federation for Information Processing)

Cellular info platforms II presents a set of study at the making plans, research, layout, development, amendment, implementation, usage, review, and administration of cellular info platforms. The articles concentrate on the consequences of this study on this planet of trade, and tackle technical concerns and constraints on cellular details structures functionalities and layout.

International Assessment of Research and Development in Simulation-Based Engineering and Science

Simulation-Based Engineering and technological know-how (Sbe&S) cuts throughout disciplines, exhibiting large promise in components from hurricane prediction and weather modeling to realizing the mind and the habit of various different advanced structures. during this groundbreaking quantity, 9 individual leaders investigate the most recent examine tendencies, due to fifty two web site visits in Europe and Asia and hundreds of thousands of hours of professional interviews, and talk about the results in their findings for the USA govt.

Interactive Theorem Proving: First International Conference, ITP 2010, Edinburgh, UK, July 11-14, 2010. Proceedings

This publication constitutes the refereed court cases of the 1st foreign convention on Interactive Theorem proving, ITP 2010, held in Edinburgh, united kingdom, in July 2010. The 33 revised complete papers awarded have been rigorously reviewed and chosen from seventy four submissions. The papers are prepared in issues reminiscent of counterexample new release, hybrid procedure verification, translations from one formalism to a different, and cooperation among instruments.

Additional info for Selected Areas in Cryptography: 16th Annual International Workshop, SAC 2009, Calgary, Alberta, Canada, August 13-14, 2009, Revised Selected Papers

Sample text

Mendel et al. Note that these two first phases are doing essentially the same work as the rebound attack [22], but need fewer operations to complete (on average the rebound attack takes about one operations per valid candidate, but this whole step required 264 operations). 5 times to find a solution, but compute only a few table lookups per iteration. Thus, we consider that we can find one solution for the truncated differential path 1 → 8 → 64 → 8 with about one computation of Grøstl-256 on average.

AURORA-512 adopts a narrow-pipe mode of operation named DMMD, where two half-size (256-bit) chaining variables are updated independently by using the same message in each block. However, if all blocks are updated independently, the construction becomes vulnerable to Joux’s multi-collision attack [6]. To prevent this attack, DMMD periodically computes the mixing function, which takes concatenation of two half-size chaining variables as input, to introduce the dependency of two chaining variables.

Note that an equivalent generic attack needs to find a pair with only 4 active bytes at the input and output as well. Hence, the best generic method is to start with 4 active bytes at the input and search for a near-collision on 12 non-active bytes at the output with complexity 2(12·8)/2 = 248 . Using the linearized match-in-the-middle attack, we get a known-key distinguisher for 7-rounds of AES with a complexity of about 236 and negligible memory. However, the start-from-the-middle technique allows us to further improve the complexity for the known-key distinguisher to about 224 in time and negligible memory for 7-rounds of AES.

Download PDF sample

Rated 4.68 of 5 – based on 14 votes