000			03663nam a22005415i 4500
001			978-3-540-77272-9
003			DE-He213
005			20160624102116.0
007			cr nn 008mamaa
008			100301s2007 gw | s |||| 0|eng d
020			_a9783540772729 _9978-3-540-77272-9
024	7		_a10.1007/978-3-540-77272-9 _2doi
050		4	_aQA76.9.A25
072		7	_aURY _2bicssc
072		7	_aCOM053000 _2bisacsh
082	0	4	_a005.82 _223
245	1	0	_aCryptography and Coding _h[electronic resource] : _b11th IMA International Conference, Cirencester, UK, December 18-20, 2007. Proceedings / _cedited by Steven D. Galbraith.
260		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2007.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2007.
300			_aXI, 426 p. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aLecture Notes in Computer Science, _x0302-9743 ; _v4887
505	0		_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.
650		0	_aComputer science.
650		0	_aComputer Communication Networks.
650		0	_aData protection.
650		0	_aData encryption (Computer science).
650		0	_aCoding theory.
650		0	_aComputational complexity.
650	1	4	_aComputer Science.
650	2	4	_aData Encryption.
650	2	4	_aCoding and Information Theory.
650	2	4	_aSystems and Data Security.
650	2	4	_aDiscrete Mathematics in Computer Science.
650	2	4	_aComputer Communication Networks.
700	1		_aGalbraith, Steven D. _eeditor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783540772712
786			_dSpringer
830		0	_aLecture Notes in Computer Science, _x0302-9743 ; _v4887
856	4	0	_uhttp://dx.doi.org/10.1007/978-3-540-77272-9
942			_2EBK7972 _cEBK
999			_c37266 _d37266