Advances in Cryptology – EUROCRYPT ’97: International Conference on the Theory and Application of Cryptographic Techniques Konstanz, Germany, May 11–15, 1997 Proceedings: Lecture Notes in Computer Science, cartea 1233
Editat de Walter Fumyen Limba Engleză Paperback – 29 apr 1997
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 307.71 lei
- 20% Preț: 438.69 lei
- 20% Preț: 645.28 lei
- Preț: 410.88 lei
- 15% Preț: 580.46 lei
- 17% Preț: 427.22 lei
- 20% Preț: 596.46 lei
- Preț: 381.21 lei
- 20% Preț: 353.50 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 309.90 lei
- 20% Preț: 583.40 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 310.26 lei
- 20% Preț: 655.02 lei
- 20% Preț: 580.93 lei
- 20% Preț: 340.32 lei
- 15% Preț: 438.59 lei
- 20% Preț: 591.51 lei
- 20% Preț: 649.49 lei
- 20% Preț: 337.00 lei
- Preț: 449.57 lei
- 20% Preț: 607.39 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 579.30 lei
- 20% Preț: 763.23 lei
- 20% Preț: 453.32 lei
- 20% Preț: 575.48 lei
- 20% Preț: 585.88 lei
- 20% Preț: 825.93 lei
- 20% Preț: 763.23 lei
- 17% Preț: 360.19 lei
- 20% Preț: 1183.14 lei
- 20% Preț: 340.32 lei
- 20% Preț: 504.57 lei
- 20% Preț: 369.12 lei
- 20% Preț: 583.40 lei
- 20% Preț: 343.62 lei
- 20% Preț: 350.21 lei
- 20% Preț: 764.89 lei
- 20% Preț: 583.40 lei
- Preț: 389.48 lei
- 20% Preț: 341.95 lei
- 20% Preț: 238.01 lei
- 20% Preț: 538.29 lei
Preț: 343.62 lei
Preț vechi: 429.52 lei
-20% Nou
Puncte Express: 515
Preț estimativ în valută:
65.76€ • 68.24$ • 54.96£
65.76€ • 68.24$ • 54.96£
Carte tipărită la comandă
Livrare economică 15-29 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540629757
ISBN-10: 3540629750
Pagini: 524
Ilustrații: XI, 509 p.
Dimensiuni: 155 x 235 x 28 mm
Greutate: 0.73 kg
Ediția:1997
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540629750
Pagini: 524
Ilustrații: XI, 509 p.
Dimensiuni: 155 x 235 x 28 mm
Greutate: 0.73 kg
Ediția:1997
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
Professional/practitionerCuprins
Block Ciphers.- Two Attacks on Reduced IDEA.- Combinatorial Properties of Basic Encryption Operations.- Public Key Systems.- A New Public-Key Cryptosystem.- On the Importance of Checking Cryptographic Protocols for Faults.- Lattice Attacks on NTRU.- Protocols.- Kleptography: Using Cryptography Against Cryptography.- Fast and Secure Immunization Against Adaptive Man-in-the-Middle Impersonation.- Anonymous Fingerprinting.- A Secure and Optimally Efficient Multi-Authority Election Scheme.- Key Escrow.- Binding ElGamal: A Fraud-Detectable Alternative to Key-Escrow Proposals.- The GCHQ Protocol and Its Problems.- Hash-Functions.- Bucket Hashing with a Small Key Size.- A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost.- Information Theory.- Smooth Entropy and Rényi Entropy.- Information-Theoretically Secure Secret-Key Agreement by NOT Authenticated Public Discussion.- Stream Ciphers.- Linear Statistical Weakness of Alleged RC4 Keystream Generator.- Cryptanalysis of Alleged A5 Stream Cipher.- Complexity Theory.- Lower Bounds for Discrete Logarithms and Related Problems.- Stronger Security Proofs for RSA and Rabin Bits.- Round-Optimal Zero-Knowledge Arguments Based on Any One-Way Function.- Efficient Cryptographic Protocols Based on Noisy Channels.- Rapid Demonstration of Linear Relations Connected by Boolean Operators.- Oblivious Transfers and Privacy Amplification.- Implementation.- SHA: A Design for Parallel Architectures?.- Fast Arithmetic Architectures for Public-Key Algorithms over Galois Fields GF((2n)m).- Finding Good Random Elliptic Curves for Cryptosystems Defined over .- Authentication.- Incremental Cryptography and Memory Checkers.- Almost k-wise Independent Sample Spaces and Their Cryptologic Applications.- Boolean Functions.- MoreCorrelation-Immune and Resilient Functions over Galois Fields and Galois Rings.- Design of SAC/PC(l) of Order k Boolean Functions and Three Other Cryptographic Criteria.- Signatures.- Distributed “Magic Ink” Signatures.- Efficient and Generalized Group Signatures.- Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees.- Selective Forgery of RSA Signatures Using Redundancy.