Cryptography and Coding
Editat de Bahram Honaryen Limba Engleză Paperback – 10 dec 2001
Preț: 328.93 lei
Preț vechi: 411.16 lei
-20%
Puncte Express: 493
Carte tipărită la comandă
Livrare economică 28 iulie-11 august
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540430261
ISBN-10: 3540430261
Pagini: 432
Ilustrații: IX, 419 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.65 kg
Ediția:2001
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540430261
Pagini: 432
Ilustrații: IX, 419 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.65 kg
Ediția:2001
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
A Statistical Decoding Algorithm for General Linear Block Codes.- On the Undetected Error Probability for Shortened Hamming Codes on Channels with Memory.- The Complete Weight Enumerator for Codes over M nxs(F q).- Further Improvement of Kumar-Rajagopalan-Sahai Coding Constructions for Blacklisting Problem.- A Simple Soft-Input/Soft-Output Decoder for Hamming Codes.- A Technique with an Information-Theoretic Basis for Protecting Secret Data from Differential Power Attacks.- Key Recovery Attacks on MACs Based on Properties of Cryptographic APIs.- The Exact Security of ECIES in the Generic Group Model.- A New Ultrafast Stream Cipher Design: COS Ciphers.- On Rabin-Type Signatures.- Strong Adaptive Chosen-Ciphertext Attacks with Memory Dump (or: The Importance of the Order of Decryption and Validation).- Majority-Logic-Decodable Cyclic Arithmetic-Modular AN-Codes in 1, 2, and L Steps.- Almost-Certainly Runlength-Limiting Codes.- Weight vs. Magnetization Enumerator for Gallager Codes.- Graph Configurations and Decoding Performance.- A Line Code Construction for the Adder Channel with Rates Higher than Time-Sharing.- The Synthesis of TD-Sequences and Their Application to Multi-functional Communication Systems.- Improvement of the Delsarte Bound for ?-Designs in Finite Polynomial Metric Spaces.- Statistical Properties of Digital Piecewise Linear Chaotic Maps and Their Roles in Cryptography and Pseudo-Random Coding.- The Wide Trail Design Strategy.- Undetachable Threshold Signatures.- Improving Divide and Conquer Attacks against Cryptosystems by Better Error Detection / Correction Strategies.- Key Recovery Scheme Interoperability - A Protocol for Mechanism Negotiation.- Unconditionally Secure Key Agreement Protocol.- An Efficient Stream Cipher Alpha1 for Mobile and WirelessDevices.- Investigation of Linear Codes Possessing Some Extra Properties.- Statistical Physics of Low Density Parity Check Error Correcting Codes.- Generating Large Instances of the Gong-Harn Cryptosystem.- Lattice Attacks on RSA-Encrypted IP and TCP.- Spectrally Bounded Sequences, Codes, and States: Graph Constructions and Entanglement.- Attacking the Affine Parts of SFLASH.- An Identity Based Encryption Scheme Based on Quadratic Residues.- Another Way of Doing RSA Cryptography in Hardware.- Distinguishing TEA from a Random Permutation: Reduced Round Versions of TEA Do Not Have the SAC or Do Not Generate Random Numbers.- A New Search Pattern in Multiple Residue Method (MRM) and Its Importance in the Cryptanalysis of the RSA.- A New Undeniable Signature Scheme Using Smart Cards.- Non-binary Block Inseparable Errors Control Codes.- Cryptanalysis of Nonlinear Filter Generators with (0, 1)-Metric Viterbi Decoding.