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.
Author(s): Patrick Guy Farrell (auth.), Kenneth G. Paterson (eds.)
Series: Lecture Notes in Computer Science 2898
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2003
Language: English
Pages: 390
Tags: Data Encryption; Computer Science, general; Computer Communication Networks; Coding and Information Theory; Discrete Mathematics in Computer Science
Front Matter....Pages -
Recent Developments in Array Error-Control Codes....Pages 1-3
High Rate Convolutional Codes with Optimal Cycle Weights....Pages 4-23
A Multifunctional Turbo-Based Receiver Using Partial Unit Memory Codes....Pages 24-34
Commitment Capacity of Discrete Memoryless Channels....Pages 35-51
Separating and Intersecting Properties of BCH and Kasami Codes....Pages 52-65
Analysis and Design of Modern Stream Ciphers....Pages 66-66
Improved Fast Correlation Attack Using Low Rate Codes....Pages 67-81
On the Covering Radius of Second Order Binary Reed-Muller Code in the Set of Resilient Boolean Functions....Pages 82-92
Degree Optimized Resilient Boolean Functions from Maiorana-McFarland Class....Pages 93-114
Differential Uniformity for Arrays....Pages 115-124
Uses and Abuses of Cryptography....Pages 125-132
A Designer’s Guide to KEMs....Pages 133-151
A General Construction of IND-CCA2 Secure Public Key Encryption....Pages 152-166
Efficient Key Updating Signature Schemes Based on IBS....Pages 167-182
Periodic Sequences with Maximal Linear Complexity and Almost Maximal k -Error Linear Complexity....Pages 183-189
Estimates for Discrete Logarithm Computations in Finite Fields of Small Characteristic....Pages 190-206
Resolving Large Prime(s) Variants for Discrete Logarithm Computation....Pages 207-222
Computing the M = UU t Integer Matrix Decomposition....Pages 223-233
Cryptanalysis of the Public Key Cryptosystem Based on the Word Problem on the Grigorchuk Groups....Pages 234-244
More Detail for a Combined Timing and Power Attack against Implementations of RSA....Pages 245-263
Predicting the Inversive Generator....Pages 264-275
A Stochastical Model and Its Analysis for a Physical Random Number Generator Presented At CHES 2002....Pages 276-289
Analysis of Double Block Length Hash Functions....Pages 290-302
Cryptography in Wireless Standards....Pages 303-305
On the Correctness of Security Proofs for the 3GPP Confidentiality and Integrity Algorithms....Pages 306-318
A General Attack Model on Hash-Based Client Puzzles....Pages 319-331
Tripartite Authenticated Key Agreement Protocols from Pairings....Pages 332-359
Remote User Authentication Using Public Information....Pages 360-369
Mental Poker Revisited....Pages 370-383
Back Matter....Pages -
