Advances in Cryptology — ASIACRYPT 2001: 7th International Conference on the Theory and Application of Cryptology and Information Security Gold Coast, Australia, December 9–13, 2001. Proceedings: Lecture Notes in Computer Science, cartea 2248
Editat de Colin Boyden Limba Engleză Paperback – 28 noi 2001
Din seria Lecture Notes in Computer Science
- 20%
Preț: 323.37 lei - 20%
Preț: 461.65 lei - 20%
Preț: 461.32 lei - 20%
Preț: 390.69 lei - 20%
Preț: 527.36 lei - 15%
Preț: 388.50 lei - 20%
Preț: 461.52 lei - 20%
Preț: 390.35 lei - 20%
Preț: 496.64 lei - 20%
Preț: 461.52 lei - 20%
Preț: 389.72 lei - 15%
Preț: 461.85 lei - 20%
Preț: 389.90 lei - 20%
Preț: 497.04 lei - 20%
Preț: 462.05 lei - 20%
Preț: 252.15 lei - 20%
Preț: 391.14 lei - 20%
Preț: 532.54 lei - 20%
Preț: 461.83 lei - 20%
Preț: 255.91 lei - 20%
Preț: 498.46 lei - 20%
Preț: 497.55 lei - 20%
Preț: 499.36 lei - 20%
Preț: 390.12 lei - 20%
Preț: 391.20 lei - 20%
Preț: 532.41 lei - 20%
Preț: 391.20 lei - 20%
Preț: 391.14 lei - 20%
Preț: 461.77 lei - 20%
Preț: 390.35 lei - 20%
Preț: 461.06 lei - 20%
Preț: 461.65 lei - 20%
Preț: 390.18 lei - 20%
Preț: 392.64 lei - 20%
Preț: 390.94 lei - 20%
Preț: 391.86 lei - 20%
Preț: 389.85 lei - 20%
Preț: 498.32 lei - 20%
Preț: 462.67 lei - 20%
Preț: 460.98 lei - 20%
Preț: 424.26 lei - 20%
Preț: 639.72 lei - 15%
Preț: 535.92 lei - 20%
Preț: 532.28 lei - 20%
Preț: 535.77 lei - 5%
Preț: 516.27 lei - 20%
Preț: 461.57 lei - 20%
Preț: 498.50 lei - 20%
Preț: 461.83 lei - 20%
Preț: 249.95 lei
Preț: 390.96 lei
Nou
Puncte Express: 586
Preț estimativ în valută:
69.18€ • 81.12$ • 60.76£
69.18€ • 81.12$ • 60.76£
Carte tipărită la comandă
Livrare economică 04-18 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540429876
ISBN-10: 3540429875
Pagini: 612
Ilustrații: XI, 601 p. 22 illus.
Dimensiuni: 155 x 235 x 34 mm
Greutate: 0.85 kg
Ediția:2001
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540429875
Pagini: 612
Ilustrații: XI, 601 p. 22 illus.
Dimensiuni: 155 x 235 x 34 mm
Greutate: 0.85 kg
Ediția:2001
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Lattice Based Cryptography.- Cryptanalysis of the NTRU Signature Scheme (NSS) from Eurocrypt 2001.- On the Insecurity of a Server-Aided RSA Protocol.- The Modular Inversion Hidden Number Problem.- Human Identification.- Secure Human Identification Protocols.- Invited Talk.- Unbelievable Security Matching AES Security Using Public Key Systems.- Practical Public Key Cryptography.- A Probable Prime Test with Very High Confidence for n ? 1 mod 4.- Computation of Discrete Logarithms in .- Speeding Up XTR.- An Efficient Implementation of Braid Groups.- Cryptography Based on Coding Theory.- How to Achieve a McEliece-Based Digital Signature Scheme.- Efficient Traitor Tracing Algorithms Using List Decoding.- Block Ciphers.- Security of Reduced Version of the Block Cipher Camellia against Truncated and Impossible Differential Cryptanalysis.- Known-IV Attacks on Triple Modes of Operation of Block Ciphers.- Generic Attacks on Feistel Schemes.- A Compact Rijndael Hardware Architecture with S-Box Optimization.- Provable Security.- Provable Security of KASUMI and 3GPP Encryption Mode f8.- Efficient and Mutually Authenticated Key Exchange for Low Power Computing Devices.- Provably Authenticated Group Diffie-Hellman Key Exchange — The Dynamic Case.- Threshold Cryptography.- Fully Distributed Threshold RSA under Standard Assumptions.- Adaptive Security in the Threshold Setting: From Cryptosystems to Signature Schemes.- Threshold Cryptosystems Secure against Chosen-Ciphertext Attacks.- Two-Party Protocols.- Oblivious Polynomial Evaluation and Oblivious Neural Learning.- Mutually Independent Commitments.- Zero Knowledge.- Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank.- Responsive Round Complexity and Concurrent Zero-Knowledge.- CryptographicBuilding Blocks.- Practical Construction and Analysis of Pseudo-Randomness Primitives.- Autocorrelation Coefficients and Correlation Immunity of Boolean Functions.- Elliptic Curve Cryptography.- An Extension of Kedlaya’s Point-Counting Algorithm to Superelliptic Curves.- Supersingular Curves in Cryptography.- Short Signatures from the Weil Pairing.- Self-Blindable Credential Certificates from the Weil Pairing.- Anonymity.- How to Leak a Secret.- Key-Privacy in Public-Key Encryption.- Provably Secure air Blind Signatures with Tight Revocation.
Caracteristici
Includes supplementary material: sn.pub/extras