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
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 382.53 lei 6-8 săpt. | |
Birkhäuser Basel – 29 oct 2012 | 382.53 lei 6-8 săpt. | |
Hardback (1) | 572.43 lei 6-8 săpt. | |
Birkhauser – 31 ian 2001 | 572.43 lei 6-8 săpt. |
Preț: 572.43 lei
Preț vechi: 673.45 lei
-15% Nou
Puncte Express: 859
Preț estimativ în valută:
109.54€ • 115.21$ • 91.53£
109.54€ • 115.21$ • 91.53£
Carte tipărită la comandă
Livrare economică 09-23 ianuarie 25
Preluare comenzi: 021 569.72.76
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.