Cargando…

Progress in Cryptology - INDOCRYPT 2005 6th International Conference on Cryptology in India, Bangalore, India, December 10-12, 2005, Proceedings /

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Maitra, Subhamoy (Editor ), Madhavan, C.E. Veni (Editor ), Venkatesan, Ramarathnam (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2005.
Edición:1st ed. 2005.
Colección:Security and Cryptology ; 3797
Temas:
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-3-540-32278-8
003 DE-He213
005 20220115062255.0
007 cr nn 008mamaa
008 100410s2005 gw | s |||| 0|eng d
020 |a 9783540322788  |9 978-3-540-32278-8 
024 7 |a 10.1007/11596219  |2 doi 
050 4 |a QA268 
072 7 |a GPJ  |2 bicssc 
072 7 |a URY  |2 bicssc 
072 7 |a COM053000  |2 bisacsh 
072 7 |a GPJ  |2 thema 
072 7 |a URY  |2 thema 
082 0 4 |a 005.824  |2 23 
245 1 0 |a Progress in Cryptology - INDOCRYPT 2005  |h [electronic resource] :  |b 6th International Conference on Cryptology in India, Bangalore, India, December 10-12, 2005, Proceedings /  |c edited by Subhamoy Maitra, C.E. Veni Madhavan, Ramarathnam Venkatesan. 
250 |a 1st ed. 2005. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2005. 
300 |a XIV, 420 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 Security and Cryptology ;  |v 3797 
505 0 |a Invited Talk -- Abelian Varieties and Cryptography -- Sequences -- Proof of a Conjecture on the Joint Linear Complexity Profile of Multisequences -- Period of Streamcipher Edon80 -- Boolean Function and S-Box -- On the Algebraic Immunity of Symmetric Boolean Functions -- On Highly Nonlinear S-Boxes and Their Inability to Thwart DPA Attacks -- Hash Functions -- How to Construct Universal One-Way Hash Functions of Order r -- Towards Optimal Double-Length Hash Functions -- Design Principles -- Near Optimal Algorithms for Solving Differential Equations of Addition with Batch Queries -- Design Principles for Combiners with Memory -- Cryptanalysis I -- Cryptanalysis of the Quadratic Generator -- Attack the Dragon -- Two Algebraic Attacks Against the F-FCSRs Using the IV Mode -- Cryptanalysis of Keystream Generator by Decimated Sample Based Algebraic and Fast Correlation Attacks -- Time Memory Trade-Off -- TMD-Tradeoff and State Entropy Loss Considerations of Streamcipher MICKEY -- Time-Memory Trade-Offs: False Alarm Detection Using Checkpoints -- Cryptanalysis II -- Cryptanalysis of Barni et al. Watermarking Scheme -- Completion Attacks and Weak Keys of Oleshchuk's Public Key Cryptosystem -- New Constructions -- An Optimal Subset Cover for Broadcast Encryption -- MaTRU: A New NTRU-Based Cryptosystem -- Anonymous Password-Based Authenticated Key Exchange -- Pairings -- Faster Pairings Using an Elliptic Curve with an Efficient Endomorphism -- Reconsideration on the Security of the Boneh-Franklin Identity-Based Encryption Scheme -- Signatures -- Short Undeniable Signatures Without Random Oracles: The Missing Link -- Short Threshold Signature Schemes Without Random Oracles -- Applications -- Attacking an Asynchronous Multi-party Contract Signing Protocol -- Fairness and Correctness in Case of a Premature Abort -- E-Cash -- Short E-Cash -- A Universally Composable Scheme for Electronic Cash -- Implementations -- Energy-Privacy Trade-Offs in VLSI Computations -- Modified Serial Multipliers for Type-IV Gaussian Normal Bases -- Scalar Multiplication on Elliptic Curves Defined over Fields of Small Odd Characteristic -- SCA Resistant Parallel Explicit Formula for Addition and Doubling of Divisors in the Jacobian of Hyperelliptic Curves of Genus 2. 
650 0 |a Cryptography. 
650 0 |a Data encryption (Computer science). 
650 0 |a Coding theory. 
650 0 |a Information theory. 
650 0 |a Algorithms. 
650 0 |a Computer science-Mathematics. 
650 0 |a Discrete mathematics. 
650 0 |a Operating systems (Computers). 
650 0 |a Computer networks . 
650 1 4 |a Cryptology. 
650 2 4 |a Coding and Information Theory. 
650 2 4 |a Algorithms. 
650 2 4 |a Discrete Mathematics in Computer Science. 
650 2 4 |a Operating Systems. 
650 2 4 |a Computer Communication Networks. 
700 1 |a Maitra, Subhamoy.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Madhavan, C.E. Veni.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Venkatesan, Ramarathnam.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783540818632 
776 0 8 |i Printed edition:  |z 9783540308058 
830 0 |a Security and Cryptology ;  |v 3797 
856 4 0 |u https://doi.uam.elogim.com/10.1007/11596219  |z Texto Completo 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710)