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

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

by Bart Preneel
     
 

ISBN-10: 3540432248

ISBN-13: 9783540432241

Pub. Date: 03/22/2002

Publisher: Springer Berlin Heidelberg

This book constitutes the refereed proceedings of the Cryptographer's Track at the RSA Conference 2002, CT-RSA 2002, held in San Jose, CA, USA, in February 2002.
The 20 revised full papers presented together with an invited paper were carefully reviewed and selected from 49 submissions. The papers are organized in topical sections on public key cryptography,

…  See more details below

Overview

This book constitutes the refereed proceedings of the Cryptographer's Track at the RSA Conference 2002, CT-RSA 2002, held in San Jose, CA, USA, in February 2002.
The 20 revised full papers presented together with an invited paper were carefully reviewed and selected from 49 submissions. The papers are organized in topical sections on public key cryptography, efficient hardware implementations, symmetric cyphers, e-commerce and applications, digital signatures, public key encryption, and discrete logarithm.

Product Details

ISBN-13:
9783540432241
Publisher:
Springer Berlin Heidelberg
Publication date:
03/22/2002
Series:
Lecture Notes in Computer Science Series, #2271
Edition description:
2002
Pages:
318
Product dimensions:
9.21(w) x 6.14(h) x 0.69(d)

Table of Contents

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 Prools 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 Prools for Discrete Logarithm Schemes.

Read More

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >