Topics in Cryptology - CT-RSA 2002
Editat de Bart Preneelen Limba Engleză Paperback – 6 feb 2002
Preț: 322.61 lei
Preț vechi: 403.26 lei
-20% Nou
Puncte Express: 484
Preț estimativ în valută:
57.08€ • 66.50$ • 49.84£
57.08€ • 66.50$ • 49.84£
Carte tipărită la comandă
Livrare economică 17-31 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540432241
ISBN-10: 3540432248
Pagini: 328
Ilustrații: X, 318 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.5 kg
Ediția:2002
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540432248
Pagini: 328
Ilustrații: X, 318 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.5 kg
Ediția:2002
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Public Key Cryptography.- On Hash Function Firewalls in Signature Schemes.- Observability Analysis - Detecting When Improved Cryptosystems Fail -.- Efficient Hardware Implementations.- Precise Bounds for Montgomery Modular Multiplication and Some Potentially Insecure RSA Moduli.- Montgomery in Practice: How to Do It More Efficiently in Hardware.- MIST: An Efficient, Randomized Exponentiation Algorithm for Resisting Power Analysis.- An ASIC Implementation of the AES SBoxes.- Public Key Cryptography: Theory.- On the Impossibility of Constructing Non-interactive Statistically-Secret Protocols from Any Trapdoor One-Way Function.- The Representation Problem Based on Factoring.- Symmetric Ciphers.- Ciphers with Arbitrary Finite Domains.- Known Plaintext Correlation Attack against RC5.- E-Commerce and Applications.- Micropayments Revisited.- Proprietary Certificates.- Stateless-Recipient Certified E-Mail System Based on Verifiable Encryption.- Digital Signatures.- RSA-Based Undeniable Signatures for General Moduli.- Co-operatively Formed Group Signatures.- Transitive Signature Schemes.- Homomorphic Signature Schemes.- Public Key Encryption.- GEM: A Generic Chosen-Ciphertext Secure Encryption Method.- Securing “Encryption + Proof of Knowledge” in the Random Oracle Model.- Discrete Logarithm.- Nonuniform Polynomial Time Algorithm to Solve Decisional Diffie-Hellman Problem in Finite Fields under Conjecture.- Secure Key-Evolving Protocols for Discrete Logarithm Schemes.
Caracteristici
Includes supplementary material: sn.pub/extras