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ț: 1021.30 lei
- 20% Preț: 337.03 lei
- 20% Preț: 340.22 lei
- 20% Preț: 256.27 lei
- 20% Preț: 324.32 lei
- 20% Preț: 438.69 lei
- 20% Preț: 315.78 lei
- 20% Preț: 327.52 lei
- 20% Preț: 148.66 lei
- 20% Preț: 122.89 lei
- 20% Preț: 557.41 lei
- 20% Preț: 561.37 lei
- 15% Preț: 558.56 lei
- 20% Preț: 238.01 lei
- 20% Preț: 504.57 lei
- 20% Preț: 329.09 lei
- 20% Preț: 563.75 lei
- 20% Preț: 630.24 lei
- 20% Preț: 321.96 lei
- 20% Preț: 1361.10 lei
- 20% Preț: 310.26 lei
- 20% Preț: 607.39 lei
- Preț: 366.90 lei
- 20% Preț: 172.69 lei
- 20% Preț: 315.19 lei
- 20% Preț: 985.59 lei
- 20% Preț: 620.87 lei
- 20% Preț: 436.22 lei
- 20% Preț: 734.34 lei
- 20% Preț: 1034.49 lei
- 17% Preț: 360.19 lei
- 20% Preț: 309.90 lei
- 20% Preț: 573.92 lei
- 20% Preț: 301.95 lei
- 20% Preț: 307.71 lei
- 20% Preț: 369.12 lei
- 20% Preț: 327.52 lei
- 20% Preț: 794.65 lei
- 20% Preț: 569.16 lei
- Preț: 395.43 lei
- 20% Preț: 1138.26 lei
- 20% Preț: 734.34 lei
- 20% Preț: 315.78 lei
- 20% Preț: 330.70 lei
- 20% Preț: 538.29 lei
- 20% Preț: 326.98 lei
Preț: 330.70 lei
Preț vechi: 413.37 lei
-20% Nou
Puncte Express: 496
Preț estimativ în valută:
63.29€ • 66.77$ • 52.74£
63.29€ • 66.77$ • 52.74£
Carte tipărită la comandă
Livrare economică 02-16 ianuarie 25
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.