Srinathan / Yung / Pandu Rangan | Progress in Cryptology - INDOCRYPT 2007 | Buch | 978-3-540-77025-1 | sack.de

Buch, Englisch, 428 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 663 g

Reihe: Security and Cryptology

Srinathan / Yung / Pandu Rangan

Progress in Cryptology - INDOCRYPT 2007

8th International Conference on Cryptology in India, Chennai, India, December 9-13, 2007, Proceedings
2007
ISBN: 978-3-540-77025-1
Verlag: Springer Berlin Heidelberg

8th International Conference on Cryptology in India, Chennai, India, December 9-13, 2007, Proceedings

Buch, Englisch, 428 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 663 g

Reihe: Security and Cryptology

ISBN: 978-3-540-77025-1
Verlag: Springer Berlin Heidelberg


This book constitutes the refereed proceedings of the 8th International Conference on Cryptology in India, INDOCRYPT 2007, held in Chennai, India, in December 2007. The papers and three invited lectures were carefully reviewed and selected. The papers are organized in topical sections on hashing, elliptic curve, cryptoanalysis, information theoretic security, elliptic curve cryptography, signature, side channel attack, symmetric cryptosystem, asymmetric cryptosystem, and short papers.

Srinathan / Yung / Pandu Rangan Progress in Cryptology - INDOCRYPT 2007 jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


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 PeriodicSequences.- 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.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.