Selected Areas in Cryptography - SAC 2018

Name: Selected Areas in Cryptography - SAC 2018 | 25th International Conference, Calgary, AB, Canada, August 15-17, 2018, Revised Selected Papers
Brand: Springer
Price: 53.49 EUR
Availability: OnlineOnly

25th International Conference, Calgary, AB, Canada, August 15-17, 2018, Revised Selected Papers

Carlos Cid Michael J. Jacobson Jr.(Herausgeber*in)

Springer (Verlag)

Erschienen am 12. Januar 2019

XI, 499 Seiten

E-Book

PDF mit Wasserzeichen-DRM

Systemvoraussetzungen

978-3-030-10970-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

Intro
Preface
Organization
Contents
Design of Symmetric Key Primitives
Targeted Ciphers for Format-Preserving Encryption
1 Introduction
2 Preliminaries
3 Targeted Swap-or-Not
4 Mix-Swap-Unmix
A Analyzing a Matching Exchange Process
B Game for Proof of Theorem2
References
Variants of the AES Key Schedule for Better Truncated Differential Bounds
1 Introduction
2 Background
3 Generic Bounds
4 Searching for a Permutation
4.1 Bound on 5 Rounds
4.2 Finding a Permutation over 6 Rounds
5 Tweaking both ShiftRows and the Key Schedule
6 Conclusion
A Modelizing the MC Equations in Constraint Programming
B Number of Cycles to Build a Permutation Reaching 18 S-Boxes over 5 Rounds
C Generic Simulated Annealing Algorithm
D Proof of Proposition6
E Pairs (Ps,Pk) Reaching 21 Sboxes over 6 Rounds
References
Analysis and Improvement of an Authentication Scheme in Incremental Cryptography
1 Introduction
1.1 Contributions of the Paper
2 Preliminaries
2.1 Notations
2.2 Definitions
2.3 Description of the XOR-Scheme
3 Forgery Attacks Against the XOR-Scheme
4 Modification of the XOR-Scheme
5 Security Proof
6 Conclusion
A Appendix
References
Cryptanalysis of Symmetric Key Primitives
Integral Attacks on Round-Reduced Bel-T-256
1 Introduction
2 Bit-Based Division Property
2.1 MILP Modeling for Propagation Rules of the Bit-Based Division Property
3 Integral Attack on Bel-T-256
3.1 Bel-T Specification
3.2 Integral Distinguishers of Bel-T
3.3 Integral Cryptanalysis of 327-Round Bel-T-256
3.4 Integral Cryptanalysis of 3 67 -Round Bel-T-256
4 Conclusion
A Validation of the MILP Model for the Division Trail Through a Modular Subtraction Operation
B Division Trail Representation of Bel-T S-Box
References
Cryptanalysis of Reduced sLiSCP Permutation in Sponge-Hash and Duplex-AE Modes
1 Introduction
2 Specification of sLiSCP
2.1 sLiSCP Permutation
2.2 sLiSCP Mode for Hash Function and Authenticated Encryption
3 Differential Trail Search on sLiSCP
4 6-Steps Forgery in AE Mode
4.1 Forgery
4.2 Extension to State Recovery and Plaintext Recovery
5 6-Steps Collision Attacks in Hashing Mode
5.1 Overall: Four-Block Collision Strategy
5.2 Attack Procedure for sLiSCP-256
5.3 Attack Procedure for sLiSCP-192
6 15-Steps Rebound Attacks Against sLiSCP Permutation
6.1 Attack Procedure for sLiSCP-192
6.2 Attack Procedure for sLiSCP-256
7 Concluding Remarks
A Appendix
References
Finding Integral Distinguishers with Ease
1 Introduction
2 Division Property and Division Trails
2.1 Background
2.2 Formalism of Bit-Based Division Properties
2.3 Rules of Choice Vector Propagation
3 Solvatore - Automated Finding of Integral Properties
3.1 Modeling Division Property Propagation with SAT
3.2 Finding Integral Distinguishers
4 Distinguishers and Bounds
4.1 Methodology
4.2 SPN
4.3 ARX
4.4 Feistel
4.5 Reflection
4.6 Bit-Sliced
4.7 LFSR-Based
4.8 Overview
5 Conclusion and Future Work
A Implementation of Present
B Overview of Distinguishers
B.1 ChaCha
B.2 Chaskey
B.3 DES
B.4 GIFT-64
B.5 LBlock
B.6 Mantis
B.7 QARMA
B.8 RoadRunner
B.9 Salsa
B.10 SM4
References
Towards Key-Dependent Integral and Impossible Differential Distinguishers on 5-Round AES
1 Introduction
1.1 Background
1.2 Contributions
1.3 Outline of This Paper
2 Preliminaries
2.1 Notations
2.2 Description of AES
2.3 Previous Integral and ID Distinguishers on 5-Round AES
3 Improved Integral Distinguishers on AES
3.1 Improved Key-Dependent Integral Distinguisher on 5-Round AES
3.2 Gap for Complexities Between Chosen-Plaintext and Chosen-Ciphertext Integral Distinguishers
4 ID Distinguishers on 5-Round AES Under Chosen-Ciphertext Setting
4.1 ID Distinguisher on 5-Round AES Based on Property 1 of MC
4.2 ID Distinguisher on 5-Round AES Based on Property 2 of MC
5 Conclusions
A Property2 and Key-Dependent Integral Distinguisher
B Algorithm of 5-Round ID Distinguisher Under Chosen-Ciphertext Model Based on Property 2
C Gap Between Complexities of Chosen-Plaintext and Chosen-Ciphertext ID Distinguishers
D Figures of the Distinguisher Introduced in Sect.2
References
Mind the Gap - A Closer Look at the Security of Block Ciphers against Differential Cryptanalysis
1 Introduction
2 Differentials and Differential Characteristics
3 Finding Differential Characteristics Efficiently
3.1 SAT/SMT Solvers
3.2 From Differential Cryptanalysis to Satisfiability Modulo Theories
3.3 Finding the Best Characteristics and Differentials
4 Analysis of the Gap in Lightweight Ciphers
4.1 Designs Strategies
4.2 Skinny
4.3 Midori
4.4 Sparx
4.5 Results for Other Lightweight Ciphers
4.6 Application of the Differential Gaps to the Best Published Differential Attacks
5 Experimental Verification and the Influence of Keys
5.1 Skinny
5.2 Speck
5.3 Midori
6 Conclusions
A Detailed Data for Midori, Skinny and Sparx
B Differentials for Midori, Skinny and Sparx
References
Side Channel and Fault Attacks
Sliding-Window Correlation Attacks Against Encryption Devices with an Unstable Clock
1 Introduction
1.1 Background
1.2 Power Traces Alignment: Assumptions and Counter-Measures
1.3 Anti-counter-measures Approaches to Trace Misalignment
1.4 Contributions and Structure
2 The Effect of an Unstable Clock on Standard Attacks
2.1 Unstable CPU Clock and Time Domain Hiding Analysis
2.2 Sliding Window CPA Attack on Jittered CPU Clocks
2.3 Basic Correlation Analysis of Sliding-Window Integration
3 A New Analysis of Multiple Leakage Samples Integration
3.1 The Correlation Coefficient When Integrating Within a Trace
3.2 Correlation Coefficient Amplification
3.3 The Correlation Coefficient for Specific r and q Relationships
3.4 The Correlation Coefficient with an Unstable Clock
3.5 The Correlation Coefficient with an Unbounded Jitter
4 Experiments and Results
4.1 Setup and Measurements
4.2 Jitter Modeling
4.3 Validating Leakage Points' Power Consumption Correlation
5 Evaluating the SW-CPA Attack
5.1 Amplification for Different Aggregation Window Sizes
5.2 Selecting a Window Size r for All Key Bytes
5.3 Correct Key Byte Identification Metric
5.4 Comparing SW-CPA with Other Known Methods
6 Conclusions
References
Assessing the Feasibility of Single Trace Power Analysis of Frodo
1 Introduction
2 Preliminaries
2.1 Frodo: A LWE-Based Key Agreement Protocol/KEM
2.2 Template Attacks
2.3 Experimental Setup
3 Divide-and-Conquer Template Attack
4 Extend-and-Prune Template Attack
5 Learning the Lesson: How to Thwart Extend-and-Prune
A ARM Assembly Code for Inner Product
References
Cache-Attacks on the ARM TrustZone Implementations of AES-256 and AES-256-GCM via GPU-Based Analysis
1 Introduction
1.1 Motivation
1.2 Related Work
1.3 Contributions
2 Preliminaries
2.1 ARM TrustZone Overview
2.2 Keystore and Keymaster Hardware Abstraction Layer (HAL)
2.3 Samsung's Keymaster HAL and Trustlet
2.4 Attack Model
3 Cache Attacks Against the Keymaster AES
3.1 Overview
3.2 Calibrating the Probe Measurement Threshold
3.3 The Analysis Stage for AES-128 Attacks
3.4 AES-256 Attacks
3.5 Galois Counter Mode (GCM) Attacks
4 Analysis Acceleration Using a GPU with OpenCL
4.1 Overview
4.2 Programming the GPU
4.3 Using the GPU in the Attacks
4.4 Kernel Implementation Details
5 Conclusions
A OpenCL Kernels Code
A.1 Thresholding Kernel
A.2 Round Two Kernel
A.3 Round to Hit Matrix Kernel
A.4 Axis Sum Kernel
References
Fault Attacks on Nonce-Based Authenticated Encryption: Application to Keyak and Ketje
1 Introduction
2 Background
2.1 Fault Attacks
2.2 Statistical Ineffective Fault Attacks
2.3 Authenticated Encryption
3 Keyak and Ketje
3.1 Keccak
3.2 Keyak
3.3 Ketje
4 Attack Strategy
4.1 Involved Bits in Keyak
4.2 Recovered Bits
5 Practical Evaluation
5.1 Attack Procedure
5.2 Attack Setup
5.3 Attack Setup - Requirements
5.4 Results
6 Conclusion
A Bits Involved in the Calculation for Ketje Jr
B Equations to Calculate A2[0,0,0]
References
Post-Quantum Cryptography
EFLASH: A New Multivariate Encryption Scheme
1 Introduction
1.1 Recent History of Multivariate Encryption
1.2 Our Contribution
1.3 Organization of Paper
2 Big Field Schemes
2.1 C*
2.2 PFLASH
2.3 HFE
3 Cryptanalyses of Big Field Schemes
3.1 MinRank
3.2 Differential Techniques
3.3 Algebraic Attacks
4 Description of EFLASH
4.1 Algebraic Structure
4.2 Encryption and Decryption
4.3 Decryption Failure Rate
5 Resistance to Known Attacks
5.1 Algebraic Attack
5.2 MinRank Attack
5.3 Discrete Differential Attack
6 Parameter Selection
7 Conclusion
A Toy Example
A.1 Public and Private Key Generation
A.2 Encryption and Decryption
References
Public Key Compression for Constrained Linear Signature Schemes
1 Introduction
2 Preliminaries
3 Trapdoor-Based Signature Schemes
3.1 MQ Trapdoors
3.2 Code-Based Trapdoors
3.3 Lattice-Based Trapdoors
3.4 A Unifying View
3.5 Additional Security Properties
4 Construction
4.1 Description
4.2 Security
4.3 Applying the Transformation
5 Conclusion
A CFS Parameters
References
On the Cost of Computing Isogenies Between Supersingular Elliptic Curves
1 Introduction
2 Computational Supersingular Isogeny Problem
2.1 Mathematical Prerequisites
2.2 Vélu's Formula
2.3 SIDH
2.4 CSSI
3 Meet-in-the-Middle
3.1 Basic Method
3.2 Depth-First Search
3.3 Implementation Report
4 Golden Collision Search
4.1 Van Oorschot-Wiener Parallel Collision Search
4.2 Finding a Golden Collision
4.3 The Attack
4.4 Implementation Report
5 Comparisons
5.1 Meet-in-the-Middle
5.2 Golden Collision Search
5.3 Mesh Sorting
5.4 Targetting the 128-Bit Security Level
5.5 Targetting the 160-Bit Security Level
5.6 Targetting the 192-Bit Security Level
5.7 Resistance to Quantum Attacks
5.8 SIDH Performance
6 Concluding Remarks
References
Lattice-Based Cryptography
A Full RNS Variant of Approximate Homomorphic Encryption
1 Introduction
2 Background
2.1 Approximate Homomorphic Encryption
2.2 The RNS Representation
2.3 Fast Basis Conversion
3 Approximate Bases and Full RNS Modulus Switching
3.1 Approximate Basis
3.2 Approximate Modulus Switching
4 A Full RNS Variant of the Approximate HE
5 Software Implementation
5.1 Parameter Sets and Benchmark
5.2 Homomorphic Evaluation of Statistical and Analytic Functions
5.3 Homomorphic Training of Logistic Regression Model
6 Conclusions and Future Work
A Correctness and Noise Estimation
A.1 Approximate Modulus Switching
A.2 Homomorphic Operations
B List of Primes
References
Analysis of Error-Correcting Codes for Lattice-Based Key Exchange
1 Introduction
2 NewHope Simple
2.1 Notation
2.2 Protocol
2.3 Security of NewHope Simple
2.4 Noise Sources of the Protocol
3 Failure Rate of NewHope Simple
3.1 Mathematical Operations with Random Variables
3.2 Probability Distributions of Difference and Compression Noise
3.3 From the Noise Distribution to the Failure Rate
4 Error-Correcting Codes
4.1 Modern and Classical Error-Correcting Codes
4.2 BCH Codes
4.3 LDPC Codes
4.4 Error-Correcting Codes for NewHope Simple
5 Experimental Results
5.1 NewHope Simple Compression Noise
5.2 NewHope Simple with BCH Code
5.3 NewHope Simple with LDPC Code
5.4 NewHope Simple with Concatenation of BCH and LDPC Code
5.5 Comparison Coding Options
5.6 Benchmark
6 Conclusion and Future Work
A NewHope Simple Algorithms NHSEncode and NHSDecode
B Proof Theorem 3
C Noise Distribution
D Validation of Failure Rate Analysis
References
Provably Secure NTRUEncrypt over Any Cyclotomic Field
1 Introduction
1.1 Our Contributions
1.2 Technique Overview
1.3 Organization
2 Preliminaries
2.1 Notations
2.2 Cyclotomic Fields, Space H and Geometry
2.3 Lattice and Discretization
2.4 Gaussian and Subgaussian Random Variables
2.5 Basis for R and R, Ring-LWE problem
3 Some New Results on q-Ary Lattices
3.1 q-Ary Lattices
3.2 Lower Bound of 1 in L(a, I)
3.3 Improved Results on Regularity
4 Analysis of Key Generation Algorithm
5 NTRUEncrypt Scheme and Security Analysis
A Missing Proofs in Sect.4
B Module NTRUEncrypt
B.1 Basic Hard Problems
B.2 Modified Module NTRUEncrypt
C Proof of Lemma16
References
Classical Public Key Cryptography
A Generalized Attack on Some Variants of the RSA Cryptosystem
1 Introduction
2 Preliminaries
2.1 LUC Cryptosystem
2.2 RSA Type Schemes Based on Singular Cubic Curves
2.3 RSA with Gaussian Primes
2.4 Coppersmith's Method
3 The Attack
4 Comparison with Existing Results
5 Conclusion
References
Injective Encodings to Binary Ordinary Elliptic Curves
1 Introduction
2 Background
2.1 Elliptic Curves
2.2 Encoding into Elliptic Curves
2.3 Injective Functions from Bit Strings to F2n
3 Injective Encoding to Binary Elliptic Curves
3.1 Encoding into Hessian Curves
3.2 Injective Encoding to Binary Elliptic Curves with Tr(a)=1.
3.3 Injective Encoding to Binary Elliptic Curves with Tr(a+1)=0
4 Concluding Remarks
References
Machine Learning and Cryptography
Unsupervised Machine Learning on Encrypted Data
1 Introduction
1.1 Motivation
1.2 Contribution
2 Related Work
3 Preliminaries
3.1 The K-Means Algorithm
3.2 Encoding
3.3 FHE Library Choice
3.4 Datasets
4 Approach 1: Implementing the Exact K-Means-Algorithm
4.1 FHE Challenges
4.2 The Distance Metric
4.3 Fractional Encoding
4.4 Evaluation
4.5 Conclusion
5 Approach 2: The Stabilized K-Means-Algorithm
5.1 Encoding
5.2 The Algorithm
5.3 Evaluation
6 Approach 3: The Approximate Version
7 Implementation Results
7.1 Runtimes for the Entire Algorithm on a Single Core
7.2 Further Speedup
A Supplementary Material for the K-Means-Algorithm
A.1 Visualization of the K-Means-Algorithm
A.2 Pseudocode
B Operations for Fractional Encoding
C Details of the Approximate Algorithm
C.1 The Algorithm
C.2 Evaluation
References
Profiled Power Analysis Attacks Using Convolutional Neural Networks with Domain Knowledge
1 Introduction
1.1 Contributions
2 Preliminaries
2.1 Profiled Side-Channel Analysis
2.2 Neural Networks and Deep Learning
3 Convolutional Neural Networks
3.1 Core Constructions
3.2 Principal Architecture
3.3 CNNs with Domain Knowledge Neurons
4 Experiments
4.1 Baseline
4.2 Methodology
4.3 Results for Unprotected Hardware Implementation
4.4 Results for Protected Software Implementation
5 Conclusion
A Network Parameters
References
Author Index

Systemvoraussetzungen

Als PDF speichern Als Link merken