Post-Quantum Cryptography
4th International Workshop, PQCrypto 2011, Taipei, Taiwan, November 29 - December 2, 2011, Proceedings
Published on 25. November 2011
X, 295 pages
978-3-642-25405-5 (ISBN)
Description
This book constitutes the refereed proceedings of the 4th International Workshop on Post-Quantum Cryptography, PQCrypto 2011, held in Taipei, Taiwan, in November/December 2011. The 18 revised full papers presented were carefully reviewed and selected from 38 submissions. The papers cover a wide range of topics in the field of post-quantum public key cryptosystems such as cryptosystems that have the potential to resist possible future quantum computers, classical and quantum attacks, and security models for the post-quantum era..
More details
Other editions
Additional editions
Bo-Yin Yang
Post-Quantum Cryptography
4th International Workshop, PQCrypto 2011, Taipei, Taiwan, November 29 - December 2, 2011, Proceedings
Book
11/2011
Springer
€53.49
Shipment within 7-9 days
Content
- Intro
- Title
- Organization
- Table of Contents
- General Fault Attacks on Multivariate Public Key Cryptosystems
- Introduction
- The Proposed Fault Attacks
- Multivariate Public Key Cryptosystems
- Basic Constructions of G
- Variations of Basic G
- Major Attacks
- The Proposed Fault Attacks on MPKCs
- Attack Model
- Fault Attacks on G
- Fault Attacks on r
- Countermeasures
- Conclusion
- References
- Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
- Introduction
- Isogenies
- Public-Key Cryptosystems Based on Supersingular Curves
- Key Exchange
- Public-Key Encryption
- Algorithmic Aspects
- Parameter Generation
- Key Exchange
- Isogenies of Montgomery Curves
- Security
- Complexity Assumptions and Security Proofs
- Hardness of the Underlying Assumptions
- Implementation Results and Example
- Example
- Conclusion
- References
- Full Cryptanalysis of the Chen Identification Protocol
- Introduction
- Basic Facts on Rank Distance
- Definitions and Notation
- Properties
- Codes for the Rank Distance
- Rank Distance and Cryptography
- The Chen Protocol
- Cryptanalysis
- Flaws in Chen's Zero-Knowledge Proof
- The Support Attack
- Linear Attack
- Countermeasures
- Defense against the Support Attack
- Defense against the Linear Attack
- A New Protocol
- Description of the Protocol
- Zero-Knowledge Properties
- Parameters, Improvements and Comparison
- Parameters
- Possible Improvements
- Comparison with Other Protocols
- Conclusion
- References
- Decoding One Out of Many
- Introduction
- The Decoding Problem in Cryptology
- Generic Decoding Algorithms
- Decoding One Out of Many Instances
- A Generalized Information Set Decoding Algorithm
- A Preview of the Analysis
- Links With the Other Variants of Collision Decoding
- Cost Estimation
- Lower Bound
- Some Numbers
- Variations with the Parameter p
- Decoding One Out of Many
- Cost of Linear Algebra
- Complexity Gain from Multiple Instances
- Unlimited Number of Instances
- Conclusion
- References
- On Provable Security of UOV and HFE Signature Schemes against Chosen-Message Attack
- Introduction
- Preliminaries
- Existing Schemes and Their Analyses
- UOV Signature Scheme
- HFE Signature Scheme
- Slightly Modified Schemes
- Modified UOV Signature Scheme
- Modified HFE Signature Scheme
- Extension for HFEV Signature Scheme
- Conclusions
- References
- Roots of Square: Cryptanalysis of Double-Layer Square and Square+
- Introduction
- Achievement and Organisation
- Notation
- Double-Layer Square
- MinRank Attack against Double-Layer Square
- Square+
- Odd-Characteristic HFE Attack against Square+
- Solving MinRank for Square+
- Conclusion
- References
- An Efficient Attack on All Concrete KKS Proposals
- Introduction
- Terminology and Notation
- The Kabatianskii-Krouk-Smeets Signature Scheme and Its Variant
- Description of the Attack
- An Auxiliary Code
- Finding Low-Weight Codewords
- Explaining the Success of the Attack
- Exploiting a Signature for Extracting the Private Key
- Analysis of the Attack
- Preliminaries about Random Codes
- Estimating the Complexity of Algorithm 1
- Number of Operations of One Iteration
- Experimental Results
- Concluding Remarks
- References
- XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions
- Introduction
- The eXtended Merkle Signature Scheme XMSS
- Security
- Forward Security
- Efficiency
- Implementation
- References
- On the Differential Security of Multivariate Public Key Cryptosystems
- Introduction
- Differential Symmetries and Invariants
- Properties of General Linear Symmetries
- Properties Relative to C* Monomials
- Symmetries for Non-permutation Polynomials
- Symmetries over Subspaces
- Conclusion
- References
- Implementation of McEliece Based on Quasi-dyadic Goppa Codes for Embedded Devices
- Introduction
- Background on the McEliece Cryptosystem
- Recommended Parameters and Key Sizes
- Goppa Codes
- Dyadic Goppa Codes
- Quasi-Dyadic Goppa Codes
- Scheme Definition of QD-McEliece
- Parameter Choice and Key Sizes
- Security of QD-McEliece
- Conversions for CCA2-Secure McEliece Variants
- Implementational Aspects
- Field Arithmetic
- Implementation of the QD-McEliece Variant
- Implementation of the KIC-
- Results
- Conclusion and Further Research
- References
- Efficient Threshold Encryption from Lossy Trapdoor Functions
- Introduction
- Related Work
- Our Contributions
- Preliminaries
- Tag-Based Encryption
- Secret Sharing
- Threshold Encryption
- Strongly Unforgeable One-Time Signature
- Main Construction
- Proof of Lemma 2
- Proof of Lemma 3
- Selective-Tag CCA Secure TBE
- Discussions and Comparisons
- References
- Monoidic Codes in Cryptography
- Introduction
- Coding Theory
- Quasi-monoidic Codes
- Monoidic Encryption and Signatures
- McEliece Encryption Scheme
- Parallel-CFS
- Security Assessment
- Parameters of Cryptographic Interest
- Efficiency
- References
- Simplified High-Speed High-Distance List Decoding for Alternant Codes
- Introduction
- Review of Fast Arithmetic
- Correcting Nearly $n$ Errors
- Correcting Nearly $n$ Errors
- Correcting More Errors
- Application to Classical Goppa Codes
- References
- Statistical Decoding of Codes over Fq
- Introduction
- Preliminaries and Notation
- Statistical Decoding
- Binary Statistical Decoding
- Statistical Decoding over Fq (for q & 2)
- Exploiting Additional Structure
- Experimental Results
- Comparison with ISD
- Conclusion
- References
- High-Speed Hardware Implementation of Rainbow Signature on FPGAs
- Introduction
- Background
- Definitions
- Overview of Rainbow Scheme
- Private Key.
- Public Key.
- Signature Generation.
- Signature Verification.
- Parameters of Rainbow Signature.
- Proposed Hardware Design for Rainbow Signature
- Overview of the Hardware Design
- Choice of Irreducible Polynomial for the Finite Field
- Efficient Design of Multiplication of Three Elements
- Efficient Design of Partial Multiplicative Inversion
- Optimized Gauss-Jordan Elimination
- Algorithm and Architecture.
- Pivoting Operation.
- Normalizing Operation.
- Eliminating Operation.
- Overall Optimization.
- Designs of Affine Transformations and Polynomial Evaluations
- Implementations and Experimental Results
- Overview of Our Implementation
- Implementation of Multiplier, Partial Inverter and LSEs Solver
- Implementation of Transformations and Polynomial Evaluations
- Comparison with Related Works
- Conclusions
- References
- Wild McEliece Incognito
- Introduction
- An Extra Shield for Wild Goppa Codes
- Attacks and Defenses
- Challenges
- Parameters
- References
- A New Spin on Quantum Cryptography: Avoiding Trapdoors and Embracing Public Keys
- References
- A Security Analysis of Uniformly-Layered Rainbow
- Introduction
- Birational Permutation Scheme
- Attack against Birational Permutation Scheme
- Sato-Araki Scheme
- Attacks against Sato-Araki Scheme
- Redefinition of HS Scheme
- Non-commutative Rings
- HS Scheme over L
- Security Analysis of HS Scheme
- Security against CSV Attack
- Security against Coppersmith's First Attack
- Security against Coppersmith's Second Attack
- Reduction of HS Scheme to Rainbow
- Original Rainbow and Its Analogue
- Reduction of HS Scheme to Rainbow
- Example of Reduction of HS Scheme
- Security Analysis for Attacks against Rainbow
- Efficiency of HS Scheme
- Efficiency in the Case of Group Ring of Dihedral Group
- Conclusion
- References
- Author Index
