Advances in Cryptology - ASIACRYPT'99

International Conference on the Theory and Application of Cryptology and Information Security, Singapore, November 14-18, 1999 Proceedings

AvKwok Yan Lam,Eiji Okamoto

Häftad, Engelska, 1999

Del i serien Lecture Notes in Computer Science

549 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

This book constitutes the refereed proceedings of the 5th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT'99, held in Singapore in November 1999. The 31 revised full papers presented together with one invited paper were carefully reviewed and selected from a total of 96 submissions. The book is divided in topical sections on assymetric key cryptosystems, cryptanalysis, elliptic curve cryptosystems, public key cryptosystems, integers and computation, network security, random numbers, key management, and authentication.

Produktinformation

Utgivningsdatum:1999-10-20
Mått:155 x 235 x 24 mm
Vikt:651 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:420
Upplaga:1999
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540666660

Utforska kategorier

IT-säkerhet inom Data och IT

Innehållsförteckning

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.