Lecture Notes in Computer Science : The Cryptographer's Track at the RSA Conference 2002, San Jose, CA, USA, February 18-22, 2002, Proceedings - Bart Preneel

Instant online reading.
Don't wait for delivery!

Lecture Notes in Computer Science

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

By: Bart Preneel (Editor)

Write A Review

Paperback | 6 February 2002

At a Glance

Paperback
328 Pages

Dimensions(cm)
22.86 x 15.24 x 1.91

Paperback

$84.99

or 4 interest-free payments of $21.25 with

Ships in 5 to 7 business days

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 participants, the RSA - curity Conference is the largest e-security and cryptography conference. In this setting, the Cryptographers' Track presents the latest scienti?c developments. The program committee considered 49 papers and selected 20 for presen- tion. One paper was withdrawn by the authors. The program also included two invited talks by Ron Rivest ("Micropayments Revisited" - joint work with Silvio Micali) and by Victor Shoup ("The Bumpy Road from Cryptographic Theory to Practice"). Each paper was reviewed by at least three program committee members; paperswrittenbyprogramcommitteemembersreceivedsixreviews.Theauthors of accepted papers made a substantial e?ort to take into account the comments intheversionsubmittedtotheseproceedings.Inalimitednumberofcases,these revisions were checked by members of the program committee. I would like to thank the 20 members of the program committee who helped to maintain the rigorous scienti?c standards to which the Cryptographers' Track aims to adhere. They wrote thoughtful reviews and contributed to long disc- sions; more than 400 Kbyte of comments were accumulated. Many of them - tended the program committee meeting, while they could have been enjoying the sunny beaches of Santa Barbara.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $89.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.

Defective items

If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.

For more info please visit our Help Centre.

Public Key Cryptography
On Hash Function Firewalls in Signature Schemes	p. 1
Observability Analysis - Detecting When Improved Cryptosystems Fail	p. 17
Efficient Hardware Implementations
Precise Bounds for Montgomery Modular Multiplication and Some Potentially Insecure RSA Moduli	p. 30
Montgomery in Practice: How to Do It More Efficiently in Hardware	p. 40
Mist: An Efficient, Randomized Exponentiation Algorithm for Resisting Power Analysis	p. 53
An ASIC Implementation of the AES SBoxes	p. 67
Public Key Cryptography: Theory
On the Impossibility of Constructing Non-interactive Statistically-Secret Protocols from Any Trapdoor One-Way Function	p. 79
The Representation Problem Based on Factoring	p. 96
Symmetric Ciphers
Ciphers with Arbitrary Finite Domains	p. 114
Known Plaintext Correlation Attack against RC5	p. 131
E-Commerce and Applications
Micropayments Revisited	p. 149
Proprietary Certificates	p. 164
Stateless-Recipient Certified E-Mail System Based on Verifiable Encryption	p. 182
Digital Signatures
RSA-Based Undeniable Signatures for General Moduli	p. 200
Co-operatively Formed Group Signatures	p. 218
Transitive Signature Schemes	p. 236
Homomorphic Signature Schemes	p. 244
Public Key Encryption
GEM: A Generic Chosen-Ciphertext Secure Encryption Method	p. 263
Securing ôEncryption + Proof of Knowledgeö in the Random Oracle Model	p. 277
Discrete Logarithm
Nonuniform Polynomial Time Algorithm to Solve Decisional Diffie-Hellman Problem in Finite Fields under Conjecture	p. 290
Secure Key-Evolving Protocols for Discrete Logarithm Schemes	p. 300
Author Index	p. 311
Table of Contents provided by Publisher. All Rights Reserved.

Lecture Notes in Computer Science

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

At a Glance

Paperback

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Algorithms & Data Structures

Ethics and Governance of Artificial Intelligence

Frameworks, Risks, and Society

Areas of Success for AI

Third Annual Workshop, Embry-Riddle L. H. Harper Memorial AI Workshop 2025, Prescott, AZ, USA, August 15-16, 2025, Proceedings

Neural Networks

Overview of Current Theories and Applications

The Man Who Solved the Market

How Jim Simons Launched the Quant Revolution SHORTLISTED FOR THE FT & MCKINSEY BUSINESS BOOK OF THE YEAR AWARD 2019

Artificial Intelligence Programming with Python

From Zero to Hero

Algorithms in C, Parts 1-4

3rd Edition - Fundamentals, Data Structures, Sorting, Searching

Data Science from Scratch

First Principles with Python

Python for Algorithmic Trading

From Idea to Cloud Deployment

Code Dependent

Living in the Shadow of AI

Addiction by Design

Machine Gambling in Las Vegas

Introduction to Machine Learning with Python

A Guide for Data Scientists

Deep Learning Applications

Select Topics

Computational Physics Using C

Efficient Programming with Ease

Multimedia Computing, Communication and Intelligence

Multimedia Computing, Communication and Intelligence

Algorithms for Smart World Technologies

A Comprehensive Guide to Applications in AI, IoT and Automation for Electrical and Computer Engineers

Learning-Enabled Autonomous Systems

Control, Verification, and Monitoring

Social Network Analytics

Empowering Data Engineering with Deep Learning and Large Language Models

The Metaverse

Hype or Hoax?

Mathematical Foundations of Deep Learning

Theory and Algorithms

Mathematical Foundations of Deep Learning

Theory and Algorithms

Computational Modelling with Single Prompts

Series in Computational Physics

Theory of Computation for Software Developers

Fundamentals of Quantum Computing

Solving Problems with Quantum Algorithms and Practical Qiskit Coding

Data-Driven Modeling & Scientific Computation

Methods for Complex Systems & Big Data

This product is categorised by