Cryptography and Computational Number Theory (Progress in Computer Science and Applied Logic (PCS))

ISBN 10: 3764365102 ISBN 13: 9783764365103
Edité par Birkhäuser Basel, 2001
Ancien(s) ou d'occasion Hardcover

Vendeur Midtown Scholar Bookstore, Harrisburg, PA, Etats-Unis Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Vendeur AbeBooks depuis 7 juin 2002


A propos de cet article

Description :

no dust jacket as issued No dust jacket. Very Good hardcover with light shelfwear - NICE! Standard-sized. N° de réf. du vendeur mon0000119494

Signaler cet article

Synopsis :

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.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Détails bibliographiques

Titre : Cryptography and Computational Number Theory...
Éditeur : Birkhäuser Basel
Date d'édition : 2001
Reliure : Hardcover
Etat : Very Good

Meilleurs résultats de recherche sur AbeBooks

There are 3 autres exemplaires de ce livre sont disponibles

Afficher tous les résultats pour ce livre