Cryptography and Computational Number Theory : Workshop in Singapore, 1999

Hrsg. v. Lam, Kwok-Yan /Shparlinski, Igor /Wang, Huaxiong /Xing, Chaoping

ISBN 10: 3764365102 / ISBN 13: 9783764365103

Verlag: Springer Basel, 2001

Beschreibung

Zustand: Gut | Seiten: 378 | Sprache: Englisch | Produktart: Bücher.

Bestandsnummer des Verkäufers 206585/3

Bibliografische Details

• Titel: Cryptography and Computational Number Theory : Workshop in Singapore, 1999
• Verlag: Springer Basel
• Erscheinungsjahr: 2001
• Sprache: Englisch
• ISBN-10: 3764365102
• ISBN-13: 9783764365103
• Einband: Hardcover
• Zustand: Gut

Über diesen Titel

Inhaltsangabe

Computational Number Theory.- On the Dimension and the Number of Parameters of a Unirational Variety.- On Elements of High Order in Finite Fields.- Counting the Number of Points on Affine Diagonal Curves.- Small Values of the Carmichael Function and Cryptographic Applications.- Density Estimates Related to Gauss Periods.- Distribution of the Coefficients of Primitive Polynomials over Finite Fields.- The Distribution of the Quadratic Symbol in Function Fields and a Faster Mathematical Stream Cipher.- Rational Groups of Elliptic Curves Suitable for Cryptography.- Effective Determination of the Proportion of Split Primes in Number Fields.- Algorithms for Generating, Testing and Proving Primes: A Survey.- Elliptic Curve Factorization Using a "Partially Oblivious" Function.- The Hermite-Serret Algorithm and 122 + 332.- Applications of Algebraic Curves to Constructions of Sequences.- Cryptography.- Designated 2-Verifier Proofs and their Application to Electronic Commerce.- Divide and Conquer Attacks on Certain Irregularly Clocked Stream Ciphers.- New Results on the Randomness of Visual Cryptography Schemes.- Authentication - Myths and Misconceptions.- A Survey of Bit-security and Hard Core Functions.- On the Security of Diffie-Hellman Bits.- Polynomial Rings and Efficient Public Key Authentication II.- Security of Biased Sources for Cryptographic Keys.- Achieving Optimal Fairness from Biased Coinflips.- The Dark Side of the Hidden Number Problem: Lattice Attacks on DSA.- Distribution of Modular Sums and the Security of the Server Aided Exponentiation.- A General Construction for Fail-Stop Signatures using Authentication Codes.- Robust Additive Secret Sharing Schemes over Zm.- RSA Public Key Validation.

Reseña del editor

The fields of cryptography and computational number theory have recently witnessed a rapid development, which was the subject of the CCNT workshop in Singapore in November 1999. Its aim was to stimulate further research in information and computer security as well as the design and implementation of number theoretic cryptosystems and other related areas. Another achievement of the meeting was the collaboration of mathematicians, computer scientists, practical cryptographers and engineers in academia, industry and government. The present volume comprises a selection of refereed papers originating from this event, presenting either a survey of some area or original and new results. They concern many different aspects of the field such as theory, techniques, applications and practical experience. It provides a state-of-the-art report on some number theoretical issues of significance to cryptography.