Cryptography and Coding 11th IMA International Conference, Cirencester, UK, December 18-20, 2007, Proceedings

Cryptography and Coding 11th IMA International Conference, Cirencester, UK, December 18-20, 2007, Proceedings / edited by Steven Galbraith.

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Galbraith, Steven (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2007.
Edition:1st ed. 2007.
Series:Security and Cryptology ; 4887
Springer eBook Collection.
Subjects:
Coding theory.
Information theory.
Data encryption (Computer science).
Computer security.
Computer science—Mathematics.
Computer communication systems.
Electronic resources (E-books)
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Table of Contents:
  • 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.

Similar Items