LEADER 00680nam0-22002651i-450- 001 990002855540403321 035 $a000285554 035 $aFED01000285554 035 $a(Aleph)000285554FED01 035 $a000285554 100 $a20000920d1995----km-y0itay50------ba 101 0 $aENG 200 1 $aPostmodern marketing$fStephen Brown. 205 $a- 210 $aLondon$cRoutledge$d1995 215 $a225 p.$d23 cm 700 1$aBrown,$bStephen J.$092951 801 0$aIT$bUNINA$gRICA$2UNIMARC 901 $aBK 912 $a990002855540403321 952 $a4-0-570-TI$b4825 DEA$fECA 959 $aECA 996 $aPostmodern marketing$9418273 997 $aUNINA DB $aING01 LEADER 06430nam 22008175 450 001 9910143918103321 005 20251116234221.0 010 $a3-540-45537-X 024 7 $a10.1007/3-540-45537-X 035 $a(CKB)1000000000211663 035 $a(SSID)ssj0000326483 035 $a(PQKBManifestationID)11268664 035 $a(PQKBTitleCode)TC0000326483 035 $a(PQKBWorkID)10296791 035 $a(PQKB)10337897 035 $a(DE-He213)978-3-540-45537-0 035 $a(MiAaPQ)EBC3072171 035 $a(PPN)155236954 035 $a(BIP)7581901 035 $a(EXLCZ)991000000000211663 100 $a20121227d2001 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aSelected Areas in Cryptography $e8th Annual International Workshop, SAC 2001 Toronto, Ontario, Canada, August 16-17, 2001. Revised Papers /$fedited by Serge Vaudenay, Amr M. Youssef 205 $a1st ed. 2001. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2001. 215 $a1 online resource (XII, 364 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2259 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-43066-0 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aCryptanalysis I -- Weaknesses in the Key Scheduling Algorithm of RC4 -- A Practical Cryptanalysis of SSC2 -- Analysis of the E 0 Encryption System -- Boolean Functions -- Boolean Functions with Large Distance to All Bijective Monomials: N Odd Case -- Linear Codes in Constructing Resilient Functions with High Nonlinearity -- New Covering Radius of Reed-Muller Codes for t-Resilient Functions -- Generalized Zig-zag Functions and Oblivious Transfer Reductions -- Rijndael -- A Simple Algebraic Representation of Rijndael -- Improving the Upper Bound on the Maximum Average Linear Hull Probability for Rijndael -- Invited Talk I -- Polynomial Reconstruction Based Cryptography -- Elliptic Curves and Efficient Implementation I -- An Improved Implementation of Elliptic Curves over GF(2 n ) when Using Projective Point Arithmetic -- Fast Generation of Pairs (k, [k]P) for Koblitz Elliptic Curves -- Algorithms for Multi-exponentiation -- Two Topics in Hyperelliptic Cryptography -- Cryptanalysis II -- A Differential Attack on Reduced-Round SC2000 -- On the Complexity of Matsui?s Attack -- Random Walks Revisited: Extensions of Pollard?s Rho Algorithm for Computing Multiple Discrete Logarithms -- Elliptic Curves and Efficient Implementation II -- Fast Normal Basis Multiplication Using General Purpose Processors -- Fast Multiplication of Integers for Public-Key Applications -- Fast Simultaneous Scalar Multiplication on Elliptic Curve with Montgomery Form -- On the Power of Multidoubling in Speeding Up Elliptic Scalar Multiplication -- Public Key Systems -- The GH Public-Key Cryptosystem -- XTR Extended to GF(p 6m ) -- Invited Talk II -- The Two Faces of Lattices in Cryptology -- Protocols and Mac -- New (Two-Track-)MAC Based on the Two Trails of RIPEMD -- Key Revocation with Interval Cover Families -- Timed-Release Cryptography. 330 $aSAC 2001, the eighth annual workshop on selected areas in cryptography, was held at the Fields Institute in Toronto, Ontario, Canada. Previous SAC wo- shops were held at Queen's University in Kingston (1994, 1996, 1998, and 1999), at Carlton University in Ottawa (1995 and 1997) and at the University of Wat- loo (2000). The conference was sponsored by the center for applied cryptographic research (CACR) at the University of Waterloo, Certicom Corporation, C- munications and Information Technology Ontario (CITO), Ecole Polytechnique FŽedŽerale de Lausanne, Entrust Technologies, and ZeroKnowledge. We are gra- ful to these organizations for their support of the conference. The current SAC board includes Carlisle Adams, Doug Stinson, Ed Dawson, Henk Meijer, Howard Heys, Michael Wiener, Serge Vaudenay, Sta'ord Tavares, and Tom Cusick. We would like to thank all of them for giving us the mandate to organize SAC 2001. The themes for SAC 2001 workshop were: - Design and analysis of symmetric key cryptosystems. - Primitives for private key cryptography, including block and stream ciphers, hash functions, and MACs. - E'cient implementations of cryptographic systems in public and private key cryptography. - Cryptographic solutions for web and internet security. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2259 606 $aData encryption (Computer science) 606 $aOperating systems (Computers) 606 $aComputers and civilization 606 $aAlgorithms 606 $aComputer networks 606 $aComputer science$xMathematics 606 $aCryptology$3https://scigraph.springernature.com/ontologies/product-market-codes/I28020 606 $aOperating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14045 606 $aComputers and Society$3https://scigraph.springernature.com/ontologies/product-market-codes/I24040 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aComputer Communication Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/I13022 606 $aComputational Science and Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/M14026 615 0$aData encryption (Computer science) 615 0$aOperating systems (Computers) 615 0$aComputers and civilization. 615 0$aAlgorithms. 615 0$aComputer networks. 615 0$aComputer science$xMathematics. 615 14$aCryptology. 615 24$aOperating Systems. 615 24$aComputers and Society. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aComputer Communication Networks. 615 24$aComputational Science and Engineering. 676 $a005.82 702 $aVaudenay$b Serge$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aYoussef$b Amr M.$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910143918103321 996 $aSelected Areas in Cryptography$92814504 997 $aUNINA