000 05147nam a22006255i 4500
001 978-3-540-36598-3
003 DE-He213
005 20240730183844.0
007 cr nn 008mamaa
008 100301s2006 gw | s |||| 0|eng d
020 _a9783540365983
_9978-3-540-36598-3
024 7 _a10.1007/11799313
_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 _aFast Software Encryption
_h[electronic resource] :
_b13th International Workshop, FSE 2006, Graz, Austria, March 15-17, 2006, Revised Selected Papers /
_cedited by Matt Robshaw.
250 _a1st ed. 2006.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2006.
300 _aXI, 434 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,
_x1611-3349 ;
_v4047
505 0 _aStream Ciphers I -- Cryptanalysis of Achterbahn -- Cryptanalysis of Grain -- Cryptanalysis of the Stream Cipher DECIM -- Block Ciphers -- On Feistel Structures Using a Diffusion Switching Mechanism -- Pseudorandom Permutation Families over Abelian Groups -- A Zero-Dimensional Gröbner Basis for AES-128 -- Hash Functions I -- Cryptanalysis of the Full HAVAL with 4 and 5 Passes -- Collisions and Near-Collisions for Reduced-Round Tiger -- Analysis of Step-Reduced SHA-256 -- Analysis -- Improved Linear Distinguishers for SNOW 2.0 -- Reducing the Space Complexity of BDD-Based Attacks on Keystream Generators -- Breaking the ICE - Finding Multicollisions in Iterated Concatenated and Expanded (ICE) Hash Functions -- Proposals -- A New Dedicated 256-Bit Hash Function: FORK-256 -- Some Plausible Constructions of Double-Block-Length Hash Functions -- Provably Secure MACs from Differentially-Uniform Permutations and AES-Based Implementations -- Hash Functions II -- Searching for Differential Paths in MD4 -- A Study of the MD5 Attacks: Insights and Improvements -- The Impact of Carries on the Complexity of Collision Attacks on SHA-1 -- Modes and Models -- A New Mode of Encryption Providing a Tweakable Strong Pseudo-random Permutation -- New Blockcipher Modes of Operation with Beyond the Birthday Bound Security -- The Ideal-Cipher Model, Revisited: An Uninstantiable Blockcipher-Based Hash Function -- Implementation and Bounds -- How Far Can We Go on the x64 Processors? -- Computing the Algebraic Immunity Efficiently -- Upper Bounds on Algebraic Immunity of Boolean Power Functions -- Stream Ciphers II -- Chosen-Ciphertext Attacks Against MOSQUITO -- Distinguishing Attacks on the Stream Cipher Py -- Resynchronization Attacks on WG and LEX.
520 _aFast Software Encryption (FSE) 2006 is the 13th in a series of workshops on symmetric cryptography. It has been sponsored for the last ?ve years by the International Association for Cryptologic Research (IACR), and previous FSE workshops have been held around the world: 1993 Cambridge, UK 1994 Leuven, Belgium 1996 Cambridge, UK 1997 Haifa, Israel 1998 Paris, France 1999 Rome, Italy 2000 New York, USA 2001 Yokohama, Japan 2002 Leuven, Belgium 2003 Lund, Sweden 2004 New Delhi, India 2005 Paris, France The FSE workshop is devoted to research 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 more than 100 papers were submitted to FSE for the ?rst time. After an extensive review by the ProgramCommittee, 27 papers were presented at the workshop. Of course, the programwould not have been complete without the invited speaker, and the presentation by Eli Biham on the early history of di?erential cryptanalysis was particularly appreciated by workshop attendees.
650 0 _aCryptography.
_91973
650 0 _aData encryption (Computer science).
_99168
650 0 _aAlgorithms.
_93390
650 0 _aCoding theory.
_94154
650 0 _aInformation theory.
_914256
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 1 4 _aCryptology.
_931769
650 2 4 _aAlgorithms.
_93390
650 2 4 _aCoding and Information Theory.
_9133734
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
700 1 _aRobshaw, Matt.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9133735
710 2 _aSpringerLink (Online service)
_9133736
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540365976
776 0 8 _iPrinted edition:
_z9783540826798
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v4047
_923263
856 4 0 _uhttps://doi.org/10.1007/11799313
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c92085
_d92085