Progress in Cryptology – INDOCRYPT 2007 8th International Conference on Cryptology in India, Chennai, India, December 9-13, 2007. Proceedings /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Srinathan, K. (Επιμελητής έκδοσης), Rangan, C. Pandu (Επιμελητής έκδοσης), Yung, Moti (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007.
Σειρά:Lecture Notes in Computer Science, 4859
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 04651nam a22005775i 4500
001 978-3-540-77026-8
003 DE-He213
005 20151204181816.0
007 cr nn 008mamaa
008 100301s2007 gw | s |||| 0|eng d
020 |a 9783540770268  |9 978-3-540-77026-8 
024 7 |a 10.1007/978-3-540-77026-8  |2 doi 
040 |d GrThAP 
050 4 |a QA76.9.A25 
072 7 |a URY  |2 bicssc 
072 7 |a COM053000  |2 bisacsh 
082 0 4 |a 005.82  |2 23 
245 1 0 |a Progress in Cryptology – INDOCRYPT 2007  |h [electronic resource] :  |b 8th International Conference on Cryptology in India, Chennai, India, December 9-13, 2007. Proceedings /  |c edited by K. Srinathan, C. Pandu Rangan, Moti Yung. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2007. 
300 |a XI, 428 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 4859 
505 0 |a Hashing -- Linearization Attacks Against Syndrome Based Hashes -- A Meet-in-the-Middle Collision Attack Against the New FORK-256 -- Multilane HMAC— Security beyond the Birthday Limit -- Elliptic Curve -- On the Bits of Elliptic Curve Diffie-Hellman Keys -- A Result on the Distribution of Quadratic Residues with Applications to Elliptic Curve Cryptography -- Cryptoanalysis -- Related-Key Attacks on the Py-Family of Ciphers and an Approach to Repair the Weaknesses -- Related-Key Differential-Linear Attacks on Reduced AES-192 -- Improved Meet-in-the-Middle Attacks on Reduced-Round DES -- Information Theoretic Security -- Probabilistic Perfectly Reliable and Secure Message Transmission – Possibility, Feasibility and Optimality -- Secret Swarm Unit Reactive k??Secret Sharing -- Elliptic Curve Cryptography -- New Formulae for Efficient Elliptic Curve Arithmetic -- A Graph Theoretic Analysis of Double Base Number Systems -- Optimizing Double-Base Elliptic-Curve Single-Scalar Multiplication -- Signature -- Transitive Signatures from Braid Groups -- Proxy Re-signature Schemes Without Random Oracles -- Side Channel Attack -- First-Order Differential Power Analysis on the Duplication Method -- Solving Discrete Logarithms from Partial Knowledge of the Key -- Symmetric Cryptosystem -- New Description of SMS4 by an Embedding overGF(28) -- Tweakable Enciphering Schemes from Hash-Sum-Expansion -- A Framework for Chosen IV Statistical Analysis of Stream Ciphers -- Asymmetric Cryptosystem -- Public Key Encryption with Searchable Keywords Based on Jacobi Symbols -- A Certificate-Based Proxy Cryptosystem with Revocable Proxy Decryption Power -- Short Presentation -- Computationally-Efficient Password Authenticated Key Exchange Based on Quadratic Residues -- On the k-Operation Linear Complexity of Periodic Sequences -- Trade-Off Traitor Tracing -- X-FCSR – A New Software Oriented Stream Cipher Based Upon FCSRs -- Efficient Window-Based Scalar Multiplication on Elliptic Curves Using Double-Base Number System -- Extended Multi-Property-Preserving and ECM-Construction -- Design of a Differential Power Analysis Resistant Masked AES S-Box -- LFSR Based Stream Ciphers Are Vulnerable to Power Attacks -- An Update on the Side Channel Cryptanalysis of MACs Based on Cryptographic Hash Functions -- Attacking the Filter Generator by Finding Zero Inputs of the Filtering Function -- Efficient Implementations of Some Tweakable Enciphering Schemes in Reconfigurable Hardware. 
650 0 |a Computer science. 
650 0 |a Computer communication systems. 
650 0 |a Computer security. 
650 0 |a Data encryption (Computer science). 
650 0 |a Algorithms. 
650 0 |a Computer science  |x Mathematics. 
650 0 |a Management information systems. 
650 1 4 |a Computer Science. 
650 2 4 |a Data Encryption. 
650 2 4 |a Algorithm Analysis and Problem Complexity. 
650 2 4 |a Discrete Mathematics in Computer Science. 
650 2 4 |a Systems and Data Security. 
650 2 4 |a Computer Communication Networks. 
650 2 4 |a Management of Computing and Information Systems. 
700 1 |a Srinathan, K.  |e editor. 
700 1 |a Rangan, C. Pandu.  |e editor. 
700 1 |a Yung, Moti.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783540770251 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 4859 
856 4 0 |u http://dx.doi.org/10.1007/978-3-540-77026-8  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)