Direkt zum Inhalt
Save 5% on your next order with code PREMIUM5!
100,000+ Products for Home, Medical, Office & Classroom Needs
Search
Zu Produktinformationen springen
1 von 2

Cryptography and Computational Number Theory - Hardcover

$160.38 USD
$160.38 USD
Sale Ausverkauft
Versand wird beim Checkout berechnet
In stock (100 units), ready to be shipped

Available Offers

Fast delivery available on most orders

Multiple secure payment options accepted

Secure checkout with
  • American Express
  • Apple Pay
  • Bancontact
  • Diners Club
  • Discover
  • Google Pay
  • Mastercard
  • PayPal
  • Shop Pay
  • Visa
Vollständige Details anzeigen

Product Description

by K. y. Lam (Author), I. Shparll Inski (Author), H. Wang (Author)

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.

Number of Pages: 392
Dimensions: 0.88 x 9.21 x 6.14 IN
Illustrated: Yes
Publication Date: March 23, 2001
you might like