Titlebook: Selected Areas in Cryptography; 17th International W Alex Biryukov,Guang Gong,Douglas R. Stinson Conference proceedings 2011 Springer Berli

Magnitude

A 3-Subset Meet-in-the-Middle Attack: Cryptanalysis of the Lightweight Block Cipher KTANTAN shows that a strong related-key property can translate to a successful attack in the non-related-key setting. Having extremely low data requirements, these attacks are valid even in RFID-like environments where only a very limited amount of text material may be available to an attacker.

ILEUM

Affine Masking against Higher-Order Side Channel Analysisng. We then conduct an in-depth analysis pinpointing the leakage reduction implied by affine masking. Our results clearly show that the proposed scheme provides an excellent performance-security trade-off to protect AES against higher-order SCA.

共同给与

Zero-Sum Distinguishers for Iterated Permutations and Application to ,-, and Hamsi-256e applied to the .-. permutation and to Hamsi-256. We exhibit several zero-sum partitions for 20 rounds (out of 24) of .-. and some zero-sum partitions of size 2. and 2. for the finalization permutation in Hamsi-256.

敲竹杠

The Rise and Fall and Rise of Combinatorial Key Predistributionombinatorial key predistribution shemes and discuss their limitations. We then explain why this problem is back “in fashion” after a period of limited attention by the research community. We consider the appropriateness of combinatorial techniques for key distribution and identify potential areas of further research.

原谅

A Low-Area Yet Performant FPGA Implementation of Shabal per slice. Our work can also be ported to Xilinx Spartan-3 FPGAs, on which it supports a throughput of 800 Mbit/s for only 499 slices, or equivalently 1.6 Mbit/s per slice..According to the SHA-3 Zoo website [1], this work is among the smallest reported FPGA implementations of SHA-3 candidates, and ranks first in terms of throughput per area.

是突袭

inculpate

0302-9743 of the 17th Annual International Workshop on Selected Areas in Cryptography, SAC 2010, held in Waterloo, Ontario, Canada in August 2010. The 24 revised full papers presented together with 2 invited papers were carefully reviewed and selected from 90 submissions. The papers are organized in topical s

ALB

Devastate

停止偿付

Wild McElieceg algorithms that efficiently correct even more errors for the same codes over ... Finally, this paper shows that the increase from . errors to more than . errors allows considerably smaller keys to achieve the same security level against all known attacks.