Cryptography and Coding
Editat de Kenneth G. Patersonen Limba Engleză Paperback – 3 dec 2003
Preț: 326.27 lei
Preț vechi: 407.84 lei
-20% Nou
Puncte Express: 489
Preț estimativ în valută:
57.73€ • 67.35$ • 50.47£
57.73€ • 67.35$ • 50.47£
Carte tipărită la comandă
Livrare economică 16-30 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540206637
ISBN-10: 3540206639
Pagini: 400
Ilustrații: X, 390 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.6 kg
Ediția:2003
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540206639
Pagini: 400
Ilustrații: X, 390 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.6 kg
Ediția:2003
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.
Caracteristici
Includes supplementary material: sn.pub/extras