1 option
Cryptography and Coding : 11th IMA International Conference, Cirencester, UK, December 18-20, 2007, Proceedings / edited by Steven Galbraith.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- LNCS sublibrary. Security and cryptology ; SL 4, 4887.
- Security and Cryptology ; 4887
- Language:
- English
- Subjects (All):
- Coding theory.
- Information theory.
- Data encryption (Computer science).
- Computer security.
- Computer science--Mathematics.
- Computer science.
- Computer networks.
- Coding and Information Theory.
- Cryptology.
- Systems and Data Security.
- Discrete Mathematics in Computer Science.
- Computer Communication Networks.
- Local Subjects:
- Coding and Information Theory.
- Cryptology.
- Systems and Data Security.
- Discrete Mathematics in Computer Science.
- Computer Communication Networks.
- Physical Description:
- 1 online resource (XI, 426 pages).
- Edition:
- First edition 2007.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2007.
- System Details:
- text file PDF
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-77272-9
- 9783540772729
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.