Cantitate/Preț
Produs
Total produse
Vezi coșul
Selected Areas in Cryptography: 27th International Conference, Halifax, NS, Canada (Virtual Event), October 21-23, 2020, Revised Selected Papers de Orr Dunkelman

Selected Areas in Cryptography: 27th International Conference, Halifax, NS, Canada (Virtual Event), October 21-23, 2020, Revised Selected Papers: Lecture Notes in Computer Science, cartea 12804

Editat de Orr Dunkelman, Michael J. Jacobson, Jr., Colin O'Flynn
en Limba Engleză Paperback – 21 iul 2021
This book contains revised selected papers from the 27th International Conference on Selected Areas in Cryptography, SAC 2020, held in Halifax, Nova Scotia, Canada in October 2020.
The 27 full papers presented in this volume were carefully reviewed and selected from 52 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, and secure elections and related cryptographic constructions
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 35417 lei

Preț vechi: 44270 lei
-20% Nou

Puncte Express: 531
Preț estimativ în valută:
6779€ • 7050$ • 5681£

Carte tipărită la comandă

Livrare economică 13-27 martie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030816513
ISBN-10: 3030816516
Pagini: 722
Ilustrații: XV, 722 p. 123 illus., 50 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 1.02 kg
Ediția:1st ed. 2021
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Security and Cryptology

Locul publicării:Cham, Switzerland

Cuprins

Public-key Cryptography.- Efficient Lattice-Based Polynomial Evaluation and Batch ZK Arguments.- FROST: Flexible Round-Optimized Schnorr Threshold Signatures.- Algorithmic Acceleration of B/FV-like Somewhat Homomorphic Encryption for Compute-Enabled RAM.- Obfuscating Finite Automata.- On Index Calculus Algorithms for Subfield Curves.- Symmetric-Key Analysis Weak-Key Distinguishers for AES.- Algebraic Key-Recovery Attacks on Reduced-Round Xoofff.- Improved (Related-key) Differential Cryptanalysis on GIFT.- Boolean Polynomials, BDDs and CRHS Equations - Connecting the Dots with CryptaPath.- Boolean Ring Cryptographic Equation Solving.- Interpolation Cryptanalysis of Unbalanced Feistel Networks with Low Degree Round Functions.- Unintended Features of APIs: Cryptanalysis of Incremental HMAC.- Quantum Cryptanalysis.-  Low-gate Quantum Golden Collision Finding.- Improvements to quantum search techniques for block-ciphers, with applications to AES.-  Post-Quantum Constructions.- Not enough LESS: An improved algorithm for solving Code Equivalence Problems over Fq.- Towards Post-Quantum Security for Signal’s X3DH Handshake.- Trapdoor DDH groups from pairings and isogenies.- Practical Isogeny-Based Key-exchange with Optimal Tightness.- Symmetric-Key Design.- PRINCEv2.- Nonce-Misuse Security of the SAEF Authenticated Encryption mode.- WARP : Revisiting GFN for Lightweight 128-bit Block Cipher.- Side Channel Attacks.- Subsampling and Knowledge Distillation on Adversarial Examples: New Techniques for Deep Learning Based Side Channel Evaluations.- Correlation Power Analysis and Higher-order Masking Implementation of WAGE.- On the Influence of Optimizers in Deep Learning-based Side-channel Analysis.- Cryptographic Applications.- On Self-Equivalence Encodings in White-Box Implementations.- Protecting the Privacy of Voters: New Definitions of Ballot Secrecy for E-Voting.- High-Throughput Elliptic Curve Cryptography Using AVX2 Vector Instructions.-