LEADER 04472nam 22007575 450 001 996465852503316 005 20200703044436.0 010 $a3-540-49652-1 024 7 $a10.1007/3-540-60865-6 035 $a(CKB)1000000000234410 035 $a(SSID)ssj0000323096 035 $a(PQKBManifestationID)11247937 035 $a(PQKBTitleCode)TC0000323096 035 $a(PQKBWorkID)10289946 035 $a(PQKB)10261819 035 $a(DE-He213)978-3-540-49652-6 035 $a(PPN)155201751 035 $a(EXLCZ)991000000000234410 100 $a20121227d1996 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aFast Software Encryption$b[electronic resource] $eThird International Workshop, Cambridge, UK, February 21 - 23, 1996. Proceedings /$fedited by Dieter Gollmann 205 $a1st ed. 1996. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1996. 215 $a1 online resource (CCXXXVI, 225 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1039 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-60865-6 327 $aAttacks on the HKM / HFX cryptosystem -- Truncated differentials of SAFER -- On the weak keys of blowfish -- High-bandwidth encryption with low-bandwidth smartcards -- ISAAC -- A note on the hash function of Tillich and zémor -- Cryptanalysis of MD4 -- RIPEMD-160: A strengthened version of RIPEMD -- Fast accumulated hashing -- Tiger: A fast new hash function -- The cipher SHARK -- Two practical and provably secure block ciphers: BEAR and LION -- Unbalanced Feistel networks and block cipher design -- A comparison of fast correlation attacks -- Correlation attacks on stream ciphers: Computing low-weight parity checks based on error-correcting codes -- On the security of nonlinear filter generators -- Faster Luby-Rackoff ciphers -- New structure of block ciphers with provable security against differential and linear cryptanalysis. 330 $aThis book constitutes the refereed proceedings of the Third International Workshop on Fast Software Encryption; this workshop was held in conjunction with the program on computer security, cryptology, and coding theory at the Isaac Newton Institute in Cambridge, UK in February 1996. The 18 revised papers presented were carefully selected for inclusion in the volume by the program committee. They report the state of the art in the field of fast encryption algorithms and are organized in sections on block cipher analysis, applications, hash functions, block cipher proposals, correlation analysis, and design criteria for block ciphers. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1039 606 $aComputers 606 $aData encryption (Computer science) 606 $aSoftware engineering 606 $aAlgorithms 606 $aCoding theory 606 $aInformation theory 606 $aCombinatorics 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aCryptology$3https://scigraph.springernature.com/ontologies/product-market-codes/I28020 606 $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002 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 $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010 615 0$aComputers. 615 0$aData encryption (Computer science). 615 0$aSoftware engineering. 615 0$aAlgorithms. 615 0$aCoding theory. 615 0$aInformation theory. 615 0$aCombinatorics. 615 14$aTheory of Computation. 615 24$aCryptology. 615 24$aSoftware Engineering/Programming and Operating Systems. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aCoding and Information Theory. 615 24$aCombinatorics. 676 $a005.8/2 702 $aGollmann$b Dieter$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465852503316 996 $aFast Software Encryption$9772084 997 $aUNISA LEADER 01823nam0 22004333i 450 001 LO10009686 005 20251003044204.0 020 $aIT$bS8-792 100 $a20140605d1975 ||||0itac50 ba 101 | $aita 102 $ait 181 1$6z01$ai $bxxxe 182 1$6z01$ay 200 1 $aComplessita di calcolo delle funzioni$fGiorgio Ausiello 210 $aTorino$cBoringhieri$d1975 215 $a240 p.$d21 cm. 225 | $aTesti e manuali della scienza contemporanea$i. Serie di informatica 410 0$1001CFI0067990$12001 $aTesti e manuali della scienza contemporanea$i. Serie di informatica 606 $aFunzioni ricorsive$2FIR$3LO1C035339$9I 606 $aComplessità computazionale$2FIR$3CFIC110237$9E 676 $a511.3$9LOGICA SIMBOLICA (LOGICA MATEMATICA)$v12 676 $a511.3$9LOGICA MATEMATICA (LOGICA SIMBOLICA)$v14 676 $a511.3$9LOGICA SIMBOLICA (LOGICA MATEMATICA)$v19 676 $a511.352$9LOGICA MATEMATICA (LOGICA SIMBOLICA). FUNZIONI RICORSIVE$v22 676 $a519.4$9ANALISI NUMERICA APPLICATA$v20 696 $aFunzioni recorsive 699 $aFunzioni ricorsive$yFunzioni recorsive 700 1$aAusiello$b, Giorgio$3CFIV008406$4070$0439546 790 1$aAusiello$b, G.$3SBNV006665$zAusiello, Giorgio 801 3$aIT$bIT-000000$c20140605 850 $aIT-BN0095 $aIT-AV0007 $aIT-NA0695 901 $bNAP AV$cSEZ. M 3 $n$ 901 $bNAP 01$cSALA DING $n$ 901 $bNAP PG$cBIBLIOTECA$n$ 912 $aLO10009686 950 0$aBiblioteca Centralizzata di Ateneo$c1 v.$d 01SALA DING 511.3 AUS.co$e 0102 0000001765 VMA A4 1 v.$fY $h19930429$i19930429 977 $a 01$a AV$a PG 996 $aComplessità di calcolo delle funzioni$974438 997 $aUNISANNIO