000 | 05277nam a22005415i 4500 | ||
---|---|---|---|
001 | 978-3-540-40974-8 | ||
003 | DE-He213 | ||
005 | 20160624101948.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s2003 gw | s |||| 0|eng d | ||
020 |
_a9783540409748 _9978-3-540-40974-8 |
||
024 | 7 |
_a10.1007/b93924 _2doi |
|
050 | 4 | _aQA76.9.A25 | |
072 | 7 |
_aURY _2bicssc |
|
072 | 7 |
_aCOM053000 _2bisacsh |
|
082 | 0 | 4 |
_a005.82 _223 |
245 | 1 | 0 |
_aCryptography and Coding _h[electronic resource] : _b9th IMA International Conference, Cirencester, UK, December 16-18, 2003. Proceedings / _cedited by Kenneth G. Paterson. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2003. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2003. |
|
300 |
_aX, 390 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v2898 |
|
505 | 0 | _aCoding 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. | |
520 | _aThe 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. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aComputer Communication Networks. | |
650 | 0 | _aData encryption (Computer science). | |
650 | 0 | _aCoding theory. | |
650 | 0 | _aComputational complexity. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aData Encryption. |
650 | 2 | 4 | _aComputer Science, general. |
650 | 2 | 4 | _aComputer Communication Networks. |
650 | 2 | 4 | _aCoding and Information Theory. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
700 | 1 |
_aPaterson, Kenneth G. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540206637 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v2898 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/b93924 |
942 |
_2EBK4837 _cEBK |
||
999 |
_c34131 _d34131 |