Cryptography and coding : 9th IMA International Conference, Cirencester, UK, December 16-18, 2003 : proceedings
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 selec...
Zapisane w:
| Korporacja: | |
|---|---|
| Kolejni autorzy: | |
| Format: | Livre numérique |
| Język: | Anglais |
| Wydane: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Seria: | Lecture notes in computer science
2898 |
| Hasła przedmiotowe: | |
| Dostęp online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Komentarz: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Cryptography and coding, 9th IMA International Conference, Cirencester, UK, December 16-18, 2003, proceedings, Kenneth G. Paterson (ed.), Berlin, Springer, 2003, 1 vol. (IX-383 p.), Lecture notes in computer science, 3-540-20663-9 • Cryptography and Coding, Texte imprimé, 9783662165713 |
Spis treści:
- 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.