This volume is a collection of refereed papers presented during AUSCRYPT '90 held in Sydney, Australia, January 8-11, 1990. This was the first conference of a series sponsored by the International Association for Cryptological Research (IACR) in addition to the EUROCRYPT series held in European countries and the CRYPTO series held in Santa Barbara, California. The volume is divided into sections on: - Public-key cryptosystems - Pseudorandomness and sequences - Network security - Authentication - Block ciphers - Zero-knowledge protocols - Theory - Applications - Implementations. It is a "must" for all researchers and students interested in recent progress in cryptology.
The implementation of elliptic curve cryptosystems.- Direct demonstration of the power to break public-key cryptosystems.- Continued fractions and the Berlekamp-Massey algorithm.- Nonlinear generators of binary sequences with controllable complexity and double key.- K-M sequence is forwardly predictable.- Lower bounds on the weight complexities of cascaded binary sequences.- Secure user access control for public networks.- Formal specification and verification of secure communication protocols.- Network security policy models.- KEYMEX: An expert system for the design of key management schemes.- On the formal analysis of PKCS authentication protocols.- Some remarks on authentication systems.- Meet-in-the-middle attack on digital signature schemes.- A binary sequence generator based on Ziv-Lempel source coding.- A fast iterative algorithm for a shift register initial state reconstruction given the noisy output sequence.- Parallel generation of pseudo-random sequences.- Large primes in stream cipher cryptography.- Comparison of block ciphers.- Key scheduling in des type cryptosystems.- LOKI - A cryptographic primitive for authentication and secrecy applications.- Permutation generators of alternating groups.- Showing credentials without identification transferring signatures between unconditionally unlinkable pseudonyms.- A (non-practical) three-pass identification protocol using coding theory.- Demonstrating possession without revealing factors and its application.- Anonymous one-time signatures and flexible untraceable electronic cash.- Dyadic matrices and their potential significance in cryptography (abstract).- A note on strong Fibonacci pseudoprimes.- On the significance of the directed acyclic word graph in cryptology.- Solving equations in sequences.- The practical application of state of the art security in real environments.- RSA as a benchmark for multiprocessor machines.- Range equations and range matrices: a study in statistical database security.- Record encryption in distributed databases.- VLSI design for exponentiation in GF(2n).- A fast modular-multiplication module for smart cards.- Minos: Extended user authentication.- Universal logic sequences.- The three faces of information security.- Secure cryptographic initialisation of remote terminals in an electronic funds transfer/point of sale system.
Series: Lecture Notes in Computer Science
Number Of Pages: 462
Published: 22nd August 1990
Publisher: SPRINGER VERLAG GMBH
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6
Weight (kg): 0.67