Topics in Cryptology - CT-RSA 2002 The Cryptographer's Track at the RSA Conference 2002, San Jose, CA, USA, February 18-22, 2002, Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Preneel, Bart (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2002.
• Έκδοση: 1st ed. 2002.
• Σειρά: Lecture Notes in Computer Science, 2271
• Θέματα: Data encryption (Computer science).; Computers.; Operating systems (Computers).; Computer science-Mathematics.; Management information systems.; Computer science.; Algorithms.; Cryptology.; Theory of Computation.; Operating Systems.; Discrete Mathematics in Computer Science.; Management of Computing and Information Systems.; Algorithm Analysis and Problem Complexity.

This volume continues the tradition established in 2001 of publishing the c- tributions presented at the Cryptographers' Track (CT-RSA) of the yearly RSA Security Conference in Springer-Verlag's Lecture Notes in Computer Science series. With 14 parallel tracks and many thousands of partici...

Πίνακας περιεχομένων:

• 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.