Cryptography and Coding: 7th IMA International Conference, Cirencester, UK, December 20-22, 1999 Proceedings

by Michael Walker (Editor)

Overview

The IMA conferences onCryptographyandCoding arenotonly a blend of these two aspects of information theory, but a blend of mathematics and engineering and of theoretical results and applications. The papers in this book show that the1999conferencewasnoexception. Indeed, weagainsawthemathematics- derlyingcryptographyanderrorcorrectingcodingbeing appliedto otheraspects ofcommunications, andwe alsosawclassicalmathematicalconcepts nding new applications in communications theory. As usual the conference was held at the Royal Agricultural College, Cirencester, shortly before Christmas - this time 20-22 December 1999. The papers appear in this book in the order in which they were presented, grouped into sessions, eachsessionbeginning with an invited paper. Theseinvited papers were intended to re?ect the invitees' views on the future of their subject - or more accurately where they intended to take it. Indeed the focus of the conf- encewas thefutureofcryptographyandcoding as seenthroughtheeyes ofyoung researchers. The r st group of papers is concerned with mathematical bounds, concepts, and constructions that form a common thread running through error corre- ing coding theory, cryptography, and codes for multiple access schemes. This is followed by a group of papers from a conference session concerned with app- cations. The papers range over various topics from arithmetic coding for data compression and encryption, through image coding, biometrics for authenti- tion, and access to broadcast channels, to photographic signatures for secure identi cation. The third set of papers deals with theoretical aspects of error c- recting coding, including graph and trellis decoding, turbo codes, convolution codes and low complexity soft decision decoding of Reed Solomon codes.

Product Details

ISBN-13:	9783540668879
Publisher:	Springer Berlin Heidelberg
Publication date:	01/14/2000
Series:	Lecture Notes in Computer Science , #1746
Edition description:	1999
Pages:	352
Product dimensions:	6.10(w) x 9.17(h) x 0.03(d)

About the Author

Michael Walker is the author of the national bestseller Laurel Canyon: The Inside Story of Rock-and-Roll’s Legendary Neighborhood. His writing has appeared in The New York Times, the Los Angeles Times, The Washington Post, and Rolling Stone, among other publications. He lives in Los Angeles.

Table of Contents

Applications of Exponential Sums in Communications Theory.- Some Applications of Bounds for Designs to the Cryptography.- Further Results on the Relation Between Nonlinearity and Resiliency for Boolean Functions.- Combinatorial Structure of Finite Fields with Two Dimensional Modulo Metrics?.- A New Method for Generating Sets of Orthogonal Sequences for a Synchronous CDMA System.- New Self-Dual Codes over GF(5).- Designs, Intersecting Families, and Weight of Boolean Functions.- Coding Applications in Satellite Communication Systems [Invited Paper].- A Unified Code.- Enhanced Image Coding for Noisy Channels.- Perfectly Secure Authorization and Passive Identification for an Error Tolerant Biometric System.- An Encoding Scheme for Dual Level Access to Broadcasting Networks.- Photograph Signatures for the Protection of Identification Documents.- An Overview of the Isoperimetric Method in Coding Theory (Extended Abstract) [Invited Paper].- Rectangular Basis of a Linear Code.- Graph Decoding of Array Error-Correcting Codes.- Catastrophicity Test for Time-Varying Convolutional Encoders.- Low Complexity Soft-Decision Sequential Decoding Using Hybrid Permutation for Reed-Solomon Codes.- On Efficient Decoding of Alternant Codes over a Commutative Ring?.- Reduced Complexity Sliding Window BCJR Decoding Algorithms for Turbo Codes.- Advanced Encryption Standard (AES) - An Update [Invited Paper].- The Piling-Up Lemma and Dependent Random Variables.- A Cryptographic Application of Weil Descent.- Edit Probability Correlation Attack on the Bilateral Stop/Go Generator.- Look-Up Table Based Large Finite Field Multiplication in Memory Constrained Cryptosystems (Extended Abstract).- On the Combined Fermat/Lucas Probable Prime Test?.- On the Cryptanalysis of Nonlinear Sequences [InvitedPaper].- Securing Aeronautical Telecommunications [Invited Paper].- Tensor-Based Trapdoors for CVP and Their Application to Public Key Cryptography (Extended Abstract).- Delegated Decryption.- Fast and Space-Efficient Adaptive Arithmetic Coding?.- Robust Prool for Generating Shared RSA Parameters.- Some Soft-Decision Decoding Algorithms for Reed-Solomon Codes.- Weaknesses in Shared RSA Key Generation Prools.- Digital Signature with Message Recovery and Authenticated Encryption (Signcryption) - A Comparison.