Cryptography and Computational Number Theory: Progress in Computer Science and Applied Logic, cartea 20
Editat de Kwok Y. Lam, Igor Shparlinski, Huaxiong Wang, Chaoping Xingen Limba Engleză Paperback – 29 oct 2012
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (1) | 378.78 lei 6-8 săpt. | |
| Birkhäuser Basel – 29 oct 2012 | 378.78 lei 6-8 săpt. | |
| Hardback (1) | 566.60 lei 6-8 săpt. | |
| Birkhauser – 31 ian 2001 | 566.60 lei 6-8 săpt. |
Din seria Progress in Computer Science and Applied Logic
- 20%
Preț: 329.74 lei -
Preț: 365.82 lei - 20%
Preț: 320.86 lei - 20%
Preț: 980.69 lei - 15%
Preț: 568.52 lei - 20%
Preț: 327.54 lei - 20%
Preț: 662.12 lei - 20%
Preț: 321.98 lei - 20%
Preț: 630.51 lei -
Preț: 373.03 lei - 20%
Preț: 564.08 lei - 20%
Preț: 456.63 lei -
Preț: 395.25 lei -
Preț: 388.40 lei - 15%
Preț: 621.80 lei - 15%
Preț: 621.48 lei - 20%
Preț: 621.81 lei - 20%
Preț: 326.72 lei - 15%
Preț: 671.94 lei - 15%
Preț: 628.56 lei - 18%
Preț: 701.91 lei -
Preț: 384.13 lei - 20%
Preț: 484.20 lei - 20%
Preț: 322.29 lei -
Preț: 365.45 lei -
Preț: 366.56 lei - 20%
Preț: 322.11 lei
Preț: 378.78 lei
Nou
Puncte Express: 568
Preț estimativ în valută:
67.02€ • 78.70$ • 58.83£
67.02€ • 78.70$ • 58.83£
Carte tipărită la comandă
Livrare economică 27 ianuarie-10 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783034895071
ISBN-10: 3034895070
Pagini: 392
Ilustrații: VIII, 378 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.55 kg
Ediția:Softcover reprint of the original 1st ed. 2001
Editura: Birkhäuser Basel
Colecția Birkhäuser
Seria Progress in Computer Science and Applied Logic
Locul publicării:Basel, Switzerland
ISBN-10: 3034895070
Pagini: 392
Ilustrații: VIII, 378 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.55 kg
Ediția:Softcover reprint of the original 1st ed. 2001
Editura: Birkhäuser Basel
Colecția Birkhäuser
Seria Progress in Computer Science and Applied Logic
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.