LEADER 06262nam 22007695 450 001 996466235203316 005 20200706100841.0 010 $a1-280-30780-3 010 $a9786610307807 010 $a3-540-25937-6 024 7 $a10.1007/b98177 035 $a(CKB)1000000000212422 035 $a(DE-He213)978-3-540-25937-4 035 $a(SSID)ssj0000153619 035 $a(PQKBManifestationID)11178374 035 $a(PQKBTitleCode)TC0000153619 035 $a(PQKBWorkID)10407305 035 $a(PQKB)10318633 035 $a(MiAaPQ)EBC3088651 035 $a(PPN)155198262 035 $a(EXLCZ)991000000000212422 100 $a20121227d2004 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aFast Software Encryption$b[electronic resource] $e11th International Workshop, FSE 2004, Delhi, India, February 5-7, 2004, Revised Papers /$fedited by Bimal Kumar Roy, Willi Meier 205 $a1st ed. 2004. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2004. 215 $a1 online resource (XII, 492 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v3017 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-22171-9 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aNew Cryptographic Primitives Based on Multiword T-Functions -- Towards a Unifying View of Block Cipher Cryptanalysis -- Algebraic Attacks on Summation Generators -- Algebraic Attacks on SOBER-t32 and SOBER-t16 without Stuttering -- Improving Fast Algebraic Attacks -- Resistance of S-Boxes against Algebraic Attacks -- Differential Attacks against the Helix Stream Cipher -- Improved Linear Consistency Attack on Irregular Clocked Keystream Generators -- Correlation Attacks Using a New Class of Weak Feedback Polynomials -- Minimum Distance between Bent and 1-Resilient Boolean Functions -- Results on Rotation Symmetric Bent and Correlation Immune Boolean Functions -- A Weakness of the Linear Part of Stream Cipher MUGI -- Vulnerability of Nonlinear Filter Generators Based on Linear Finite State Machines -- VMPC One-Way Function and Stream Cipher -- A New Stream Cipher HC-256 -- A New Weakness in the RC4 Keystream Generator and an Approach to Improve the Security of the Cipher -- Improving Immunity of Feistel Ciphers against Differential Cryptanalysis by Using Multiple MDS Matrices -- ICEBERG : An Involutional Cipher Efficient for Block Encryption in Reconfigurable Hardware -- Related Key Differential Attacks on 27 Rounds of XTEA and Full-Round GOST -- On the Additive Differential Probability of Exclusive-Or -- Two Power Analysis Attacks against One-Mask Methods -- Nonce-Based Symmetric Encryption -- Ciphers Secure against Related-Key Attacks -- Cryptographic Hash-Function Basics: Definitions, Implications, and Separations for Preimage Resistance, Second-Preimage Resistance, and Collision Resistance -- The EAX Mode of Operation -- CWC: A High-Performance Conventional Authenticated Encryption Mode -- New Security Proofs for the 3GPP Confidentiality and Integrity Algorithms -- Cryptanalysis of a Message Authentication Code due to Cary and Venkatesan -- Fast Software-Based Attacks on SecurID -- A MAC Forgery Attack on SOBER-128 -- On Linear Approximation of Modulo Sum. 330 $a2.1 Di?erential Power Analysis Di?erential Power Analysis (DPA) was introduced by Kocher, Ja?e and Jun in 1998 [13] and published in 1999 [14]. The basic idea is to make use of potential correlations between the data handled by the micro-controller and the electric consumption measured values. Since these correlations are often very low, s- tistical methods must be applied to deduce su?cient information from them. Theprinciple ofDPAattacksconsistsincomparingconsumptionvalues m- suredonthe real physical device (for instance a GSM chip or a smart card)with values computed in an hypothetical model of this device (the hypotheses being made among others on the nature of the implementation, and chie?y on a part of the secret key). By comparing these two sets of values, the attacker tries to recover all or part of the secret key. The initial target of DPA attacks was limited to symmetric algorithms. V- nerability of DES ? ?rst shown by Kocher, Ja?e and Jun [13, 14]?wasfurther studied by Goubin and Patarin [11, 12], Messerges, Dabbish, Sloan [16]and Akkar, B´ evan, Dischamp, Moyart [2]. Applications of these attacks were also largely taken into account during the AES selection process, notably by Biham, Shamir [4], Chari, Jutla, Rao, Rohatgi [5] and Daemen, Rijmen [8]. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v3017 606 $aData encryption (Computer science) 606 $aAlgorithms 606 $aCoding theory 606 $aInformation theory 606 $aComputer science?Mathematics 606 $aCryptology$3https://scigraph.springernature.com/ontologies/product-market-codes/I28020 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aCoding and Information Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/I15041 606 $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028 615 0$aData encryption (Computer science). 615 0$aAlgorithms. 615 0$aCoding theory. 615 0$aInformation theory. 615 0$aComputer science?Mathematics. 615 14$aCryptology. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aCoding and Information Theory. 615 24$aDiscrete Mathematics in Computer Science. 676 $a005.8 702 $aRoy$b Bimal Kumar$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMeier$b Willi$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aFSE 2004 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996466235203316 996 $aFast Software Encryption$9772084 997 $aUNISA