LEADER 03913nam 2200601 450 001 9910483305303321 005 20220814173300.0 010 $a3-540-77272-3 024 7 $a10.1007/978-3-540-77272-9 035 $a(CKB)1000000000490475 035 $a(SSID)ssj0000492665 035 $a(PQKBManifestationID)11929981 035 $a(PQKBTitleCode)TC0000492665 035 $a(PQKBWorkID)10479404 035 $a(PQKB)10428898 035 $a(DE-He213)978-3-540-77272-9 035 $a(MiAaPQ)EBC4976078 035 $a(MiAaPQ)EBC337129 035 $a(Au-PeEL)EBL337129 035 $a(OCoLC)232363528 035 $a(MiAaPQ)EBC6806074 035 $a(Au-PeEL)EBL6806074 035 $a(OCoLC)1164871332 035 $a(PPN)123731739 035 $a(EXLCZ)991000000000490475 100 $a20220814d2007 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 00$aCryptography and coding $e11th IMA international conference, Cirencester, UK, December 18-20, 2007 : proceedings /$fedited by Steven Galbraith 205 $a1st ed. 2007. 210 1$aBerlin, Germany :$cSpringer,$d[2007] 210 4$d©2007 215 $a1 online resource (XI, 426 p.) 225 1 $aSecurity and Cryptology ;$v4887 300 $aIncludes index. 311 $a3-540-77271-5 327 $aInvited 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. 330 $aThis 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. 410 0$aSecurity and Cryptology ;$v4887 606 $aCoding theory 615 0$aCoding theory. 676 $a003.54 702 $aGalbraith$b Steven D. 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483305303321 996 $aCryptography and Coding$9772174 997 $aUNINA