Selected Areas in Cryptography

Name: Selected Areas in Cryptography | 18th International Workshop, SAC 2011, Toronto, Canada, August 11-12, 2011, Revised Selected Papers
Brand: Springer
Price: 53.49 EUR
Availability: OnlineOnly

18th International Workshop, SAC 2011, Toronto, Canada, August 11-12, 2011, Revised Selected Papers

Ali Miri Serge Vaudenay(Herausgeber*in)

Springer (Verlag)

1. Auflage

Erschienen am 21. Februar 2012

XIII, 431 Seiten

E-Book

PDF mit Wasserzeichen-DRM

Systemvoraussetzungen

978-3-642-28496-0 (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
Preface
SAC 2011
Table of Contents
Selected Areas in Cryptography 2011
Cryptanalysis of Hash Functions
Boomerang Distinguishers on MD4-Family: First Practical Results on Full 5-Pass HAVAL
Introduction
Preliminaries
Specification of HAVAL
Technical Terminologies
Related Work
Boomerang Attack
Boomerang Distinguishers for Hash Functions
Boomerang on Encryption Modes of MD4, MD5, and HAVAL
Summary of Boomerang Attack on Hash Function
Message Differences (M)
Differential Paths and Sufficient Conditions (DP)
Contradiction between Two Paths (CP)
Message Modification (MM)
Amplified Probability (AP)
4-Sum Distinguisher on 5-Pass HAVAL
Proving Flaw of Previous Differential Path
Constructing New Differential Paths
Attack Procedure
Experimental Results
Concluding Remarks
References
Improved Analysis of ECHO-256
Introduction
ECHO-256 Description
Alternative Description
Attack on the 5-Round ECHO-256 Hash Function
The Truncated Differential Path
Colliding Subspace Differences
High-Level Outline of the Attack
Details of the Attack
Distinguisher on the 7-Round ECHO-256 Compression Function
Finding Pairs between S6 and S23
Finding Pairs between S30 and S47
Merging Solutions
Conclusions
References
Provable Chosen-Target-Forced-Midfix Preimage Resistance
Introduction
Preliminaries
Chosen-Target-Forced-Midfix Preimage Resistance
Salted-Chosen-Target-Forced-Midfix Preimage Resistance
CTFM Resistance of Merkle-Damgård Design
Proof of Thm. 1
On Optimally CTFM Resistant Iterated Hash Functions
Conclusions
References
Security in Clouds
On CCA-Secure Somewhat Homomorphic Encryption
Introduction
Notation and Standard Definitions
The Smart-Vercauteren Variant of Gentry's Scheme
CCA1 Attack on the Gentry-Halevi Variant
ccSHE is PA-1
ccSHE Is Not Secure in the Presence of a CVA Attack
CCA2 Somewhat Homomorphic Encryption?
References
Efficient Schemes for Anonymous Yet Authorized and Bounded Use of Cloud Resources
Introduction
Definition
Problem Description and Motivation
Definition of the Scheme
Security Model
Preliminaries
Scheme
Interactive Update of Signed Messages
High Level Description of the First Scheme
Detailed Description of the First Scheme
A Modified Scheme Providing Even More Privacy
Performance Evaluation
Extensions and System Issues
Security Analysis
Conclusion
References
Invited Paper I
Group Law Computations on Jacobians of Hyperelliptic Curves
Introduction
Background
Computations in the Mumford Function Field
Generating Explicit Formulas in Genus 2
General Divisor Addition in Genus 2
General Divisor Doubling in Genus 2
Comparisons of Formulas in Genus 2
The General Description
Composition for g = 2
Handling Special Cases
Reduction in Low Genera
Further Implications and Potential
Conclusion
References
Bits and Randomness
Cryptographic Analysis of All 4 × 4-Bit S-Boxes
Introduction
S-Box Properties
Equivalence Classes and Canonical Representation
An Exhaustive Search Over All PE Classes
The Search Algorithm
Results of the Exhaustive Search
Golden S-Boxes
Conclusions
References
The Cryptographic Power of Random Selection
Introduction
The Approach
On Computing a Weak Solution
On Computing a Strong Solution from the Unique Weak Solution
Experimental Results
Discussion
References
Proof of Empirical RC4 Biases and New Key Correlations
Introduction
Proofs of Recent Empirical Observations
Bias at Specific Initial Rounds of PRGA
Biases at All Initial Rounds of PRGA (Round-Independent)
Biases at All Initial Rounds of PRGA (Round-Dependent)
Biases Based on Keylength
Dependence of Conditional Biases on RC4 Secret Key
Proof of Keylength-Dependent Conditional Biases
Keylength Prediction from Keystream
Conclusion
References
Cryptanalysis of Ciphers I
Combined Differential and Linear Cryptanalysis of Reduced-Round PRINTcipher
Introduction
ThePRINTcipher Encryption Algorithm
Notation
PRINTcipher
Key Dependent Differential and Linear Characteristics
Differential and Linear Properties of the S-Box
Characteristics for 0.036% of the Keys of PRINTcipher-48
KeyRecovery
An Attack on 31-Round PRINTcipher-48 for KS4
An Attack on 29-Round PRINTcipher-48 for KS1
Conclusion
References
Practical Attack on the Full MMB Block Cipher
Introduction
Description of the Block Cipher MMB
Sandwich Attack
Boomerang Attack
Sandwich Attack
Practical Sandwich Attack on the Full MMB
5-Round Sandwich Distinguisher with Probability 1
The Key Recovery Attack
Experimental Results
Rectangle-Like Sandwich Attack on MMB
5-Round Rectangle-Like Sandwich Distinguisher
The Key Recovery Attack
The Improved Differential Cryptanalysis of MMB
Improved Differential Attack on the Full MMB
Differential Attack of MMB+
Conclusion
References
Conditional Differential Cryptanalysis of Trivium and KATAN
Introduction
Review of Conditional Differential Cryptanalysis
Conditional Differential Cryptanalysis
Automatic Strategies for Analyzing the Conditions
Related-Key Attacks for Reduced KATAN
Description of KATAN
Basic Analysis Strategy
Analysis of KATAN32
Summary of Results
Weak Keys for Reduced Trivium
Description of Trivium
Basic Strategy of Analysis
Choosing the Differences
Analysis of Conditions
Classes of Weak Keys
Conclusion
References
Cryptanalysis of Ciphers II
Some Instant- and Practical-Time Related-Key Attacks on KTANTAN32/48/64
Introduction
KTANTAN
On Bit Ordering and Test Vectors
(Truncated) Differentials
A Previous Result on KTANTAN
Reformulating the Attack
Related-Key Attacks on KTANTAN32
On the Bad Mixing of k32
The General Attack Idea
A First Approach: Finding 28 Bits of the Key
Making It Faster
Using One Ciphertext and Two Plaintexts
Going in Both Directions for a Practical-Time Key-Recovery
Minimizing the Data Complexities
Attacking KTANTAN48 and KTANTAN64
Possible Improvements
Comparison to Specification Claims
Conclusion
References
Analysis of the Initial and Modified Versions of the Candidate 3GPP Integrity Algorithm 128-EIA3
Introduction
Notation
Description of the 128-EIA3 Integrity Algorithms
An Existential Forgery Attack against 128-EIA3 v1.4
Description of the Substitution Attack
Partial Flaw in 128-EIA3 v1.4 Security Arguments
Sensitivity of 128-EIA3 v1.5 to Nonce Reuse
On the Independance of Universal Hashing Keys and Masking Values
On the Sliding Property of the Universal Hash Function of 128-EIA3
The IV Construction in 128-EIA-3 and Prevention of Nonce Reuse
Conclusion
References
New Insights on Impossible Differential Cryptanalysis
Introduction
Preliminaries
Notations
Previous Results and the Matrix Method
New Impossible Differentials
CAST-Like Ciphers
MARS-Like ciphers
A Larger Class of Impossible Differentials
Changes to the Matrix Method
A 7-Round Impossible Differentials for Feistel Block Ciphers with Small Differential Expansion Rate
New Attacks Using the New Impossible Differentials
Summary and Conclusions
References
Cryptanalysis of Public-Key Cryptography
A Unified Framework for Small Secret Exponent Attack on RSA
Introduction
Our Contributions
Preliminaries
The LLL Algorithm and Howgrave-Graham's Lemma
Small Inverse Problem BD00
Known Algorithms for Solving Small Inverse Problem
A New Proof for Bound of Blömer-May: d N0.290
A Set of Shift-Polynomials
Expansions of Shift-Polynomials
Deriving the Bound of Blömer-May: d N0.290
A Unified Framework for Solving Small Inverse Problem
A Set of Shift-Polynomials
Deriving a Condition for Solving Small Inverse Problem in Our Framework
Optimal Bound in Our Framework
A Hybrid Method
Extension to Cryptanalysis of Arbitrary Y=e
Concluding Remarks
References
Cipher Implementation
Very Compact Hardware Implementations of the Blockcipher CLEFIA
Introduction
128-bit Blockcipher CLEFIA
Algorithm
Previous Hardware Implementations
Proposed Architectures
Matrix Multiplier
Type-I Architecture
Type-II Architecture
Type-III Architecture
Supporting Decryption
Implementation Results
Conclusion
References
Invited Paper II
Another Look at Tightness
Introduction
MACs in the Multi-user Setting
Security Definition
Reductionist Security Proof
An Attack on MAC*
Analysis of Attack 1
Fixes
NetAut
Network Authentication
A Concrete Analysis
A Fix
Aggregate MAC Schemes
Aggregate MAC Schemes
Aggregate Designated Verifier Signatures
Symmetric-Key Encryption in the Multi-user Setting
Deterministic Authenticated Encryption
Authenticated Encryption
Disk Encryption
Stream Ciphers
Concluding Remarks
References
New Designs
Duplexing the Sponge: Single-Pass Authenticated Encryption and Other Applications
Introduction
Modeling Authenticated Encryption
Intermediate Tags and Authenticated Encryption of a Sequence
Security Requirements
An Ideal System
The Sponge Construction
Definition
Security
Implementing Authenticated Encryption
The Duplex Construction
The Authenticated Encryption Mode SpongeWrap
Definition
Security
Advantages and Limitations
An Application: Key Wrapping
Other Applications of the Duplex Construction
A Reseedable Pseudo-random Bit Sequence Generator
The Mode Overwrite
A Flexible and Compact Padding Rule
References
Blockcipher-Based Double-Length Hash Functions for Pseudorandom Oracles
Introduction
Preliminaries
Blockcipher-Based Double-Length Hash Functions for PROs
Step 1
Step 2
Step 3
Conclusion
References
ASC-1: An Authenticated Encryption Stream Cipher
Introduction
ASC-1 Specification
Authenticated Encryption Based on Leak-Safe AXU (LAXU) Hash Functions
Security of ASC-1
The Information-Theoretic Case
Computational Security Analysis of ASC-1
Conclusions
References
Mathematical Aspects of Applied Cryptography
On Various Families of Twisted Jacobi Quartics
Introduction
JacobiQuartics
Curve Equation
Representability
(2, 2) Jacobi Quartics
Curve Equation
Representability
(2)-Jacobi Quartics
Curve Equation
Representability
Asymptotic Count of Various Elliptic Curve Models
Statistics for the Frobenius Modulo 4
Summary of Quadrics Intersections
References
Improved Three-Way Split Formulas for Binary Polynomial Multiplication
Introduction
Review of 3-Way Splitting Methods for Polynomial Multiplication
General Approach to Design 3-Way Split Multiplier
Bernstein's 3-Way Split Formula
Asymptotic Complexity of the Bernstein Method
Three-Way Formulas Based on Field Extension
Explicit 3-Way Splitting Formulas
Complexity Evaluation
Delay Evaluation
Complexity Comparison and Conclusion
References
Sublinear Scalar Multiplication on Hyperelliptic Koblitz Curves
Introduction
Hyperelliptic Koblitz Curves
Multi-base Number Systems
A Sublinear Divisor Multiplication Algorithm Using Triple-Base Expansions
A Practical Scalar Multiplication Algorithm Using Double-Base Expansion
Conclusion and Future Work
References
Faster Hashing to G2
Introduction
Background
A Lattice-Based Method for Efficient Final Exponentiation
Exponentiation Examples
BN Curves
Freeman Curves
KSS-8 Curves
KSS-18 Curves
A Comparison with Scott et al.
A Lattice-Based Method for Hashing to G2
Hashing Examples
BN Curves
Freeman Curves
KSS-8
KSS-18
Comparison with Previous Work
Conclusion
References
Author Index

Systemvoraussetzungen

Als PDF speichern Als Link merken