000 04016nam a22006255i 4500
001 978-3-642-11925-5
003 DE-He213
005 20240730202541.0
007 cr nn 008mamaa
008 100306s2010 gw | s |||| 0|eng d
020 _a9783642119255
_9978-3-642-11925-5
024 7 _a10.1007/978-3-642-11925-5
_2doi
050 4 _aQA268
072 7 _aGPJ
_2bicssc
072 7 _aURY
_2bicssc
072 7 _aCOM083000
_2bisacsh
072 7 _aGPJ
_2thema
072 7 _aURY
_2thema
082 0 4 _a005.824
_223
245 1 0 _aTopics in Cryptology - CT-RSA 2010
_h[electronic resource] :
_bThe 10th Cryptographers' Track at the RSA Conference 2010, San Francisco, CA, USA, March 1-5, 2010. Proceedings /
_cedited by Josef Pieprzyk.
250 _a1st ed. 2010.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2010.
300 _a397 p. 43 illus.
_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,
_x1611-3349 ;
_v5985
505 0 _aInvited Talk -- The First 30 Years of Cryptographic Hash Functions and the NIST SHA-3 Competition -- Public-Key Cryptography -- Errors Matter: Breaking RSA-Based PIN Encryption with Thirty Ciphertext Validity Queries -- Efficient CRT-RSA Decryption for Small Encryption Exponents -- Resettable Public-Key Encryption: How to Encrypt on a Virtual Machine -- Plaintext-Awareness of Hybrid Encryption -- Speed Records for NTRU -- High-Speed Parallel Software Implementation of the ? T Pairing -- Refinement of Miller's Algorithm Over Edwards Curves -- Probabilistic Public Key Encryption with Equality Test -- Efficient CCA-Secure PKE from Identity-Based Techniques -- Anonymity from Asymmetry: New Constructions for Anonymous HIBE -- Making the Diffie-Hellman Protocol Identity-Based -- On Extended Sanitizable Signature Schemes -- Side-Channel Attacks -- Unrolling Cryptographic Circuits: A Simple Countermeasure Against Side-Channel Attacks -- Fault Attacks Against emv Signatures -- Revisiting Higher-Order DPA Attacks: -- Differential Cache-Collision Timing Attacks on AES with Applications to Embedded CPUs -- Cryptographic Protocols -- Usable Optimistic Fair Exchange -- Hash Function Combiners in TLS and SSL -- Improving Efficiency of an 'On the Fly' Identification Scheme by Perfecting Zero-Knowledgeness -- Cryptanalysis -- Linear Cryptanalysis of Reduced-Round PRESENT -- Dependent Linear Approximations: The Algorithm of Biryukov and Others Revisited -- Practical Key Recovery Attack against Secret-IV Edon- -- Rebound Attacks on the Reduced Grøstl Hash Function -- Symmetric Cryptography -- The Sum of CBC MACs Is a Secure PRF -- On Fast Verification of Hash Chains.
650 0 _aCryptography.
_91973
650 0 _aData encryption (Computer science).
_99168
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aData protection.
_97245
650 0 _aComputer networks .
_931572
650 0 _aAlgorithms.
_93390
650 1 4 _aCryptology.
_931769
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aData and Information Security.
_931990
650 2 4 _aComputer Communication Networks.
_9172023
650 2 4 _aAlgorithms.
_93390
700 1 _aPieprzyk, Josef.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9172024
710 2 _aSpringerLink (Online service)
_9172025
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642119248
776 0 8 _iPrinted edition:
_z9783642119262
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v5985
_923263
856 4 0 _uhttps://doi.org/10.1007/978-3-642-11925-5
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c97071
_d97071