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) | 393.74 lei 43-57 zile | |
Birkhäuser Basel – 29 oct 2012 | 393.74 lei 43-57 zile | |
Hardback (1) | 589.30 lei 43-57 zile | |
Birkhauser – 31 ian 2001 | 589.30 lei 43-57 zile |
Din seria Progress in Computer Science and Applied Logic
- 20% Preț: 342.78 lei
- Preț: 380.25 lei
- 20% Preț: 333.54 lei
- 20% Preț: 1020.33 lei
- 15% Preț: 591.29 lei
- 20% Preț: 340.49 lei
- 20% Preț: 611.79 lei
- 20% Preț: 334.71 lei
- 20% Preț: 655.85 lei
- Preț: 387.75 lei
- 15% Preț: 588.04 lei
- 20% Preț: 586.71 lei
- 20% Preț: 474.87 lei
- Preț: 410.88 lei
- Preț: 403.75 lei
- 15% Preț: 646.75 lei
- 15% Preț: 646.43 lei
- 20% Preț: 646.80 lei
- 20% Preț: 339.66 lei
- 15% Preț: 698.94 lei
- 15% Preț: 653.79 lei
- 18% Preț: 730.79 lei
- Preț: 399.29 lei
- 20% Preț: 420.91 lei
- 20% Preț: 335.03 lei
- Preț: 379.86 lei
- Preț: 381.00 lei
- 20% Preț: 334.86 lei
Preț: 393.74 lei
Nou
Puncte Express: 591
Preț estimativ în valută:
75.35€ • 78.19$ • 62.98£
75.35€ • 78.19$ • 62.98£
Carte tipărită la comandă
Livrare economică 17-31 martie
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.