Information Security and Cryptology – ICISC 2021: 24th International Conference, Seoul, South Korea, December 1–3, 2021, Revised Selected Papers (Lecture Notes in Computer Science, 13218)

This book constitutes selected papers from the 24 th International Conference on Information Security and Cryptology, ICISC 2021, held in Seoul, South Korea, in December 2021. The total of 23 papers presented in this volume were carefully reviewed and selected from 63 submissions. The papers are arranged by topic: Cryptographic Protocol in Quantum Computer Age; Security Analysis of Hash Algorithm; Security analysis of Symmetric Key Encryption Algorithm; Fault and Side-Channel Attack; Constructions and Designs; Quantum Circuit; Efficient Implementation. The aim of this conference was to provide an international forum for the latest results of research, development, and applications within the field of information security and cryptology. Preface Organization Contents Cryptographic Protocol I Revocable Hierarchical Identity-Based Authenticated Key Exchange 1 Introduction 1.1 Related Works 1.2 Our Contribution 1.3 Organization 2 Revocable Hierarchical Identity-Based Authenticated Key Exchange 2.1 RHIB-AKE Scheme 2.2 Security Model 3 Our RHIB-AKE Scheme 3.1 Preliminaries 3.2 RHIB-KEM 3.3 Construction 4 Instantiations 4.1 Construction of RHIB-KEM 4.2 Pairing-Based Instantiations 4.3 Lattice-Based Instantiations 5 Conclusion A Proof of Theorem 1 B Estimation References Towards Witness Encryption Without Multilinear Maps 1 Introduction 2 Preliminaries 3 Primitives of Witness Key Encapsulation Mechanism 4 Hidden Group with Hashing 4.1 Definitions 4.2 HiGH Knowledge Exponent Assumption (HiGH-KE) 4.3 HiGH Kernel Assumption (HiGH-Ker) 5 WKEM from HiGH 6 Our Instantiation of HiGH 6.1 Construction 6.2 Possible Attacks 6.3 Security Results 7 Conclusion References Cryptographic Protocol II Designated-Verifier Linkable Ring Signatures 1 Introduction 1.1 Related Work 1.2 Contribution 2 DVLRS Model 2.1 Notation and Assumptions 2.2 DVLRS Definition and Basic Properties 2.3 Adversarial Capabilities 2.4 Unforgeability 2.5 Anonymity 2.6 Linkability 2.7 Non-transferability 3 A DVLRS Construction 3.1 Setup 3.2 Signature 4 Security Analysis of Our Construction 4.1 Completeness 4.2 Unforgeability 4.3 Anonymity 4.4 Linkability 4.5 Non-transferability 5 Applications 6 Conclusion and Future Work References ATSSIA: Asynchronous Truly-Threshold Schnorr Signing for Inconsistent Availability 1 Introduction 1.1 Related Work and Motivation 1.2 Contributions 1.3 Organization of the Paper 2 Preliminaries 2.1 Communication and Adversary Model 2.2 Message Indexing 2.3 Cryptographic Assumptions 2.4 Threshold (t, n) Secret Sharing 2.5 Verifiable Threshold (t,n) Secret Sharing 2.6 The Schnorr Signature Scheme 2.7 Threshold Signatures Schemes 3 ATSSIA: Asynchronous Truly Threshold Schnorr Signatures for Inconsistent Availability 3.1 Overview 3.2 KeyGen 3.3 PreNonceGen 3.4 PartSign 3.5 Aggregate 3.6 Verify 3.7 Misbehaviour Detection 4 Proof of Security for ATSSIA 4.1 Proof of Correctness 4.2 Proof of EUF-CMA Security 5 Conclusion References Cryptographic Protocol in Quantum Computer Age Delegating Supersingular Isogenies over Fp2 with Cryptographic Applications 1 Introduction 2 Background 2.1 Elliptic Curves and Isogenies 2.2 Elliptic Curve Arithmetic 2.3 Security Model 2.4 Cryptographic Protocols and Difficulty Assumptions 3 Delegating Isogenies 3.1 Advertised Server Functionality 3.2 The Iso-Algorithm 4 Shrouding Isogenies 5 Delegation of Isogeny-Based Protocols 5.1 Key-Agreement Protocols 5.2 Identification Protocols and Signatures 6 Conclusion and Future Work References Improved Lattice-Based Mix-Nets for Electronic Voting 1 Introduction 2 Preliminaries 2.1 Notation 2.2 Splitting Rings 2.3 Ring-LWE Encryption, Module SIS/LWE 2.4 Challenge Space 2.5 Error Distribution and Rejection Sampling 2.6 Commitment Scheme 2.7 Generalized Schwartz-Zippel Lemma 2.8 Mix-Node Security 3 Improved Mix-Node 3.1 Non-interactivity and Proof Size 4 Implementation and Benchmarks 5 Conclusions and Further Work References Practical Post-quantum Password-Authenticated Key Exchange Based-on Module-Lattice 1 Introduction 1.1 Contributions 2 Preliminaries 2.1 Notations 2.2 The Decision Module-LWE Problem 2.3 Bellare-Pointcheval-Rogaway Security Model 2.4 Error Reconciliation Mechanism 3 MLWE-Based PWE Assumption and Security Reduction 4 Our MLWE-Based PAKE Scheme 4.1 Protocol Description 4.2 Correctness 5 Proof of Security 6 Implementation 6.1 Parameter Selection 6.2 NTT Domain 6.3 Hash Functions 6.4 Generation of A 6.5 Generation of Noise Polynomials 6.6 Encoding of Messages 7 Performance and Potential Applications 7.1 Comparison 7.2 Potential Applications 8 Conclusion References Security Analysis Improved Lattice Enumeration Algorithms by Primal and Dual Reordering Methods 1 Intruduction 1.1 Background 1.2 Our Contribution 1.3 Organization 2 Preliminaries 3 Lattice Algorithms 3.1 LLL Reduction 3.2 ENUM 3.3 BKZ Reduction 3.4 Quick Reordering Technique 4 Our Proposals 4.1 Primal Projective Reordring 4.2 Dual Projective Reordering 4.3 Observation 5 Experimental Results 5.1 Experimental Result for 30-Dimensional Random Lattice 5.2 Experimental Results on a High-Dimensional Lattice 5.3 Experimental Results on tR 6 Conclusion and Future Work References Compiler-based Attack Origin Tracking with Dynamic Taint Analysis 1 Introduction 2 Design Goals and Attacker Model 3 Resilient CFI 4 Implementation Details 5 Case Study: NginX Web Server 6 Security Discussion 7 Performance Evaluation 8 Related Work 9 Conclusion References Security Analysis of Hash Algorithm Preimage Attacks on 4-Round Keccak by Solving Multivariate Quadratic Systems 1 Introduction 2 Preliminaries and Main Techniques 2.1 Notation 2.2 Keccak-f Permutation 2.3 The Keccak Hash Function 2.4 Properties of Step 2.5 On the Concrete Complexity of Crossbred Algorithm with D=2 3 Preimage Attacks on 4-Round Keccak 3.1 Preimage Attack on 4-Round Keccak-224 3.2 Preimage Attack on 4-Round Keccak-256 4 Application to Keccak Challenge 4.1 Preimage Attack on 4 Round Keccak[r=640,c=160, l=80] 4.2 Implementation 4.3 Results 5 Conclusion A Linearization of A Bit in B3 References A Preimage Attack on Reduced Gimli-Hash 1 Introduction 2 Preliminaries 2.1 Description of Gimli 2.2 Gimli-Hash 3 The General Approach of Preimage Attack 4 Preimage Attack on 5-9-Round Gimli-Hash 4.1 Description 5-9-Round Gimli-Hash 4.2 Finding Valid Inner Part on 9-Round Gimli (Phase 1) 4.3 Reducing Precomputation Memory Using SAT Solver 5 Conclusion A The Preimage Attack of Liu et al.'s on 5-Round Gimli-Hash References Security analysis of Symmetric Key Encryption Algorithm Algebraic Attacks on Grain-Like Keystream Generators 1 Introduction 2 Preliminaries 2.1 Feedback Shift Registers 2.2 Filter Generators 2.3 Composite Combiners and `Grain-Like' Structures 3 Current Algebraic Attacks 3.1 Algebraic Attacks on NLFGs 3.2 Fast Algebraic Attacks on NLFGs 3.3 Algebraic Attacks on LF-NFSRs 3.4 Algebraic Attacks on Grain-Like Structures 4 Our Algebraic Attacks on Grain-Like Structures 4.1 Vulnerable Filter Functions 4.2 Generalised Algebraic Attack Algorithm 5 The Grain Family of Stream Ciphers 5.1 Description of the Grain 5.2 Phases of Operation 5.3 Resistance Against Algebraic Attacks 6 Algebraic Attack on Modified Versions of the Grain Family 6.1 Modified Version of Grain 6.2 Stage 1: LFSR Recovery 6.3 Stage 2: NFSR Recovery 7 Experimental Simulations 7.1 Specifications 7.2 Experimental Approach 7.3 Results on Toy Grain-Like Structure 7.4 NFSR Recovery on Full Modified Grain Family 8 Discussion/Observations 9 Conclusion A Algorithms A.1 Algorithm for NLFG algebraic attack A.2 Algorithm for Fast Algebraic Attack A.3 Algorithm for LF-NFSR Algebraic Attack B Modified Version of Grain C Recovering the LFSR Initial State of Grain D Recovering the NFSR Initial State of Grain References Improved See-In-The-Middle Attacks on AES 1 Introduction 2 Attack Methodology 2.1 The Block Cipher AES 2.2 SITM Overview 3 Improved SITM Attacks on AES Using Single-Key Differential Patterns 3.1 The Differential Patterns 3.2 Application of SITM 4 SITM Attack on AES-256 Using Related-Key Differential Trail 4.1 The Related-Key Differential Trail 4.2 Application of SITM 5 Conclusion References Fault and Side-Channel Attack Differential Fault Attack on Rocca 1 Introduction 2 Preliminaries 2.1 Differential Fault Attack 2.2 Specification of Encryption Phase of Rocca 3 Key and Internal State Recovery of Rocca 3.1 Attack Procedure 3.2 Analysis of Equation7 3.3 Internal State Recovery 3.4 Key Recovery 4 Discussion 4.1 Comparison 4.2 Mitigating the Differential Fault Attack on Rocca 5 Conclusion References Differential Fault Attack on Lightweight Block Cipher PIPO 1 Introduction 2 Backgrounds 2.1 PIPO: Plug-In Plug-Out 2.2 Differential Fault Attack 3 Differential Fault Attack on PIPO 3.1 Attacker's Assumption 3.2 Proposed DFA Scheme on PIPO 4 Experiments and Discussion 4.1 Experimental Result 4.2 DFA on Bit-Sliced Block Ciphers 5 Conclusion References Learning-based Side-Channel Analysis on PIPO 1 Introduction 2 Background 2.1 PIPO: Bitslice Lightweight Block Cipher 2.2 Supervised Learning Using Multi-Layer Perceptron 2.3 Deep Learning-Based Profiled Side-Channel Attack 2.4 Deep Learning-Based Non-profiled Attack 3 DL-Based Profiled SCA on PIPO 3.1 Attack Scenario 3.2 Experimental Result 4 DL-Based Non-profiled SCA on PIPO 4.1 Attack Scenario 4.2 Experimental Result 5 Conclusion References Constructions and Designs Collision-Resistant and Pseudorandom Function Based on Merkle-Damgård Hash Function 1 Introduction 2 Preliminaries 2.1 Notations 2.2 Collision Resistance 2.3 Pseudorandom Function 2.4 PRF Under Related-Key Attack 3 Proposed Hash Function 4 Collision Resistance 5 Pseudorandom-Function Property 6 Discussion 6.1 Instantiation 6.2 Efficiency 7 Concluding Remark References Forward Secure Message Franking 1 Introduction 1.1 Background 1.2 Our Contribution 1.3 Related Work 2 Preliminaries 2.1 Notation 2.2 Forward Secure Pseudorandom Generator 2.3 Forward Secure Message Authentication Code 2.4 Committing Authenticated Encryption with Associated Data 3 Forward Secure Message Franking 3.1 Syntax 3.2 Security Definitions 4 Construction of Key-Evolving Message Franking 4.1 Construction 4.2 Security Proof 5 Conclusion References New General Framework for Algebraic Degree Evaluation of NFSR-Based Cryptosystems 1 Introduction 2 New General Framework for Algebraic Degree Evaluation of NFSR-Based Cryptosystems 2.1 A New Notion: Algebraic Degree Tuple 2.2 A New Technique: Composite Numeric Mapping 2.3 A New General Framework for Algebraic Degree Evaluation of NFSR-Based Cryptosystems 3 Algebraic Degree Tuple Evaluation of Trivium-Like Ciphers 3.1 The Algorithm for Algebraic Degree Tuple Estimation of Trivium-like Ciphers 3.2 Experimental Results 4 Conclusions A The Procedure CDEGTri for = B and = C B The Cubes Used in Our Attacks References Quantum Circuit T-depth Reduction Method for Efficient SHA-256 Quantum Circuit Construction 1 Introduction 2 Background and Related Work 2.1 Toffoli-Gate 2.2 Quantum Adder Circuit 2.3 Secure Hash Algorithm-2 3 T-Depth and T-Count Reduction Method 3.1 Three Cases Where Our Method is Applied 3.2 Exchangeability Determination Process 3.3 Remark and Cautions 4 Application 1: Applying T-depth and T-count Reduction Technique to Quantum Ripple-Carry Adder 4.1 CDKM Adder 4.2 VBE Adder 4.3 TK Adder 4.4 HRS Adder 5 Application 2: Using Reduced Quantum Adders in Our New Quantum SHA-256 Circuit 5.1 SHA-256 Quantum Circuit Implementation 5.2 Quantum Circuit Resources Comparison 6 Conclusion and Future Work References Efficient Quantum Circuit of Proth Number Modular Multiplication 1 Introduction 2 Background 2.1 Proth Number 2.2 CDKM Adder 2.3 Generic Quantum Modular Multiplication Circuit 3 Quantum Circuit of Arithmetic 3.1 Controlled CDKM Adder 3.2 Sign Conversion 4 Proth Number Modular Multiplication Circuit 4.1 Multiplication 4.2 Setup 4.3 Division 4.4 Uncomputation 4.5 Experimental Result 5 Conclusion References Efficient Implementation Grover on SM3 1 Introduction 1.1 Contribution 2 Related Work 2.1 SM3 Hash Function 2.2 Quantum Computing 2.3 Grover Search Algorithm 3 Proposed Method 3.1 SM3 Hash Function on Quantum Circuit 3.2 Message Expansion 3.3 Message Compression 3.4 Hash Value 3.5 Permutation 4 Evaluation 5 Conclusion References SPEEDY on Cortex–M3: Efficient Software Implementation of SPEEDY on ARM Cortex–M3 1 Introduction 1.1 Contributions 2 SPEEDY Algorithm 3 Proposed Method 3.1 SPEEDY on ARM Cortex–M3 3.2 Using Bit-Slicing in SPEEDY 3.3 SubBox 3.4 ShiftColumns 3.5 MixColumns 3.6 AddRoundKey and AddRoundConstant 4 Results 5 Conclusion References Author Index