Cryptography and Coding

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

Häftad, Engelska, 2001

709 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

This book constitutes the refereed proceedings of the 8th International IMA Conference on Cryptography and Coding held in Cirencester, UK in December 2001. The 33 revised full papers presented together with four invited papers were carefully reviewed and selected from numerous submissions. Among the topics covered are mathematical bounds, statistical decoding schemes for error-correcting codes, multifunctional and multiple access communication systems, low density parity check codes, iterative coding, authentication, key recovery attacks, stream cipher design, analysis of ECIES algorithms, and lattice bases attacks on IP based protocols.

Produktinformation

Utgivningsdatum2001-12-10
Mått155 x 233 x 24 mm
Vikt651 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor419
Upplaga2001
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540430261

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it
Referensverk och tvärvetenskap inom Samhalle och politik
Affärsförhandlingar inom Ekonomi och ledarskap
Diskret matematik inom Naturvetenskap och teknik
Hårdvara inom Data och it
IT-säkerhet inom Data och it

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.