Advances in Cryptology - CRYPTO '90: Proceedings: Lecture Notes in Computer Science, cartea 537
Editat de Alfred J. Menezes, Scott A. Vanstoneen Limba Engleză Paperback – 13 noi 1991
Din seria Lecture Notes in Computer Science
- 15% Preț: 549.48 lei
- 20% Preț: 322.44 lei
- 20% Preț: 324.00 lei
- 20% Preț: 315.78 lei
- 20% Preț: 238.01 lei
- 20% Preț: 1017.66 lei
- 20% Preț: 322.44 lei
- 20% Preț: 438.69 lei
- 20% Preț: 548.35 lei
- 20% Preț: 325.58 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 315.19 lei
- 20% Preț: 1005.39 lei
- 20% Preț: 554.59 lei
- 17% Preț: 360.19 lei
- 20% Preț: 620.45 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1120.51 lei
- 20% Preț: 560.32 lei
- 20% Preț: 611.22 lei
- 20% Preț: 319.10 lei
- 20% Preț: 552.64 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- 20% Preț: 1339.86 lei
- 20% Preț: 172.69 lei
- 20% Preț: 315.78 lei
- Preț: 361.23 lei
- 20% Preț: 969.58 lei
- 20% Preț: 256.27 lei
- 20% Preț: 782.28 lei
- 20% Preț: 301.95 lei
- 20% Preț: 504.57 lei
- 20% Preț: 722.90 lei
- 20% Preț: 369.12 lei
- 20% Preț: 334.72 lei
- 20% Preț: 550.29 lei
- Preț: 389.06 lei
- 20% Preț: 564.99 lei
- 20% Preț: 552.25 lei
- 20% Preț: 552.25 lei
- 20% Preț: 722.40 lei
- 20% Preț: 331.59 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 387.57 lei
Nou
Puncte Express: 581
Preț estimativ în valută:
74.19€ • 80.82$ • 62.24£
74.19€ • 80.82$ • 62.24£
Carte tipărită la comandă
Livrare economică 18 decembrie 24 - 01 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540545088
ISBN-10: 3540545085
Pagini: 664
Ilustrații: XIV, 650 p.
Dimensiuni: 155 x 235 x 35 mm
Greutate: 0.92 kg
Ediția:1991
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540545085
Pagini: 664
Ilustrații: XIV, 650 p.
Dimensiuni: 155 x 235 x 35 mm
Greutate: 0.92 kg
Ediția:1991
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Cryptanalysis.- Differential Cryptanalysis of DES-like Cryptosystems.- A Statistical Attack of the FEAL-8 Cryptosystem.- An Improved Linear Syndrome Algorithm in Cryptanalysis With Applications.- Protocols.- Quantum Bit Commitment and Coin Tossing Protocols.- Security with Low Communication Overhead.- Fair Computation of General Functions in Presence of Immoral Majority.- One-Way Group Actions.- Algebra and Number Theory.- Solving Large Sparse Linear Systems Over Finite Fields.- On the Computation of Discrete Logarithms in Class Groups.- Matrix Extensions of the RSA Algorithm.- Constructing Elliptic Curve Cryptosystems in Characteristic 2.- Signatures and Authentication.- Identification Tokens — or: Solving The Chess Grandmaster Problem.- Arbitrated Unconditionally Secure Authentication Can Be Unconditionally Protected against Arbiter’s Attacks.- Convertible Undeniable Signatures.- Unconditionally-Secure Digital Signatures.- Secret Sharing.- Geometric Shared Secret and/or Shared Control Schemes.- Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes.- Collective Coin Tossing Without Assumptions nor Broadcasting.- Key Distribution.- A Key Distribution “Paradox”.- A Modular Approach to Key Distribution.- Hash Functions.- Structural Properties of One-Way Hash Functions.- The MD4 Message Digest Algorithm.- Zero-Knowledge.- Achieving Zero-Knowledge Robustly.- Hiding Instances in Zero-Knowledge Proof Systems.- Multi-Language Zero Knowledge Interactive Proof Systems.- Publicly Verifiable Non-Interactive Zero-Knowledge Proofs.- Cryptographic Applications of the Non-Interactive Metaproof and Many-prover Systems.- Interactive Proofs with Provable Security against Honest Verifiers.- Randomness.- On the Universality of the Next Bit Test.- AUniversal Statistical Test for Random Bit Generators.- On the Impossibility of Private Key Cryptography with Weakly Random Keys.- Applications.- How to Time-Stamp a Digital Document.- How to Utilize the Randomness of Zero-Knowledge Proofs.- Fast Software Encryption Functions.- CORSAIR: A Smart Card for Public Key Cryptosystems.- Design and Analysis I.- Fast Checkers for Cryptography.- Complexity Theoretic Issues Concerning Block Ciphers Related to D.E.S..- The Redoc II Cryptosystem.- A Recursive Construction Method of S-boxes Satisfying Strict Avalanche Criterion.- Design and Analysis II.- A Comparison of Practical Public-Key Cryptosystems based on Integer Factorization and Discrete Logarithms.- Nonlinear Parity Circuits and their Cryptographic Applications.- Cryptographic Significance of the Carry for Ciphers Based on Integer Addition.- Impromptu Talks.- Computation of Discrete Logarithms in Prime Fields.- Systolic Modular Multiplication.- Finding Four Million Large Random Primes.- The FEAL Cipher Family.- Discrete-Log With Compressible Exponents.