My Account Log in

1 option

Cryptography and Coding : 9th IMA International Conference, Cirencester, UK, December 16-18, 2003, Proceedings / edited by Kenneth G. Paterson.

LIBRA Q341 .P7 2004
Loading location information...

Available from offsite location This item is stored in our repository but can be checked out.

Log in to request item
Format:
Book
Contributor:
Paterson, Kenneth G., 1969- editor.
SpringerLink (Online service)
Series:
Computer Science (Springer-11645)
Lecture notes in computer science 0302-9743 ; 2898.
Lecture Notes in Computer Science, 0302-9743 ; 2898
Language:
English
Subjects (All):
Data encryption (Computer science).
Coding theory.
Information theory.
Computer science.
Computer networks.
Computer science--Mathematics.
Cryptology.
Coding and Information Theory.
Computer Science, general.
Computer Communication Networks.
Discrete Mathematics in Computer Science.
Local Subjects:
Cryptology.
Coding and Information Theory.
Computer Science, general.
Computer Communication Networks.
Discrete Mathematics in Computer Science.
Physical Description:
1 online resource (X, 390 pages).
Edition:
First edition 2003.
Contained In:
Springer eBooks
Place of Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003.
System Details:
text file PDF
Summary:
The ninth in the series of IMA Conferences on Cryptography and Coding was held (as ever) at the Royal Agricultural College, Cirencester, from 16-18 Dec- ber 2003. The conference's varied programme of 4 invited and 25 contributed papers is represented in this volume. The contributed papers were selected from the 49 submissions using a - reful refereeing process. The contributed and invited papers are grouped into 5 topics: coding and applications; applications of coding in cryptography; cryp- graphy; cryptanalysis; and network security and protocols. These topic headings represent the breadth of activity in the areas of coding, cryptography and c- munications, and the rich interplay between these areas. Assemblingtheconferenceprogrammeandthisproceedingsrequiredthehelp of many individuals. I would like to record my appreciation of them here. Firstly, I would like to thank the programme committee who aided me - mensely by evaluating the submissions, providing detailed written feedback for the authors of many of the papers, and advising me at many critical points - ring the process. Their help and cooperation was essential, especially in view of the short amount of time available to conduct the reviewing task. The c- mittee this year consisted of Mike Darnell, Mick Ganley, Bahram Honary, Chris Mitchell, Matthew Parker, Nigel Smart and Mike Walker.
Contents:
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-Based Client Puzzles
Tripartite Authenticated Key Agreement Protocols from Pairings
Remote User Authentication Using Public Information
Mental Poker Revisited.
Other Format:
Printed edition:
ISBN:
978-3-540-40974-8
9783540409748
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account