عنوان
پدید آورنده
موضوع
رده
QA76.9.A25
QA76
.
9
.
A25
کتابخانه
محل استقرار
3030109704
9783030109707
9783030109691
Selected areas in cryptography -- SAC 2018 :
[Book]
25th International Conference, Calgary, AB, Canada, August 15-17, 2018, Revised selected papers /
Carlos Cid, Michael J. Jacobson Jr. (eds.).
Cham, Switzerland :
Springer,
2019.
1 online resource (xi, 499 pages) :
illustrations (some color)
Lecture notes in computer science ;
LNCS sublibrary. SL 4, Security and cryptology
11349
Includes author index.
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
6.1 Attack Procedure for sLiSCP-1926.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
A Modelizing the MC Equations in Constraint ProgrammingB 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
Cryptanalysis of Reduced sLiSCP Permutation in Sponge-Hash and Duplex-AE Modes1 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
0
8
8
8
This book contains revised selected papers from the 25th International Conference on Selected Areas in Cryptography, SAC 2018, held in Calgary, AB, Canada in August 2018. The 22 full papers presented in this volume were carefully reviewed and selected from 57 submissions. They cover the following research areas: design and analysis of symmetric key primitives and cryptosystems, including block and stream ciphers, hash functions, MAC algorithms, and authenticated encryption schemes efficient implementations of symmetric and public key algorithms mathematical and algorithmic aspects of applied cryptology cryptography for the Internet of Things.
Springer Nature
com.springer.onix.9783030109707
9783030109691
9783030109714
SAC 2018
Computer security, Congresses.
Data encryption (Computer science), Congresses.
Computer security.
Data encryption (Computer science)
COM053000
UR
UR
UTN
005
.
8/24
23
QA76
.
9
.
A25
Cid, Carlos
Jacobson, Michael, (Computer scientist)
SAC (Conference)(25th :2018 :, Calgary, Alta.)
20200823082638.0
pn
مطالعه متن کتاب [Book]
Y
