Cryptography and Coding

9th IMA International Conference, Cirencester, UK, December 16-18, 2003, Proceedings

AvKenneth G. Paterson

Häftad, Engelska, 2003

Del i serien Lecture Notes in Computer Science

550 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

This book constitutes the refereed proceedings of the 9th IMA International Conference on Cryptography and Coding, held in Cirencester, UK in December 2003.The 25 revised full papers presented together with 4 invited contributions were carefully reviewed and selected from 49 submissions. The papers are organized in topical sections on coding and applications, applications of coding in cryptography, cryptography, cryptanalysis, network security and protocols.

Produktinformation

Utgivningsdatum:2003-12-03
Mått:155 x 235 x 22 mm
Vikt:604 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:390
Upplaga:2003
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540206637

Utforska kategorier

Innehållsförteckning

Coding and Applications.- Recent Developments in Array Error-Control Codes.- High Rate Convolutional Codes with Optimal Cycle Weights.- A Multifunctional Turbo-Based Receiver Using Partial Unit Memory Codes.- Commitment Capacity of Discrete Memoryless Channels.- Separating and Intersecting Properties of BCH and Kasami Codes.- Applications of Coding in Cryptography.- Analysis and Design of Modern Stream Ciphers.- Improved Fast Correlation Attack Using Low Rate Codes.- On the Covering Radius of Second Order Binary Reed-Muller Code in the Set of Resilient Boolean Functions.- Degree Optimized Resilient Boolean Functions from Maiorana-McFarland Class.- Differential Uniformity for Arrays.- Cryptography.- Uses and Abuses of Cryptography.- A Designer’s Guide to KEMs.- A General Construction of IND-CCA2 Secure Public Key Encryption.- Efficient Key Updating Signature Schemes Based on IBS.- Periodic Sequences with Maximal Linear Complexity and Almost Maximal k-Error Linear Complexity.- Cryptanalysis.- Estimates for Discrete Logarithm Computations in Finite Fields of Small Characteristic.- Resolving Large Prime(s) Variants for Discrete Logarithm Computation.- Computing the M = UU t Integer Matrix Decomposition.- Cryptanalysis of the Public Key Cryptosystem Based on the Word Problem on the Grigorchuk Groups.- More Detail for a Combined Timing and Power Attack against Implementations of RSA.- Predicting the Inversive Generator.- A Stochastical Model and Its Analysis for a Physical Random Number Generator Presented At CHES 2002.- Analysis of Double Block Length Hash Functions.- Network Security and Protocols.- Cryptography in Wireless Standards.- On the Correctness of Security Proofs for the 3GPP Confidentiality and Integrity Algorithms.- A General Attack Model on Hash-BasedClient Puzzles.- Tripartite Authenticated Key Agreement Protocols from Pairings.- Remote User Authentication Using Public Information.- Mental Poker Revisited.