Cryptography and Coding: 11th IMA International Conference, Cirencester, UK, December 18-20, 2007, Proceedings (Lecture Notes in Computer Science/Security and Cryptology): 4887 - Brossura

 
9783540772712: Cryptography and Coding: 11th IMA International Conference, Cirencester, UK, December 18-20, 2007, Proceedings (Lecture Notes in Computer Science/Security and Cryptology): 4887

Sinossi

This book constitutes the refereed proceedings of the 11th IMA International Conference on Cryptography and Coding, held in Cirencester, UK in December 2007. The 22 revised full papers presented together with two invited contributions were carefully reviewed and selected from 48 submissions. The papers are organized in topical sections on signatures, boolean functions, block cipher cryptanalysis, side channels, linear complexity, public key encryption, curves, and RSA implementation.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Contenuti

Invited Papers.- Efficient Cryptographic Protocols Based on the Hardness of Learning Parity with Noise.- Galois Rings and Pseudo-random Sequences.- Signatures I.- Finding Invalid Signatures in Pairing-Based Batches.- How to Forge a Time-Stamp Which Adobe’s Acrobat Accepts.- Efficient Computation of the Best Quadratic Approximations of Cubic Boolean Functions.- On the Walsh Spectrum of a New APN Function.- Non-linear Cryptanalysis Revisited: Heuristic Search for Approximations to S-Boxes.- Cryptanalysis of the EPBC Authenticated Encryption Mode.- Blockwise-Adaptive Chosen-Plaintext Attack and Online Modes of Encryption.- Algebraic Cryptanalysis of the Data Encryption Standard.- Cryptographic Side-Channels from Low-Power Cache Memory.- New Branch Prediction Vulnerabilities in OpenSSL and Necessary Software Countermeasures.- Remarks on the New Attack on the Filter Generator and the Role of High Order Complexity.- Modified Berlekamp-Massey Algorithm for Approximating the k-Error Linear Complexity of Binary Sequences.- Efficient KEMs with Partial Message Recovery.- Randomness Reuse: Extensions and Improvements.- On the Connection Between Signcryption and One-Pass Key Establishment.- Optimised Versions of the Ate and Twisted Ate Pairings.- Extractors for Jacobian of Hyperelliptic Curves of Genus 2 in Odd Characteristic.- Constructing Pairing-Friendly Elliptic Curves Using Gröbner Basis Reduction.- Efficient 15,360-bit RSA Using Woop-Optimised Montgomery Arithmetic.- Toward Acceleration of RSA Using 3D Graphics Hardware.- Signatures II.- Multi-key Hierarchical Identity-Based Signatures.- Verifier-Key-Flexible Universal Designated-Verifier Signatures.

Product Description

Cryptography And Coding: 11Th Ima International Conference, Cirencester, Uk, December 18-20, 2007, Proceedings BY Galbraith,S., Springer, Paperback, 2007

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Altre edizioni note dello stesso titolo

9783540846611: Cryptography and Coding

Edizione in evidenza

ISBN 10:  3540846611 ISBN 13:  9783540846611
Casa editrice: Springer, 2008
Brossura