Cantitate/Preț
Produs

Progress in Cryptology - INDOCRYPT 2006: 7th International Conference on Cryptology in India, Kolkata, India, December 11-13, 2006, Proceedings: Lecture Notes in Computer Science, cartea 4329

Editat de Rana Barua, Tanja Lange
en Limba Engleză Paperback – 27 noi 2006

Din seria Lecture Notes in Computer Science

Preț: 39036 lei

Nou

Puncte Express: 586

Preț estimativ în valută:
7471 7766$ 6189£

Carte tipărită la comandă

Livrare economică 05-19 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540497677
ISBN-10: 3540497676
Pagini: 474
Ilustrații: XIV, 458 p.
Dimensiuni: 155 x 235 x 32 mm
Greutate: 0.66 kg
Ediția:2006
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Security and Cryptology

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Invited Talk.- Whither Cryptography?.- Symmetric Cryptography: Attacks.- Non-randomness in eSTREAM Candidates Salsa20 and TSC-4.- Differential and Rectangle Attacks on Reduced-Round SHACAL-1.- Algebraic Attacks on Clock-Controlled Cascade Ciphers.- An Algorithm for Solving the LPN Problem and Its Application to Security Evaluation of the HB Protocols for RFID Authentication.- Hash Functions.- Update on Tiger.- RC4-Hash: A New Hash Function Based on RC4.- Security of VSH in the Real World.- Provable Security: Key Agreement.- Cryptanalysis of Two Provably Secure Cross-Realm C2C-PAKE Protocols.- Efficient and Provably Secure Generic Construction of Three-Party Password-Based Authenticated Key Exchange Protocols.- On the Importance of Public-Key Validation in the MQV and HMQV Key Agreement Protocols.- Invited Talk.- Another Look at “Provable Security”. II.- Provable Security: Public Key Cryptography.- Efficient CCA-Secure Public-Key Encryption Schemes from RSA-Related Assumptions.- General Conversion for Obtaining Strongly Existentially Unforgeable Signatures.- Conditionally Verifiable Signature.- Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission.- Symmetric Cryptography: Design.- Using Wiedemann’s Algorithm to Compute the Immunity Against Algebraic and Fast Algebraic Attacks.- Enciphering with Arbitrary Small Finite Domains.- Enumeration of 9-Variable Rotation Symmetric Boolean Functions Having Nonlinearity > 240.- Modes of Operation and Message Authentication Codes.- Symmetric Nonce Respecting Security Model and the MEM Mode of Operation.- HCH: A New Tweakable Enciphering Scheme Using the Hash-Encrypt-Hash Approach.- Efficient Shared-Key Authentication Scheme from Any Weak Pseudorandom Function.- A Simple and Unified Methodof Proving Indistinguishability.- Fast Implementation of Public Key Cryptography.- Extended Double-Base Number System with Applications to Elliptic Curve Cryptography.- CMSS – An Improved Merkle Signature Scheme.- ID-Based Cryptography.- Constant-Size ID-Based Linkable and Revocable-iff-Linked Ring Signature.- Secure Cryptographic Workflow in the Standard Model.- Multi-receiver Identity-Based Key Encapsulation with Shortened Ciphertext.- Identity-Based Parallel Key-Insulated Encryption Without Random Oracles: Security Notions and Construction.- Embedded System and Side Channel Attacks.- AES Software Implementations on ARM7TDMI.- Galois LFSR, Embedded Devices and Side Channel Weaknesses.