Cryptography and Computational Number Theory: Progress in Computer Science and Applied Logic (PCS), cartea 20
Editat de Kwok Y. Lam, Igor Shparlinski, Huaxiong Wang, Chaoping Xingen Limba Engleză Hardback – 31 ian 2001
Preț: 566.60 lei
Preț vechi: 666.59 lei
-15%
Puncte Express: 850
Carte tipărită la comandă
Livrare economică 15-29 iulie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit pentru acest produs Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783764365103
ISBN-10: 3764365102
Pagini: 378
Dimensiuni: 162 x 238 x 25 mm
Greutate: 0.72 kg
Editura: Birkhauser
Colecția Birkhauser
Seriile Progress in Computer Science and Applied Logic (PCS), Milestones in Drug Therapy
Locul publicării:Basel, Switzerland
ISBN-10: 3764365102
Pagini: 378
Dimensiuni: 162 x 238 x 25 mm
Greutate: 0.72 kg
Editura: Birkhauser
Colecția Birkhauser
Seriile Progress in Computer Science and Applied Logic (PCS), Milestones in Drug Therapy
Locul publicării:Basel, Switzerland
Public țintă
ResearchCuprins
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.