000 05251nam a22005535i 4500
001 u374603
003 SIRSI
005 20160812084242.0
007 cr nn 008mamaa
008 100626s2010 gw | s |||| 0|eng d
020 _a9783642138584
_9978-3-642-13858-4
040 _cMX-MeUAM
050 4 _aQA76.9.A25
082 0 4 _a005.82
_223
100 1 _aHong, Seokhie.
_eeditor.
245 1 0 _aFast Software Encryption
_h[recurso electrónico] :
_b17th International Workshop, FSE 2010, Seoul, Korea, February 7-10, 2010, Revised Selected Papers /
_cedited by Seokhie Hong, Tetsu Iwata.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2010.
300 _aXI, 385p. 71 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,
_x0302-9743 ;
_v6147
505 0 _aStream Ciphers and Block Ciphers -- Cryptanalysis of the DECT Standard Cipher -- Improving the Generalized Feistel -- Nonlinear Equivalence of Stream Ciphers -- RFID and Implementations -- Lightweight Privacy Preserving Authentication for RFID Using a Stream Cipher -- Fast Software AES Encryption -- Hash Functions I -- Attacking the Knudsen-Preneel Compression Functions -- Finding Preimages of Tiger Up to 23 Steps -- Cryptanalysis of ESSENCE -- Theory -- Domain Extension for Enhanced Target Collision-Resistant Hash Functions -- Security Analysis of the Mode of JH Hash Function -- Enhanced Security Notions for Dedicated-Key Hash Functions: Definitions and Relationships -- Message Authentication Codes -- A Unified Method for Improving PRF Bounds for a Class of Blockcipher Based MACs -- How to Thwart Birthday Attacks against MACs via Small Randomness -- Constructing Rate-1 MACs from Related-Key Unpredictable Block Ciphers: PGV Model Revisited -- Hash Functions II -- Higher Order Differential Attack on Step-Reduced Variants of Luffa v1 -- Rebound Attack on Reduced-Round Versions of JH -- Hash Functions III (Short Presentation) -- Pseudo-cryptanalysis of the Original Blue Midnight Wish -- Differential and Invertibility Properties of BLAKE -- Cryptanalysis -- Rotational Cryptanalysis of ARX -- Another Look at Complementation Properties -- Super-Sbox Cryptanalysis: Improved Attacks for AES-Like Permutations.
520 _aFast Software Encryption (FSE) 2010,the 17th in a series of workshopson s- metriccryptography,washeldinSeoul,Korea,duringFebruary7–10,2010.Since 2002,theFSE workshophasbeensponsoredbythe InternationalAssociationfor Cryptologic Research (IACR). The ?rst FSE workshop was held in Cambridge, UK (1993), followed by workshops in Leuven, Belgium (1994), Cambridge, UK (1996),Haifa,Israel(1997),Paris,France(1998),Rome, Italy(1999),NewYork, USA (2000), Yokohama, Japan (2001), Leuven, Belgium (2002), Lund, Sweden (2003), New Delhi, India (2004), Paris, France (2005), Graz, Austria (2006), Luxembourg, Luxembourg (2007), Lausanne, Switzerland (2008), and Leuven, Belgium (2009). The FSE workshop concentrates on fast and secure primitives for symmetric cryptography, including the design and analysis of block ciphers, stream ciphers, encryption schemes, analysis and evaluation tools, hash fu- tions, and message authentication codes. This year 67 papers were submitted. Each paper was reviewed by at least threereviewers,andpapers(co-)authoredbyProgramCommitteememberswere reviewed by at least ?ve reviewers. From the 67 papers, 21 were accepted for presentationattheworkshop,andtheseproceedingscontaintherevisedversions of the papers. At the end of the review phase, the Program Committee selected the paper “Attacking the Knudsen-Preneel Compression Functions” by Onur ¨ Ozen, Thomas Shrimpton, and Martijn Stam to receive the best paper award. The workshop also featured two invited talks, “The Survey of Cryptanalysis on Hash Functions” by Xiaoyun Wang and “A Provable-Security Perspective on Hash Function Design” by Thomas Shrimpton. Along with the presentation of the papers and the invited talks, the rump session was organized and chaired by Orr Dunkelman.
650 0 _aComputer science.
650 0 _aComputer Communication Networks.
650 0 _aData protection.
650 0 _aData encryption (Computer science).
650 0 _aComputer software.
650 0 _aComputational complexity.
650 0 _aInformation Systems.
650 1 4 _aComputer Science.
650 2 4 _aData Encryption.
650 2 4 _aComputer Communication Networks.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aManagement of Computing and Information Systems.
650 2 4 _aSystems and Data Security.
650 2 4 _aDiscrete Mathematics in Computer Science.
700 1 _aIwata, Tetsu.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642138577
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v6147
856 4 0 _zLibro electrónico
_uhttp://148.231.10.114:2048/login?url=http://link.springer.com/book/10.1007/978-3-642-13858-4
596 _a19
942 _cLIBRO_ELEC
999 _c202483
_d202483