Advances in Cryptology - ASIACRYPT'99
Springer Berlin (Verlag)
978-3-540-66666-0 (ISBN)
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.
Erscheint lt. Verlag | 20.10.1999 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science |
Zusatzinfo | XII, 420 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 556 g |
Themenwelt | Informatik ► Theorie / Studium ► Kryptologie |
Schlagworte | Algorithm analysis and problem complexity • algorithms • boolean function • Complexity • Cryptanalysis • Cryptology • data encryption • Data Security • DES • Information protection • Information Security • Kryptographie / Kryptologie • Networks • privacy • security • SIGNATUR |
ISBN-10 | 3-540-66666-4 / 3540666664 |
ISBN-13 | 978-3-540-66666-0 / 9783540666660 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich