|
|
|
|
| LEADER |
04179nam a22005895i 4500 |
| 001 |
978-3-540-77272-9 |
| 003 |
DE-He213 |
| 005 |
20210624230722.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100301s2007 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540772729
|9 978-3-540-77272-9
|
| 024 |
7 |
|
|a 10.1007/978-3-540-77272-9
|2 doi
|
| 050 |
|
4 |
|a QA268
|
| 050 |
|
4 |
|a Q350-390
|
| 072 |
|
7 |
|a GPJ
|2 bicssc
|
| 072 |
|
7 |
|a COM031000
|2 bisacsh
|
| 072 |
|
7 |
|a GPJ
|2 thema
|
| 072 |
|
7 |
|a GPF
|2 thema
|
| 082 |
0 |
4 |
|a 003.54
|2 23
|
| 245 |
1 |
0 |
|a Cryptography and Coding
|h [electronic resource] :
|b 11th IMA International Conference, Cirencester, UK, December 18-20, 2007, Proceedings /
|c edited by Steven Galbraith.
|
| 250 |
|
|
|a 1st ed. 2007.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2007.
|
| 300 |
|
|
|a XI, 426 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Security and Cryptology ;
|v 4887
|
| 505 |
0 |
|
|a 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.
|
| 650 |
|
0 |
|a Coding theory.
|
| 650 |
|
0 |
|a Information theory.
|
| 650 |
|
0 |
|a Data encryption (Computer science).
|
| 650 |
|
0 |
|a Computer security.
|
| 650 |
|
0 |
|a Computer science—Mathematics.
|
| 650 |
|
0 |
|a Computer communication systems.
|
| 650 |
1 |
4 |
|a Coding and Information Theory.
|0 https://scigraph.springernature.com/ontologies/product-market-codes/I15041
|
| 650 |
2 |
4 |
|a Cryptology.
|0 https://scigraph.springernature.com/ontologies/product-market-codes/I28020
|
| 650 |
2 |
4 |
|a Systems and Data Security.
|0 https://scigraph.springernature.com/ontologies/product-market-codes/I28060
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|0 https://scigraph.springernature.com/ontologies/product-market-codes/I17028
|
| 650 |
2 |
4 |
|a Computer Communication Networks.
|0 https://scigraph.springernature.com/ontologies/product-market-codes/I13022
|
| 700 |
1 |
|
|a Galbraith, Steven.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer Nature eBook
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540846611
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540772712
|
| 830 |
|
0 |
|a Security and Cryptology ;
|v 4887
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-540-77272-9
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-SXCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (SpringerNature-11645)
|
| 950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|
