Vor Ort
Merkzettel Warenkorb
  • Produktbild: Advances in Cryptology - ASIACRYPT'99
  • Produktbild: Advances in Cryptology - ASIACRYPT'99
Band 1716

Advances in Cryptology - ASIACRYPT'99 International Conference on the Theory and Application of Cryptology and Information Security, Singapore, November 14-18, 1999 Proceedings

Aus der Reihe Lecture Notes in Computer Science

51,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

20.10.1999

Abbildungen

XII, 420 p.

Herausgeber

Kwok Yan Lam + weitere

Verlag

Springer Berlin

Seitenzahl

420

Maße (L/B/H)

23,5/15,5/2,4 cm

Gewicht

651 g

Auflage

1999

Sprache

Englisch

ISBN

978-3-540-66666-0

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

20.10.1999

Abbildungen

XII, 420 p.

Herausgeber

Verlag

Springer Berlin

Seitenzahl

420

Maße (L/B/H)

23,5/15,5/2,4 cm

Gewicht

651 g

Auflage

1999

Sprache

Englisch

ISBN

978-3-540-66666-0

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: ProductSafety@springernature.com

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Advances in Cryptology - ASIACRYPT'99
  • Produktbild: Advances in Cryptology - ASIACRYPT'99
  • Invited Talk.- Modulus Search for Elliptic Curve Cryptosystems.- Asymmetric Key Cryptosystems.- On the Lai-Massey Scheme.- On Cryptographically Secure Vectorial Boolean Functions.- Analysis.- Equivalent Keys of HPC.- Cryptanalysis of Five Rounds of CRYPTON Using Impossible Differentials.- Cryptanalysis of Two Cryptosystems Based on Group Actions.- Probabilistic Higher Order Differential Attack and Higher Order Bent Functions.- Elliptic Curve Cryptosystems.- Fast Algorithms for Elliptic Curve Cryptosystems over Binary Finite Field.- Optimizing the Menezes-Okamoto-Vanstone (MOV) Algorithm for Non-supersingular Elliptic Curves.- Speeding up the Discrete Log Computation on Curves with Automorphisms.- ECC: Do We Need to Count?.- Elliptic Scalar Multiplication Using Point Halving.- Public Key Cryptosystems.- On the Design of RSA with Short Secret Exponent.- Efficient Public-Key Cryptosystems Provably Secure Against Active Adversaries.- Adaptively-Secure Optimal-Resilience Proactive RSA.- Integers and Computation.- Factorization of RSA-140 Using the Number Field Sieve.- How to Prove That a Committed Number Is Prime.- Reducing Logarithms in Totally Non-maximal Imaginary Quadratic Orders to Logarithms in Finite Fields.- General Adversaries in Unconditional Multi-party Computation.- Network Security.- Approximation Hardness and Secure Communication in Broadcast Channels.- Mix-Networks on Permutation Networks.- Secure Communication in an Unknown Network Using Certificates.- Random Number.- Linear Complexity versus Pseudorandomness: On Beth and Dai’s Result.- A Class of Explicit Perfect Multi-sequences.- Cryptanalysis of LFSR-Encrypted Codes with Unknown Combining Function.- Key Management.- Doing More with Fewer Bits.- A Quick Group Key Distribution Scheme with “EntityRevocation”.- An Efficient Hierarchical Identity-Based Key-Sharing Method Resistant against Collusion-Attacks.- Periodical Multi-secret Threshold Cryptosystems.- Authentication.- A Signature Scheme with Message Recovery as Secure as Discrete Logarithm.- A 3-Codes under Collusion Attacks.- Broadcast Authentication in Group Communication.