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) | 385.81 lei 43-57 zile | |
Birkhäuser Basel – 29 oct 2012 | 385.81 lei 43-57 zile | |
Hardback (1) | 577.41 lei 43-57 zile | |
Birkhauser – 31 ian 2001 | 577.41 lei 43-57 zile |
Din seria Progress in Computer Science and Applied Logic
- 20% Preț: 335.90 lei
- Preț: 372.60 lei
- 20% Preț: 326.84 lei
- 20% Preț: 999.65 lei
- 15% Preț: 579.34 lei
- 20% Preț: 333.65 lei
- 20% Preț: 611.79 lei
- 20% Preț: 327.98 lei
- 20% Preț: 642.59 lei
- Preț: 379.96 lei
- 15% Preț: 576.15 lei
- 20% Preț: 574.85 lei
- 20% Preț: 465.28 lei
- Preț: 402.62 lei
- Preț: 395.64 lei
- 15% Preț: 633.70 lei
- 15% Preț: 633.36 lei
- 20% Preț: 635.90 lei
- 20% Preț: 332.83 lei
- 15% Preț: 684.81 lei
- 15% Preț: 641.20 lei
- 18% Preț: 716.01 lei
- Preț: 391.27 lei
- 20% Preț: 420.91 lei
- 20% Preț: 328.29 lei
- Preț: 372.24 lei
- Preț: 373.35 lei
- 20% Preț: 328.13 lei
Preț: 385.81 lei
Nou
Puncte Express: 579
Preț estimativ în valută:
73.84€ • 76.70$ • 61.33£
73.84€ • 76.70$ • 61.33£
Carte tipărită la comandă
Livrare economică 03-17 februarie 25
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.