Cryptography and Coding

by Galbraith, Steven D.

• ISBN13: 9783540772712
• ISBN10: 3540772715
• Format: Paperback
• Copyright: 2008-01-28
• Publisher: Springer-Verlag New York Inc

Summary

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.

Table of Contents

Efficient Cryptographic Protocols Based on the Hardness of Learning Parity with Noise	p. 1
Galois Rings and Pseudo-random Sequences	p. 16
Finding Invalid Signatures in Pairing-Based Batches	p. 34
How to Forge a Time-Stamp Which Adobe's Acrobat Accepts	p. 54
Efficient Computation of the Best Quadratic Approximations of Cubic Boolean Functions	p. 73
On the Walsh Spectrum of a New APN Function	p. 92
Non-linear Cryptanalysis Revisited: Heuristic Search for Approximations to S-Boxes	p. 99
Cryptanalysis of the EPBC Authenticated Encryption Mode	p. 118
Blockwise-Adaptive Chosen-Plaintext Attack and Online Modes of Encryption	p. 129
Algebraic Cryptanalysis of the Data Encryption Standard	p. 152
Cryptographic Side-Channels from Low Power Cache Memory	p. 170
New Branch Prediction Vulnerabilities in OpenSSL and Necessary Software Countermeasures	p. 185
Remarks on the New Attack on the Filter Generator and the Role of High Order Complexity	p. 204
Modified Berlekamp-Massey Algorithm for Approximating the k-Error Linear Complexity of Binary Sequences	p. 220
Efficient KEMs with Partial Message Recovery	p. 233
Randomness Reuse: Extensions and Improvements	p. 257
On the Connection Between Signcryption and One-Pass Key Establishment	p. 277
Optimised Versions of the Ate and Twisted Ate Pairings	p. 302
Extractors for Jacobian of Hyperelliptic Curves of Genus 2 in Odd Characteristic	p. 313
Constructing Pairing-Friendly Elliptic Curves Using Grobner Basis Reduction	p. 336
Efficient 15,360-bit RSA Using Woop-Optimised Montgomery Arithmetic	p. 346
Toward Acceleration of RSA Using 3D Graphics Hardware	p. 364
Multi-key Hierarchical Identity-Based Signatures	p. 384
Verifier-Key-Flexible Universal Designated-Verifier Signatures	p. 403
Author Index	p. 423
Table of Contents provided by Blackwell. All Rights Reserved.