LEADER 06435nam 22007815 450 001 996465794603316 005 20231025171227.0 010 $a3-540-40974-2 024 7 $a10.1007/b93924 035 $a(CKB)1000000000212232 035 $a(SSID)ssj0000322398 035 $a(PQKBManifestationID)11246292 035 $a(PQKBTitleCode)TC0000322398 035 $a(PQKBWorkID)10283677 035 $a(PQKB)11391741 035 $a(DE-He213)978-3-540-40974-8 035 $a(MiAaPQ)EBC3087291 035 $a(PPN)155226320 035 $a(EXLCZ)991000000000212232 100 $a20121227d2003 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCryptography and Coding$b[electronic resource] $e9th IMA International Conference, Cirencester, UK, December 16-18, 2003, Proceedings /$fedited by Kenneth G. Paterson 205 $a1st ed. 2003. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2003. 215 $a1 online resource (X, 390 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2898 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-20663-9 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $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. 330 $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; cryptography; cryptanalysis; and network security and protocols. These topic headings represent the breadth of activity in the areas of coding, cryptography and communications, 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 immensely 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 committee this year consisted of Mike Darnell, Mick Ganley, Bahram Honary, Chris Mitchell, Matthew Parker, Nigel Smart and Mike Walker. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2898 606 $aData encryption (Computer science) 606 $aCoding theory 606 $aInformation theory 606 $aComputer science 606 $aComputer communication systems 606 $aComputer science?Mathematics 606 $aCryptology$3https://scigraph.springernature.com/ontologies/product-market-codes/I28020 606 $aCoding and Information Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/I15041 606 $aComputer Science, general$3https://scigraph.springernature.com/ontologies/product-market-codes/I00001 606 $aComputer Communication Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/I13022 606 $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028 615 0$aData encryption (Computer science). 615 0$aCoding theory. 615 0$aInformation theory. 615 0$aComputer science. 615 0$aComputer communication systems. 615 0$aComputer science?Mathematics. 615 14$aCryptology. 615 24$aCoding and Information Theory. 615 24$aComputer Science, general. 615 24$aComputer Communication Networks. 615 24$aDiscrete Mathematics in Computer Science. 676 $a005.8/2 702 $aPaterson$b Kenneth G$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 02$aInstitute of Mathematics and Its Applications. 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465794603316 996 $aCryptography and Coding$9772174 997 $aUNISA