Cryptography and coding : 11th IMA International Conference, Cirencester, UK, December 18-20, 2007 : proceedings / Steven D. Galbraith (ed.).

By: (11th : IMA International Conference (11th : 2007 : Cirencester, England)
Contributor(s): Galbraith, Steven D
Material type: TextTextSeries: SerienbezeichnungLecture notes in computer science: 4887.; LNCS sublibrary: Publisher: Berlin ; New York : Springer, ©2007Description: 1 online resource (xi, 421 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783540772729; 3540772723; 9783540772712; 3540772715Other title: 11th IMA International Conference | Eleventh IMA International Conference | IMA International ConferenceSubject(s): Coding theory -- Congresses | Cryptography -- Congresses | Cryptography | Coding theory | Informatique | Coding theory | Cryptography | Mathematics | Engineering & Applied Sciences | Physical Sciences & Mathematics | Algebra | Computer Science | wiskunde | mathematics | computerwetenschappen | computer sciences | informatietheorie | information theory | computernetwerken | computer networks | gegevensbeheer | data management | Information and Communication Technology (General) | Informatie- en communicatietechnologie (algemeen)Genre/Form: Electronic books. | Conference papers and proceedings. Additional physical formats: Print version:: Cryptography and coding.DDC classification: 003/.54 LOC classification: QA268 | .C76 2007ebOther classification: TN918-532 | TP309-532 | DAT 465f | DAT 580f | SS 4800 Online resources: Click here to access online
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.
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 2 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

Includes bibliographical references and index.

Print version record.

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

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.

There are no comments for this item.

to post a comment.

Powered by Koha