Vor Ort
Merkzettel Warenkorb
  • Produktbild: Cryptography and Coding
  • Produktbild: Cryptography and Coding
Band 2260

Cryptography and Coding 8th IMA International Conference Cirencester, UK, December 17-19, 2001 Proceedings

Aus der Reihe Lecture Notes in Computer Science

51,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

10.12.2001

Herausgeber

Bahram Honary

Verlag

Springer Berlin

Seitenzahl

419

Maße (L/B/H)

23,5/15,5/2,4 cm

Gewicht

603 g

Auflage

2001

Sprache

Englisch

ISBN

978-3-540-43026-1

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

10.12.2001

Herausgeber

Bahram Honary

Verlag

Springer Berlin

Seitenzahl

419

Maße (L/B/H)

23,5/15,5/2,4 cm

Gewicht

603 g

Auflage

2001

Sprache

Englisch

ISBN

978-3-540-43026-1

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: GPSR Kontakt

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Cryptography and Coding
  • Produktbild: Cryptography and Coding
  • 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 Wireless Devices.- 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.