Overview

Full Product Details

Author:   Kenneth G. Paterson
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint:   Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Edition:   2003 ed.
Volume:   2898
Dimensions:   Width: 15.50cm , Height: 2.00cm , Length: 23.50cm
Weight:   1.230kg
ISBN:  

9783540206637

ISBN 10:   3540206639
Pages:   390
Publication Date:   03 December 2003
Audience:   General/trade ,  Professional and scholarly ,  College/higher education ,  General ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   In Print  
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of 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.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions