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

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Galbraith, Steven D. (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007.
• Σειρά: Lecture Notes in Computer Science, 4887
• Θέματα: Computer science.; Computer communication systems.; Computer security.; Data encryption (Computer science).; Coding theory.; Computer science > Mathematics.; Computer Science.; Coding and Information Theory.; Data Encryption.; Systems and Data Security.; Discrete Mathematics in Computer Science.; Computer Communication Networks.

Πίνακας περιεχομένων:

• 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.