Selected Areas in Cryptography

Name: Selected Areas in Cryptography | 17th International Workshop, SAC 2010, Waterloo, Ontario, Canada, August 12-13, 2010, Revised Selected Papers
Brand: Springer
Price: 53.49 EUR
Availability: OnlineOnly

17th International Workshop, SAC 2010, Waterloo, Ontario, Canada, August 12-13, 2010, Revised Selected Papers

Alex Biryukov Guang Gong Douglas R. Stinson(Herausgeber*in)

Springer (Verlag)

Erschienen am 3. März 2011

XIII, 411 Seiten

E-Book

PDF mit Wasserzeichen-DRM

Systemvoraussetzungen

978-3-642-19574-7 (ISBN)

53,49 €inkl. 7% MwSt.

Systemvoraussetzungen

für PDF mit Wasserzeichen-DRM

E-Book Einzellizenz

Als Download verfügbar

Beschreibung

Weitere Details

Weitere Ausgaben

Inhalt

Title Page
Preface
Organization
Table of Contents
Hash Functions I
Zero-Sum Distinguishers for Iterated Permutations and Application to Keccak-f and Hamsi-256
Introduction
Zero-Sum Structures and Distinguishing Properties
Zero-Sums and Codewords in a Linear Code
Zero-Sum Partitions
Exploiting the Degree of the Nonlinear Part
Zero-Sum Partitions from Higher-Order Derivatives
An Improved Bound on the Degree Based on the Walsh Spectrum
Exploiting the Structure of the Diffusion Part
One-Round Multiset Property
Multiset Property on Several Rounds
Application to the Keccak-f Permutation
The Keccak-f Permutation
Zero-Sum Partitions for 18 Rounds of Keccak-f
Zero-Sum Partitions for 19 Rounds of Keccak-f
Zero-Sum Partitions for 20 Rounds of Keccak-f
Application to the Hamsi-256 Finalization Permutation
Conclusions
References
Attacks on Hash Functions Based on Generalized Feistel: Application to Reduced-Round Lesamnta and SHAvite-3_ 512
Introduction
Overview of the Attacks
Our Results
The Cancellation Property
Generic Properties of Fi(Xi) = F(Ki ? Xi)
Using the Cancellation Property
Application to Lesamnta
Previous Results on Lesamnta
Generic Attacks
Dedicated 24-Round Attacks on Lesamnta
Application to SHAvite-3_512
A Short Description of SHAvite-3_512
Cancellation Attacks on SHAvite-3_512
Dealing with the Key Expansion
9-Round Attacks
References
The Differential Analysis of S-Functions
Introduction
S-Functions
Computation of xdp+
Introduction
Defining the Probability xdp+
Constructing the S-Function for xdp+
Computing the Probability xdp+
Minimizing the Size of the Matrices for xdp+
Extensions of xdp+
Computation of adp ?
Introduction
Defining the Probability adp ?
Constructing the S-Function for adp ?
Computing the Probability adp ?
Counting Possible Output Differences
Introduction
Algorithm with a Exponential Time in n
Algorithm with a Linear Time in n
Computing the Number of Output Differences xdc+
Calculation of adc ?
Conclusion
References
Stream Ciphers
Hill Climbing Algorithms and Trivium
Introduction
Hill Climbing Algorithms
Trivium System as an Optimization Problem
Properties of Trivium Landscapes
Trivium Systems and NK-Landscapes
Landscape Auto-correlation
Solving Trivium Systems with Modified Simulated Annealing
Experimental Results
Some Variations
Conclusions and Future Directions
References
Discovery and Exploitation of New Biases in RC4
Introduction
Description of RC4
Known Correlations in the PRGA of RC4
Visual Representation of Correlations in the PRGA
Spectral Approach to Derive New Biases
Binding PRGA and KSA Weaknesses
Known Binding between KSA and PRGA Weaknesses
Binding New PRGA Bias Where S'i[j'i] Is Involved
Exploiting Additional Biased Linear Correlations in the PRGA
RC4 as a Black Box
Maitra and Paul Correlation
Discovering New Linear Correlations in RC4
Key Recovery Attacks
Theoretical Key Recovery Attack on Plain RC4
Practical Key Recovery Attack on WEP
Theoretical Key Recovery Attacks on WPA
Conclusion
References
The Stafford Tavares Lecture
The Rise and Fall and Rise of Combinatorial Key Predistribution
Introduction
The Rise and Fall of Combinatorial Key Predistribution
Evolving Network Security
A Key Establishment Framework
The Second Rise of Combinatorial Key Predistribution
Research Directions
References
Efficient Implementations
A Low-Area Yet Performant FPGA Implementation of Shabal
Introduction
Shabal and Shift Registers
The Shabal Hash Algorithm
The Xilinx SRL16 Shift Register Primitive
Adapting Shabal to Use Shift Registers
Scheduling of a Shabal Message Round
FPGA Implementation
Overall Architecture
Control Logic
Technology Mapping
Benchmarks and Comparisons
Place-and-Route Results
Against Other Shabal Implementations
Against Implementations of the Other SHA-3 Candidates
Conclusion
References
Implementation of Symmetric Algorithms on a Synthesizable 8-Bit Microcontroller Targeting Passive RFID Tags
Introduction
Description of the Synthesizable 8-Bit Microcontroller
Overview of the Selected Cryptographic Algorithms
Implementation Results
AES-128
SEA
Present-80
XTEA
Trivium
Summary of Implementation Results
Discussing the Costs of Integrating the Implemented Algorithms on Passive RFID Tags
Conclusion
References
Batch Computations Revisited: Combining Key Computations and Batch Verifications
Introduction
Preliminaries
Probabilities
Key Establishment Schemes
ECDSA and the Modified Signature Scheme ECDSA*
Accelerated Authenticated Key Agreement
Static-ECDH with ECDSA*Signatures
Extension of Results to ECDSA
Conclusions
References
Coding and Combinatorics
Wild McEliece
Introduction
The McEliece Cryptosystem
Goppa Codes
Wild McEliece
Decrypting Wild-McEliece Ciphertexts
Attacks
Parameters
References
Parallel-CFS Strengthening the CFS McEliece-Based Signature Scheme
The Original CFS Signature Scheme
The Niederreiter Encryption Scheme
The CFS Signature Scheme
Existing Attacks - One Out of Many Syndrome Decoding
Parallel-CFS: Cost and Gain
Description of Parallel-CFS
Cost of Parallel-CFS
Gain of Parallel-CFS
Parameter Selection
Signature Size
Parameter Examples
Hiding the Structure in Parallel-CFS?
Conclusion
References
A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem
Introduction
Code-Based Cryptography
Definitions
SD and G-SD Identification Schemes
Attacks
An Identification Scheme Based on qSD
Key Generation
Identification Protocol
Properties and Security of the Scheme
Zero-Knowledge-Proof
Security and Parameters
Comparison with Other Schemes
Reducing Public Key Size
Conclusion
References
Optimal Covering Codes for Finding Near-Collisions
Introduction
Collisions and Near-Collisions of Hash Functions
Memoryless Near-Collisions Based on Coding Theory
Direct Sum Constructions of Covering Codes
The Optimal Solution for Problem 1
Conclusion
References
Block Ciphers
Tweaking AES
Introduction
Efficiency and Security of AES
xAES - A New and Improved AES
Methods to Improve the Key Schedule of AES
Specification of xAES
Security Analysis of xAES
Efficiency of xAES
Conclusion
References
On the Diffusion of Generalized Feistel Structures Regarding Differential and Linear Cryptanalysis
Introduction
Preliminaries
Target Structures
Definitions
Properties of Generalized Feistel Structures
Related Work
Differential Active S-Boxes in GFS
The Lower Bounds for Four and Six Rounds of GFS^std_d
The Search for the Minimum Number of Differential Active S-Boxes
Detailed Explanation of the Algorithm
Comparison of Results
Linear Active S-Boxes in GFS
Discussion
Conclusion
References
A 3-Subset Meet-in-the-Middle Attack: Cryptanalysis of the Lightweight Block Cipher KTANTAN
Introduction
Framework for MITM Attacks
Basic MITM Attack
The 3-Subset MITM Approach
A Short Description of KTANTAN
Round Transform
Key Schedule
Low Data-Complexity Attacks on KTANTAN
Related-Key Differentials of Probability 1
Application of the MITM Framework to KTANTAN
Partial-Matching Phase
Discussion and Future Work
References
Side Channel Attacks
Improving DPA by Peak Distribution Analysis
Introduction
SCA Security Metrics
Success Rate and Guessing Entropy
Sorting Key Candidates
The oth-Order Guessing Entropy Security Metric
The EDPA Attack
Description of the Attack
Evaluating ECPA Using Simulation
Simulation Setup
Comparing ECPA and CPA on DES
Comparing ECPA and CPA on AES
Evaluating ECPA Using Physical Experiments
Attacking a Hardware DES Implementation
Attacking a Software AES Implementation
Conclusion
References
Affine Masking against Higher-Order Side Channel Analysis
Introduction
Securing AES with Affine Masking
Affine Masking Applied to AES
Time-Memory Trade-Offs
Implementation Results
Resistance to Higher-Order SCA
Leakage of Affine Masking
Information Theoretic Evaluation
Higher-Order DPA Evaluation
Attack Experiments
Conclusion
References
Invited Talk
Search on Encrypted Data in the Symmetric-Key Setting
Mathematical Aspects
Preimages for the Tillich-Z´emor Hash Function
Introduction
Preliminaries
The Tillich-Zémor Hash Function
Notations
Grassl et al.'s Collision Algorithm
Maximal Length Sequences in the Euclidean Algorithm in F2[X]
Ideas behind Our Algorithms
Second Preimages for Tillich-Zémor Hash Function
Preimage Algorithm from a Few Precomputed Preimages
First Precomputing Algorithm
Mesirov and Sweet's Algorithm for $a=pp'$
Correctness of the Algorithm
Second Precomputing Algorithm
Discussion
References
One-Time Signatures and Chameleon Hash Functions
Introduction
Our Contribution
Preliminaries
Collision and Target Collision Resistance
Chameleon Hash Functions
Security Definitions for Signature Schemes
One-Time Signatures from Chameleon Hash Functions
A suf-ama Signature Scheme
A Strongly Unforgeable uf-cma Scheme
Instantiations Based on Standard Assumptions
A Construction Based on the Factoring Assumption
A Construction from Lattice-Based Assumptions
References
On the Minimum Communication Effort for Secure Group Key Exchange
Introduction
Preliminaries
Lower Bounds on the Communication Effort
The Proposed Protocol
Proof of Security
Conclusion
References
Hash Functions II
Deterministic Differential Properties of the Compression Function of BMW
Introduction
Description of BMW
Observations
The Security Parameter 0/16
The Security Parameter 1/15
Searching for Good Differences
The Security Parameter 2/14
Potential Applications
Conclusion
References
Security Analysis of SIMD
Introduction
Brief Description of SIMD
A Distinguisher for the Compression Function of SIMD
Building the Symmetric Messages
Symmetry Property on the Compression Function
Non-ideality of the Compression Function
Impact of the Symmetry-Based Distinguisher
Free-Start Distinguishers, Non-ideal Compression Functions and Wide-Pipe Designs
Deterministic Distinguishers for the Compression Function
Adapting the Indifferentiability Proof to Non-ideal Compression Functions
On Differential Attacks against SIMD
Modeling Differential Paths
The Message Expansion
Structure of a Differential Path
Heuristics
Upper Bounding the Probability of a Differential Path
References
Subspace Distinguisher for 5/8 Rounds of the ECHO-256 Hash Function
Introduction
Description of ECHO
The AES Block Cipher
The ECHO Hash Function
Improved Truncated Differential Analysis of ECHO
Sparse Truncated Differential Paths for ECHO
An Equivalent ECHO Round Description
SuperMixColumns
SuperBox
Expected Number of Pairs
Attacks on the ECHO-256 Hash Function
Subspace Distinguisher for 5 Rounds
Collisions for 4 Rounds
Conclusion
References
Cryptanalysis of Luffa v2 Components
Introduction
Description of Luffa
The Iteration
The Permutations
The Message Injection
Semi-Free-Start Collision on Luffa -256 for 7 Rounds
Outline of the Attack
Matching the Message Injection
Constructing Truncated Differential Paths
Rebound Attack on Luffa
The Inbound Phases
The Final Inbound Phase: Parallel Matching
Linear Solving for Pairs
The Outbound Phase
Building an 8-Round Distinguisher from the 7-Round Semi-Free-Start Collision
Distinguisher for 8 Rounds of the Permutation
The Differential Path
Changing the Parity of Differences
Changing Values without a Difference
Complete Distinguisher
Conclusion
References
Author Index

Systemvoraussetzungen

Als PDF speichern Als Link merken